./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adee0aad8018029b1a093d0ddfc0de44abfd0e03 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adee0aad8018029b1a093d0ddfc0de44abfd0e03 .................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:10:22,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:10:22,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:10:22,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:10:22,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:10:22,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:10:22,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:10:22,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:10:22,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:10:22,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:10:22,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:10:22,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:10:22,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:10:22,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:10:22,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:10:22,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:10:22,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:10:22,345 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:10:22,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:10:22,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:10:22,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:10:22,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:10:22,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:10:22,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:10:22,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:10:22,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:10:22,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:10:22,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:10:22,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:10:22,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:10:22,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:10:22,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:10:22,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:10:22,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:10:22,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:10:22,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:10:22,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:10:22,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:10:22,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:10:22,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:10:22,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:10:22,364 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-15 22:10:22,376 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:10:22,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:10:22,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:10:22,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:10:22,378 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:10:22,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:10:22,378 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:10:22,379 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:10:22,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:10:22,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:10:22,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:10:22,379 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:10:22,380 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:10:22,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:10:22,380 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:10:22,380 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:10:22,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:10:22,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:10:22,381 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:10:22,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:10:22,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:10:22,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:10:22,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:10:22,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:10:22,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:10:22,383 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adee0aad8018029b1a093d0ddfc0de44abfd0e03 [2019-11-15 22:10:22,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:10:22,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:10:22,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:10:22,430 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:10:22,431 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:10:22,431 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i [2019-11-15 22:10:22,490 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/data/e504868e0/115a05a2da9a490e9ff8dd53633271ad/FLAGa4a5f6417 [2019-11-15 22:10:22,931 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:10:22,932 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i [2019-11-15 22:10:22,944 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/data/e504868e0/115a05a2da9a490e9ff8dd53633271ad/FLAGa4a5f6417 [2019-11-15 22:10:23,251 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/data/e504868e0/115a05a2da9a490e9ff8dd53633271ad [2019-11-15 22:10:23,253 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:10:23,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:10:23,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:10:23,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:10:23,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:10:23,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:10:23" (1/1) ... [2019-11-15 22:10:23,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31fce469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:10:23, skipping insertion in model container [2019-11-15 22:10:23,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:10:23" (1/1) ... [2019-11-15 22:10:23,270 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:10:23,306 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:10:23,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:10:23,697 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:10:23,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:10:23,794 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:10:23,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:10:23 WrapperNode [2019-11-15 22:10:23,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:10:23,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:10:23,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:10:23,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:10:23,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:10:23" (1/1) ... [2019-11-15 22:10:23,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:10:23" (1/1) ... [2019-11-15 22:10:23,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:10:23" (1/1) ... [2019-11-15 22:10:23,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:10:23" (1/1) ... [2019-11-15 22:10:23,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:10:23" (1/1) ... [2019-11-15 22:10:23,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:10:23" (1/1) ... [2019-11-15 22:10:23,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:10:23" (1/1) ... [2019-11-15 22:10:23,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:10:23,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:10:23,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:10:23,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:10:23,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:10:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:10:23,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:10:23,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:10:23,923 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:10:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:10:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:10:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:10:23,924 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:10:23,924 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:10:23,925 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:10:23,925 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:10:23,925 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:10:23,925 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:10:23,925 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:10:23,926 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:10:23,926 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:10:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:10:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:10:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:10:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:10:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:10:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:10:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:10:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:10:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:10:23,930 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:10:23,930 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:10:23,930 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:10:23,930 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:10:23,930 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:10:23,930 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:10:23,930 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:10:23,931 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:10:23,931 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:10:23,931 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:10:23,931 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:10:23,931 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:10:23,931 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:10:23,931 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:10:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:10:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:10:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:10:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:10:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:10:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:10:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:10:23,933 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:10:23,933 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:10:23,933 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:10:23,933 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:10:23,933 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:10:23,933 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:10:23,933 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:10:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:10:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:10:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:10:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:10:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:10:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 22:10:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:10:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:10:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:10:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:10:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:10:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:10:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:10:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:10:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:10:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:10:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:10:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:10:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:10:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:10:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:10:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:10:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:10:23,938 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:10:23,938 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:10:23,939 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:10:23,939 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:10:23,939 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:10:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:10:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:10:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:10:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:10:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:10:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:10:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:10:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:10:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:10:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:10:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:10:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:10:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:10:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:10:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:10:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:10:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:10:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:10:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:10:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:10:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:10:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:10:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:10:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:10:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:10:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:10:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:10:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:10:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:10:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:10:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:10:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:10:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:10:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:10:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:10:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:10:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:10:24,668 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:10:24,669 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:10:24,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:10:24 BoogieIcfgContainer [2019-11-15 22:10:24,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:10:24,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:10:24,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:10:24,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:10:24,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:10:23" (1/3) ... [2019-11-15 22:10:24,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b46eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:10:24, skipping insertion in model container [2019-11-15 22:10:24,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:10:23" (2/3) ... [2019-11-15 22:10:24,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b46eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:10:24, skipping insertion in model container [2019-11-15 22:10:24,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:10:24" (3/3) ... [2019-11-15 22:10:24,676 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-2.i [2019-11-15 22:10:24,685 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:10:24,691 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 48 error locations. [2019-11-15 22:10:24,701 INFO L249 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2019-11-15 22:10:24,718 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:10:24,718 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:10:24,719 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:10:24,719 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:10:24,719 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:10:24,719 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:10:24,719 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:10:24,719 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:10:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2019-11-15 22:10:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:10:24,744 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:24,745 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:24,747 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:24,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1984048928, now seen corresponding path program 1 times [2019-11-15 22:10:24,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:24,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941579290] [2019-11-15 22:10:24,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:24,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:24,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:24,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941579290] [2019-11-15 22:10:24,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:24,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:10:24,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648723569] [2019-11-15 22:10:24,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:10:24,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:10:24,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:10:24,952 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 4 states. [2019-11-15 22:10:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:25,470 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2019-11-15 22:10:25,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:10:25,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 22:10:25,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:25,480 INFO L225 Difference]: With dead ends: 135 [2019-11-15 22:10:25,481 INFO L226 Difference]: Without dead ends: 129 [2019-11-15 22:10:25,482 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:10:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-15 22:10:25,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 102. [2019-11-15 22:10:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-15 22:10:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2019-11-15 22:10:25,521 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2019-11-15 22:10:25,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:25,521 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2019-11-15 22:10:25,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:10:25,522 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2019-11-15 22:10:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:10:25,522 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:25,522 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:25,523 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:25,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:25,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1984048929, now seen corresponding path program 1 times [2019-11-15 22:10:25,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:25,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839400394] [2019-11-15 22:10:25,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:25,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:25,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:25,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839400394] [2019-11-15 22:10:25,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:25,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:10:25,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162377626] [2019-11-15 22:10:25,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:10:25,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:25,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:10:25,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:10:25,582 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 4 states. [2019-11-15 22:10:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:25,950 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2019-11-15 22:10:25,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:10:25,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 22:10:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:25,955 INFO L225 Difference]: With dead ends: 127 [2019-11-15 22:10:25,955 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 22:10:25,955 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:10:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 22:10:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 100. [2019-11-15 22:10:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 22:10:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-11-15 22:10:25,977 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 7 [2019-11-15 22:10:25,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:25,977 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-11-15 22:10:25,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:10:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-11-15 22:10:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 22:10:25,978 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:25,979 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:25,979 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:25,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1946007666, now seen corresponding path program 1 times [2019-11-15 22:10:25,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:25,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620354369] [2019-11-15 22:10:25,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:25,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:25,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:26,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620354369] [2019-11-15 22:10:26,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:26,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:10:26,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260697736] [2019-11-15 22:10:26,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:10:26,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:26,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:10:26,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:10:26,083 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 5 states. [2019-11-15 22:10:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:26,343 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2019-11-15 22:10:26,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:10:26,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-15 22:10:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:26,345 INFO L225 Difference]: With dead ends: 103 [2019-11-15 22:10:26,345 INFO L226 Difference]: Without dead ends: 103 [2019-11-15 22:10:26,346 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:10:26,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-15 22:10:26,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2019-11-15 22:10:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-15 22:10:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-11-15 22:10:26,355 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 12 [2019-11-15 22:10:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:26,355 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-11-15 22:10:26,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:10:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-11-15 22:10:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 22:10:26,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:26,357 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:26,357 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:26,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:26,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1946007665, now seen corresponding path program 1 times [2019-11-15 22:10:26,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:26,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662744750] [2019-11-15 22:10:26,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:26,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:26,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:26,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662744750] [2019-11-15 22:10:26,459 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:26,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:10:26,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144105278] [2019-11-15 22:10:26,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:10:26,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:26,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:10:26,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:10:26,461 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 5 states. [2019-11-15 22:10:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:26,770 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2019-11-15 22:10:26,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:10:26,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-15 22:10:26,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:26,772 INFO L225 Difference]: With dead ends: 131 [2019-11-15 22:10:26,772 INFO L226 Difference]: Without dead ends: 131 [2019-11-15 22:10:26,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:10:26,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-15 22:10:26,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 110. [2019-11-15 22:10:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 22:10:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2019-11-15 22:10:26,789 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 12 [2019-11-15 22:10:26,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:26,789 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2019-11-15 22:10:26,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:10:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2019-11-15 22:10:26,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 22:10:26,790 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:26,791 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:26,791 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:26,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:26,795 INFO L82 PathProgramCache]: Analyzing trace with hash -45823252, now seen corresponding path program 1 times [2019-11-15 22:10:26,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:26,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006897088] [2019-11-15 22:10:26,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:26,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:26,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:26,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006897088] [2019-11-15 22:10:26,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:26,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:10:26,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948279127] [2019-11-15 22:10:26,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:10:26,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:26,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:10:26,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:10:26,899 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 7 states. [2019-11-15 22:10:27,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:27,422 INFO L93 Difference]: Finished difference Result 184 states and 208 transitions. [2019-11-15 22:10:27,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:10:27,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-15 22:10:27,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:27,424 INFO L225 Difference]: With dead ends: 184 [2019-11-15 22:10:27,425 INFO L226 Difference]: Without dead ends: 184 [2019-11-15 22:10:27,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:10:27,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-15 22:10:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 109. [2019-11-15 22:10:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 22:10:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2019-11-15 22:10:27,433 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 15 [2019-11-15 22:10:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:27,433 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2019-11-15 22:10:27,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:10:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2019-11-15 22:10:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 22:10:27,434 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:27,434 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:27,435 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:27,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:27,435 INFO L82 PathProgramCache]: Analyzing trace with hash -45823251, now seen corresponding path program 1 times [2019-11-15 22:10:27,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:27,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709449143] [2019-11-15 22:10:27,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:27,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:27,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:27,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709449143] [2019-11-15 22:10:27,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:27,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:10:27,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172367634] [2019-11-15 22:10:27,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:10:27,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:27,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:10:27,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:10:27,547 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand 7 states. [2019-11-15 22:10:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:28,110 INFO L93 Difference]: Finished difference Result 193 states and 219 transitions. [2019-11-15 22:10:28,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:10:28,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-15 22:10:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:28,112 INFO L225 Difference]: With dead ends: 193 [2019-11-15 22:10:28,112 INFO L226 Difference]: Without dead ends: 193 [2019-11-15 22:10:28,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:10:28,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-15 22:10:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 101. [2019-11-15 22:10:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-15 22:10:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2019-11-15 22:10:28,126 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 15 [2019-11-15 22:10:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:28,127 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2019-11-15 22:10:28,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:10:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2019-11-15 22:10:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 22:10:28,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:28,128 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:28,128 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:28,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1765309558, now seen corresponding path program 1 times [2019-11-15 22:10:28,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:28,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366099419] [2019-11-15 22:10:28,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:28,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:28,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:28,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366099419] [2019-11-15 22:10:28,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:28,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:10:28,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977116595] [2019-11-15 22:10:28,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:10:28,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:28,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:10:28,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:10:28,213 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 6 states. [2019-11-15 22:10:28,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:28,395 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-11-15 22:10:28,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:10:28,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-15 22:10:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:28,396 INFO L225 Difference]: With dead ends: 112 [2019-11-15 22:10:28,396 INFO L226 Difference]: Without dead ends: 112 [2019-11-15 22:10:28,397 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:10:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-15 22:10:28,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2019-11-15 22:10:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-15 22:10:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2019-11-15 22:10:28,402 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 19 [2019-11-15 22:10:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:28,402 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2019-11-15 22:10:28,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:10:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2019-11-15 22:10:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:10:28,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:28,403 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:28,403 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:28,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:28,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1060414904, now seen corresponding path program 1 times [2019-11-15 22:10:28,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:28,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236840036] [2019-11-15 22:10:28,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:28,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:28,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:28,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236840036] [2019-11-15 22:10:28,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:28,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:10:28,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104639797] [2019-11-15 22:10:28,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:10:28,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:28,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:10:28,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:10:28,466 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand 6 states. [2019-11-15 22:10:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:28,732 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2019-11-15 22:10:28,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:10:28,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-15 22:10:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:28,734 INFO L225 Difference]: With dead ends: 140 [2019-11-15 22:10:28,734 INFO L226 Difference]: Without dead ends: 140 [2019-11-15 22:10:28,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:10:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-15 22:10:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 106. [2019-11-15 22:10:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-15 22:10:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-11-15 22:10:28,739 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 20 [2019-11-15 22:10:28,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:28,739 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-11-15 22:10:28,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:10:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-11-15 22:10:28,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:10:28,740 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:28,740 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:28,740 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:28,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:28,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1060414905, now seen corresponding path program 1 times [2019-11-15 22:10:28,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:28,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538153210] [2019-11-15 22:10:28,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:28,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:28,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:28,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538153210] [2019-11-15 22:10:28,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:28,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:10:28,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985606893] [2019-11-15 22:10:28,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:10:28,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:28,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:10:28,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:10:28,811 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 6 states. [2019-11-15 22:10:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:29,123 INFO L93 Difference]: Finished difference Result 149 states and 167 transitions. [2019-11-15 22:10:29,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:10:29,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-15 22:10:29,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:29,125 INFO L225 Difference]: With dead ends: 149 [2019-11-15 22:10:29,125 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 22:10:29,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:10:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 22:10:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 105. [2019-11-15 22:10:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 22:10:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2019-11-15 22:10:29,132 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 20 [2019-11-15 22:10:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:29,133 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2019-11-15 22:10:29,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:10:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2019-11-15 22:10:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 22:10:29,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:29,138 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:29,139 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:29,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:29,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1646888961, now seen corresponding path program 1 times [2019-11-15 22:10:29,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:29,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674232856] [2019-11-15 22:10:29,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:29,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:29,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:29,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674232856] [2019-11-15 22:10:29,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297797077] [2019-11-15 22:10:29,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:29,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 22:10:29,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:29,466 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:29,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 22:10:29,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:29,499 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 22:10:29,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:29,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-15 22:10:29,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:29,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:29,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:29,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:29,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2019-11-15 22:10:29,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-15 22:10:29,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:29,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:29,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:10:29,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2019-11-15 22:10:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:29,610 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:29,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-15 22:10:29,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608245264] [2019-11-15 22:10:29,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:10:29,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:29,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:10:29,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:10:29,612 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 11 states. [2019-11-15 22:10:30,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:30,137 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2019-11-15 22:10:30,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:10:30,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-11-15 22:10:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:30,139 INFO L225 Difference]: With dead ends: 147 [2019-11-15 22:10:30,139 INFO L226 Difference]: Without dead ends: 147 [2019-11-15 22:10:30,140 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:10:30,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-15 22:10:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 111. [2019-11-15 22:10:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 22:10:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2019-11-15 22:10:30,143 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 22 [2019-11-15 22:10:30,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:30,144 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2019-11-15 22:10:30,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:10:30,144 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2019-11-15 22:10:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 22:10:30,145 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:30,145 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:30,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:30,346 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:30,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:30,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1646888960, now seen corresponding path program 1 times [2019-11-15 22:10:30,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:30,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218189599] [2019-11-15 22:10:30,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:30,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:30,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:30,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:30,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218189599] [2019-11-15 22:10:30,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598248660] [2019-11-15 22:10:30,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:30,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 22:10:30,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:30,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:10:30,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:30,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:30,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:30,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 22:10:30,679 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:30,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 33 [2019-11-15 22:10:30,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:30,695 INFO L567 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-11-15 22:10:30,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:30,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2019-11-15 22:10:30,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:30,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:30,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:30,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:30,740 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:30,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:30,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:30,752 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:31 [2019-11-15 22:10:30,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-15 22:10:30,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:30,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:30,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-15 22:10:30,812 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:30,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:30,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:10:30,819 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:19 [2019-11-15 22:10:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:30,858 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:30,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-15 22:10:30,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063011224] [2019-11-15 22:10:30,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 22:10:30,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:30,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 22:10:30,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:10:30,859 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand 16 states. [2019-11-15 22:10:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:31,917 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2019-11-15 22:10:31,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:10:31,917 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-15 22:10:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:31,920 INFO L225 Difference]: With dead ends: 170 [2019-11-15 22:10:31,920 INFO L226 Difference]: Without dead ends: 170 [2019-11-15 22:10:31,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:10:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-15 22:10:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 110. [2019-11-15 22:10:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 22:10:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2019-11-15 22:10:31,925 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 22 [2019-11-15 22:10:31,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:31,925 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2019-11-15 22:10:31,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 22:10:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2019-11-15 22:10:31,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:10:31,926 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:31,926 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:32,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:32,127 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:32,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:32,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1335998627, now seen corresponding path program 1 times [2019-11-15 22:10:32,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:32,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220073814] [2019-11-15 22:10:32,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:32,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:32,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:32,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220073814] [2019-11-15 22:10:32,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:32,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:10:32,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616050976] [2019-11-15 22:10:32,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:10:32,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:32,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:10:32,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:10:32,267 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 10 states. [2019-11-15 22:10:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:32,678 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2019-11-15 22:10:32,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:10:32,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-15 22:10:32,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:32,680 INFO L225 Difference]: With dead ends: 114 [2019-11-15 22:10:32,680 INFO L226 Difference]: Without dead ends: 114 [2019-11-15 22:10:32,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:10:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-15 22:10:32,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2019-11-15 22:10:32,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 22:10:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2019-11-15 22:10:32,683 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 23 [2019-11-15 22:10:32,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:32,684 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2019-11-15 22:10:32,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:10:32,684 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2019-11-15 22:10:32,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:10:32,684 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:32,685 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:32,685 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:32,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:32,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1335998628, now seen corresponding path program 1 times [2019-11-15 22:10:32,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:32,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599399630] [2019-11-15 22:10:32,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:32,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:32,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:32,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599399630] [2019-11-15 22:10:32,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:32,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:10:32,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180193579] [2019-11-15 22:10:32,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:10:32,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:32,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:10:32,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:10:32,819 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand 10 states. [2019-11-15 22:10:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:33,292 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2019-11-15 22:10:33,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:10:33,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-15 22:10:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:33,294 INFO L225 Difference]: With dead ends: 113 [2019-11-15 22:10:33,294 INFO L226 Difference]: Without dead ends: 113 [2019-11-15 22:10:33,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:10:33,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-15 22:10:33,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2019-11-15 22:10:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 22:10:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2019-11-15 22:10:33,297 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 23 [2019-11-15 22:10:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:33,298 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2019-11-15 22:10:33,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:10:33,298 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2019-11-15 22:10:33,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:10:33,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:33,298 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:33,299 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:33,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:33,299 INFO L82 PathProgramCache]: Analyzing trace with hash 484418918, now seen corresponding path program 1 times [2019-11-15 22:10:33,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:33,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995062453] [2019-11-15 22:10:33,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:33,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:33,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:33,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995062453] [2019-11-15 22:10:33,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:33,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:10:33,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519032469] [2019-11-15 22:10:33,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:10:33,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:33,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:10:33,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:10:33,383 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 8 states. [2019-11-15 22:10:33,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:33,717 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2019-11-15 22:10:33,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:10:33,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-15 22:10:33,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:33,718 INFO L225 Difference]: With dead ends: 151 [2019-11-15 22:10:33,718 INFO L226 Difference]: Without dead ends: 151 [2019-11-15 22:10:33,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:10:33,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-15 22:10:33,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 112. [2019-11-15 22:10:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-15 22:10:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2019-11-15 22:10:33,722 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 23 [2019-11-15 22:10:33,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:33,722 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2019-11-15 22:10:33,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:10:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2019-11-15 22:10:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:10:33,723 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:33,723 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:33,723 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:33,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:33,724 INFO L82 PathProgramCache]: Analyzing trace with hash 484418919, now seen corresponding path program 1 times [2019-11-15 22:10:33,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:33,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13207833] [2019-11-15 22:10:33,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:33,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:33,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:33,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13207833] [2019-11-15 22:10:33,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:33,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:10:33,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390270054] [2019-11-15 22:10:33,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:10:33,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:33,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:10:33,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:10:33,879 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand 9 states. [2019-11-15 22:10:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:34,377 INFO L93 Difference]: Finished difference Result 170 states and 186 transitions. [2019-11-15 22:10:34,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:10:34,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-15 22:10:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:34,379 INFO L225 Difference]: With dead ends: 170 [2019-11-15 22:10:34,379 INFO L226 Difference]: Without dead ends: 170 [2019-11-15 22:10:34,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:10:34,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-15 22:10:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 114. [2019-11-15 22:10:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 22:10:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2019-11-15 22:10:34,385 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 23 [2019-11-15 22:10:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:34,386 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2019-11-15 22:10:34,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:10:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2019-11-15 22:10:34,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:10:34,386 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:34,386 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:34,387 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:34,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:34,387 INFO L82 PathProgramCache]: Analyzing trace with hash 233114402, now seen corresponding path program 1 times [2019-11-15 22:10:34,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:34,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187187490] [2019-11-15 22:10:34,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:34,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:34,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:34,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187187490] [2019-11-15 22:10:34,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:34,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:10:34,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056998021] [2019-11-15 22:10:34,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:10:34,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:34,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:10:34,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:10:34,484 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 8 states. [2019-11-15 22:10:34,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:34,870 INFO L93 Difference]: Finished difference Result 163 states and 178 transitions. [2019-11-15 22:10:34,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:10:34,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-15 22:10:34,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:34,872 INFO L225 Difference]: With dead ends: 163 [2019-11-15 22:10:34,872 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 22:10:34,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:10:34,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 22:10:34,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 114. [2019-11-15 22:10:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 22:10:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2019-11-15 22:10:34,876 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 26 [2019-11-15 22:10:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:34,876 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2019-11-15 22:10:34,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:10:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2019-11-15 22:10:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:10:34,877 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:34,877 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:34,878 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:34,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:34,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1576046581, now seen corresponding path program 2 times [2019-11-15 22:10:34,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:34,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262574323] [2019-11-15 22:10:34,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:34,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:34,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:10:35,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262574323] [2019-11-15 22:10:35,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:35,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:10:35,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437040085] [2019-11-15 22:10:35,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:10:35,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:35,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:10:35,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:10:35,045 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 9 states. [2019-11-15 22:10:35,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:35,328 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2019-11-15 22:10:35,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:10:35,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-11-15 22:10:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:35,329 INFO L225 Difference]: With dead ends: 141 [2019-11-15 22:10:35,329 INFO L226 Difference]: Without dead ends: 141 [2019-11-15 22:10:35,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:10:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-15 22:10:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2019-11-15 22:10:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-15 22:10:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2019-11-15 22:10:35,333 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 26 [2019-11-15 22:10:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:35,333 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2019-11-15 22:10:35,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:10:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2019-11-15 22:10:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:10:35,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:35,334 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:35,334 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:35,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:35,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1730504517, now seen corresponding path program 1 times [2019-11-15 22:10:35,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:35,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844667721] [2019-11-15 22:10:35,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:35,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:35,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:35,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844667721] [2019-11-15 22:10:35,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902983020] [2019-11-15 22:10:35,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:35,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 22:10:35,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:35,715 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:35,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:10:35,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:35,740 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 22:10:35,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:35,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 22:10:35,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:35,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:35,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:35,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:35,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 22:10:35,929 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 22:10:35,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2019-11-15 22:10:35,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:35,951 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-15 22:10:35,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:35,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:22 [2019-11-15 22:10:36,006 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:36,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-15 22:10:36,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:10:36,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:36,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:10:36,048 INFO L567 ElimStorePlain]: treesize reduction 70, result has 33.3 percent of original size [2019-11-15 22:10:36,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:10:36,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-11-15 22:10:36,189 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:36,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-15 22:10:36,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:36,200 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-11-15 22:10:36,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:10:36,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-11-15 22:10:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:36,249 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:36,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-11-15 22:10:36,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722731962] [2019-11-15 22:10:36,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 22:10:36,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:36,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 22:10:36,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:10:36,250 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 22 states. [2019-11-15 22:10:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:37,184 INFO L93 Difference]: Finished difference Result 172 states and 190 transitions. [2019-11-15 22:10:37,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 22:10:37,184 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-11-15 22:10:37,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:37,185 INFO L225 Difference]: With dead ends: 172 [2019-11-15 22:10:37,185 INFO L226 Difference]: Without dead ends: 172 [2019-11-15 22:10:37,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 22:10:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-15 22:10:37,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 127. [2019-11-15 22:10:37,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-15 22:10:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2019-11-15 22:10:37,190 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 26 [2019-11-15 22:10:37,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:37,190 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2019-11-15 22:10:37,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 22:10:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2019-11-15 22:10:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:10:37,191 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:37,191 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:37,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:37,392 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:37,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:37,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1730504516, now seen corresponding path program 1 times [2019-11-15 22:10:37,392 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:37,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123865300] [2019-11-15 22:10:37,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:37,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:37,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:37,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123865300] [2019-11-15 22:10:37,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039998951] [2019-11-15 22:10:37,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:37,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 22:10:37,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:37,729 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_57|], 1=[|v_#valid_66|]} [2019-11-15 22:10:37,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:10:37,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:37,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:37,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:37,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:10:37,767 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:37,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:37,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:37,776 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 22:10:37,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:37,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:37,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:37,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:37,804 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:37,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:37,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:37,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-15 22:10:37,896 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 22:10:37,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2019-11-15 22:10:37,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:37,917 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.1 percent of original size [2019-11-15 22:10:37,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 22:10:37,921 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:37,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:37,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:37,929 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:24 [2019-11-15 22:10:37,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-15 22:10:37,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:37,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:38,002 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:38,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 58 [2019-11-15 22:10:38,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:10:38,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:38,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:38,005 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 22:10:38,051 INFO L567 ElimStorePlain]: treesize reduction 92, result has 34.3 percent of original size [2019-11-15 22:10:38,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:10:38,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2019-11-15 22:10:38,153 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:38,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2019-11-15 22:10:38,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:38,182 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-11-15 22:10:38,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:10:38,186 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:38,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:38,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:38,209 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-11-15 22:10:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:38,233 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:38,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2019-11-15 22:10:38,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431730210] [2019-11-15 22:10:38,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 22:10:38,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:38,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 22:10:38,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:10:38,234 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 18 states. [2019-11-15 22:10:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:39,457 INFO L93 Difference]: Finished difference Result 186 states and 207 transitions. [2019-11-15 22:10:39,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:10:39,458 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-11-15 22:10:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:39,459 INFO L225 Difference]: With dead ends: 186 [2019-11-15 22:10:39,459 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 22:10:39,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2019-11-15 22:10:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 22:10:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 126. [2019-11-15 22:10:39,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 22:10:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2019-11-15 22:10:39,462 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 26 [2019-11-15 22:10:39,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:39,462 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2019-11-15 22:10:39,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 22:10:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2019-11-15 22:10:39,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:10:39,463 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:39,463 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:39,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:39,664 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:39,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:39,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1527821591, now seen corresponding path program 1 times [2019-11-15 22:10:39,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:39,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13486758] [2019-11-15 22:10:39,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:39,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:39,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:39,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13486758] [2019-11-15 22:10:39,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948072261] [2019-11-15 22:10:39,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:40,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-15 22:10:40,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:40,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:40,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,073 INFO L567 ElimStorePlain]: treesize reduction 3, result has 90.0 percent of original size [2019-11-15 22:10:40,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:40,076 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:40,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,082 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2019-11-15 22:10:40,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:10:40,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 22:10:40,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:40,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:10:40,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 22:10:40,134 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:40,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,143 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 22:10:40,155 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:40,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:10:40,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:40,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2019-11-15 22:10:40,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 22:10:40,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:40,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 22:10:40,218 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:40,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,225 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:22 [2019-11-15 22:10:40,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:10:40,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:40,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:10:40,250 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:40,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,259 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:38 [2019-11-15 22:10:40,429 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:40,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 63 [2019-11-15 22:10:40,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:40,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:40,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:40,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:40,433 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:10:40,457 INFO L567 ElimStorePlain]: treesize reduction 28, result has 54.1 percent of original size [2019-11-15 22:10:40,463 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:40,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 22:10:40,464 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:40,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:40,470 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:7 [2019-11-15 22:10:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:40,517 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:40,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-11-15 22:10:40,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407493508] [2019-11-15 22:10:40,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 22:10:40,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:40,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 22:10:40,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:10:40,519 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand 22 states. [2019-11-15 22:10:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:41,931 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2019-11-15 22:10:41,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 22:10:41,931 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-11-15 22:10:41,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:41,933 INFO L225 Difference]: With dead ends: 177 [2019-11-15 22:10:41,933 INFO L226 Difference]: Without dead ends: 177 [2019-11-15 22:10:41,933 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=1340, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:10:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-15 22:10:41,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 140. [2019-11-15 22:10:41,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-15 22:10:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 156 transitions. [2019-11-15 22:10:41,937 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 156 transitions. Word has length 28 [2019-11-15 22:10:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:41,938 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 156 transitions. [2019-11-15 22:10:41,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 22:10:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 156 transitions. [2019-11-15 22:10:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:10:41,938 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:41,938 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:42,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:42,141 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:42,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:42,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2104560663, now seen corresponding path program 1 times [2019-11-15 22:10:42,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:42,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670776435] [2019-11-15 22:10:42,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:42,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:42,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:42,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670776435] [2019-11-15 22:10:42,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960579283] [2019-11-15 22:10:42,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:42,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 22:10:42,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:42,432 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:42,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:10:42,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:42,453 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 22:10:42,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:42,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 22:10:42,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:42,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:42,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:42,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:42,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 22:10:42,547 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:42,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 69 [2019-11-15 22:10:42,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:42,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:10:42,570 INFO L567 ElimStorePlain]: treesize reduction 68, result has 30.6 percent of original size [2019-11-15 22:10:42,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:42,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:29 [2019-11-15 22:10:42,605 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:42,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-15 22:10:42,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:10:42,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:42,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:10:42,627 INFO L567 ElimStorePlain]: treesize reduction 70, result has 33.3 percent of original size [2019-11-15 22:10:42,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:42,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:23 [2019-11-15 22:10:42,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 22:10:42,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:42,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:42,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:10:42,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2019-11-15 22:10:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:42,733 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:42,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-15 22:10:42,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114151209] [2019-11-15 22:10:42,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 22:10:42,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:42,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 22:10:42,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:10:42,734 INFO L87 Difference]: Start difference. First operand 140 states and 156 transitions. Second operand 21 states. [2019-11-15 22:10:43,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:43,689 INFO L93 Difference]: Finished difference Result 212 states and 233 transitions. [2019-11-15 22:10:43,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 22:10:43,689 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-11-15 22:10:43,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:43,691 INFO L225 Difference]: With dead ends: 212 [2019-11-15 22:10:43,691 INFO L226 Difference]: Without dead ends: 212 [2019-11-15 22:10:43,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:10:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-15 22:10:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 158. [2019-11-15 22:10:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 22:10:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2019-11-15 22:10:43,696 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 30 [2019-11-15 22:10:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:43,696 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2019-11-15 22:10:43,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 22:10:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2019-11-15 22:10:43,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:10:43,697 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:43,697 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:43,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:43,901 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:43,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:43,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2104560664, now seen corresponding path program 1 times [2019-11-15 22:10:43,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:43,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869728205] [2019-11-15 22:10:43,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:43,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:43,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:44,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869728205] [2019-11-15 22:10:44,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456387233] [2019-11-15 22:10:44,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:44,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 22:10:44,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:44,198 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_58|], 1=[|v_#valid_69|]} [2019-11-15 22:10:44,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:10:44,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:44,216 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:44,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:10:44,216 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:44,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,224 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 22:10:44,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:44,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:44,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:44,249 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:44,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,259 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-15 22:10:44,289 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:44,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 88 [2019-11-15 22:10:44,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:44,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,311 INFO L567 ElimStorePlain]: treesize reduction 32, result has 66.0 percent of original size [2019-11-15 22:10:44,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 11 [2019-11-15 22:10:44,315 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:44,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,323 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:31 [2019-11-15 22:10:44,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-15 22:10:44,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:44,388 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:44,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 58 [2019-11-15 22:10:44,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:44,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,408 INFO L567 ElimStorePlain]: treesize reduction 20, result has 70.1 percent of original size [2019-11-15 22:10:44,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,409 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:63, output treesize:25 [2019-11-15 22:10:44,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 22:10:44,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:44,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:10:44,472 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:44,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:44,478 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2019-11-15 22:10:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:44,527 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:44,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2019-11-15 22:10:44,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692054314] [2019-11-15 22:10:44,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 22:10:44,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:44,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 22:10:44,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:10:44,528 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand 18 states. [2019-11-15 22:10:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:45,367 INFO L93 Difference]: Finished difference Result 215 states and 238 transitions. [2019-11-15 22:10:45,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:10:45,369 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-11-15 22:10:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:45,370 INFO L225 Difference]: With dead ends: 215 [2019-11-15 22:10:45,370 INFO L226 Difference]: Without dead ends: 215 [2019-11-15 22:10:45,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:10:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-15 22:10:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 157. [2019-11-15 22:10:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-15 22:10:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 176 transitions. [2019-11-15 22:10:45,374 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 176 transitions. Word has length 30 [2019-11-15 22:10:45,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:45,374 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 176 transitions. [2019-11-15 22:10:45,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 22:10:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 176 transitions. [2019-11-15 22:10:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 22:10:45,375 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:45,375 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:45,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:45,576 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:45,576 INFO L82 PathProgramCache]: Analyzing trace with hash 815240270, now seen corresponding path program 1 times [2019-11-15 22:10:45,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:45,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384225251] [2019-11-15 22:10:45,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:45,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:45,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:45,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384225251] [2019-11-15 22:10:45,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:45,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 22:10:45,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774568669] [2019-11-15 22:10:45,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:10:45,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:45,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:10:45,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:10:45,717 INFO L87 Difference]: Start difference. First operand 157 states and 176 transitions. Second operand 13 states. [2019-11-15 22:10:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:46,349 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2019-11-15 22:10:46,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 22:10:46,350 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-11-15 22:10:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:46,351 INFO L225 Difference]: With dead ends: 198 [2019-11-15 22:10:46,351 INFO L226 Difference]: Without dead ends: 198 [2019-11-15 22:10:46,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-11-15 22:10:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-15 22:10:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 161. [2019-11-15 22:10:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-15 22:10:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 182 transitions. [2019-11-15 22:10:46,355 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 182 transitions. Word has length 31 [2019-11-15 22:10:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:46,355 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 182 transitions. [2019-11-15 22:10:46,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:10:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 182 transitions. [2019-11-15 22:10:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 22:10:46,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:46,356 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:46,356 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:46,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:46,357 INFO L82 PathProgramCache]: Analyzing trace with hash 815240271, now seen corresponding path program 1 times [2019-11-15 22:10:46,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:46,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140225079] [2019-11-15 22:10:46,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:46,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:46,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:46,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140225079] [2019-11-15 22:10:46,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:46,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 22:10:46,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678813863] [2019-11-15 22:10:46,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:10:46,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:46,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:10:46,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:10:46,523 INFO L87 Difference]: Start difference. First operand 161 states and 182 transitions. Second operand 13 states. [2019-11-15 22:10:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:47,431 INFO L93 Difference]: Finished difference Result 219 states and 243 transitions. [2019-11-15 22:10:47,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:10:47,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-11-15 22:10:47,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:47,433 INFO L225 Difference]: With dead ends: 219 [2019-11-15 22:10:47,433 INFO L226 Difference]: Without dead ends: 219 [2019-11-15 22:10:47,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:10:47,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-15 22:10:47,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 160. [2019-11-15 22:10:47,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-15 22:10:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 180 transitions. [2019-11-15 22:10:47,438 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 180 transitions. Word has length 31 [2019-11-15 22:10:47,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:47,439 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 180 transitions. [2019-11-15 22:10:47,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:10:47,439 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 180 transitions. [2019-11-15 22:10:47,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 22:10:47,440 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:47,440 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:47,440 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:47,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:47,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2133468620, now seen corresponding path program 2 times [2019-11-15 22:10:47,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:47,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997456304] [2019-11-15 22:10:47,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:47,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:47,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:47,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997456304] [2019-11-15 22:10:47,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951793080] [2019-11-15 22:10:47,689 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:47,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:10:47,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:47,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-15 22:10:47,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:47,916 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:47,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:10:47,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:47,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:47,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:47,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 22:10:47,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:47,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:47,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:47,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:47,983 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:47,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:47,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:47,995 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:18 [2019-11-15 22:10:48,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:10:48,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 22:10:48,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:48,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:48,170 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 22:10:48,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2019-11-15 22:10:48,171 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:48,196 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-15 22:10:48,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:48,197 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:22 [2019-11-15 22:10:48,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2019-11-15 22:10:48,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:48,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:48,268 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:48,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 69 [2019-11-15 22:10:48,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:48,269 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:48,283 INFO L567 ElimStorePlain]: treesize reduction 24, result has 63.6 percent of original size [2019-11-15 22:10:48,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:48,283 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:42 [2019-11-15 22:10:48,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:48,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 52 [2019-11-15 22:10:48,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:48,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:48,420 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:10:48,433 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-11-15 22:10:48,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-11-15 22:10:48,436 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:48,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:48,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:48,440 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:7 [2019-11-15 22:10:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:48,444 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:48,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2019-11-15 22:10:48,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120063376] [2019-11-15 22:10:48,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 22:10:48,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:48,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 22:10:48,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-11-15 22:10:48,445 INFO L87 Difference]: Start difference. First operand 160 states and 180 transitions. Second operand 26 states. [2019-11-15 22:10:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:49,666 INFO L93 Difference]: Finished difference Result 192 states and 212 transitions. [2019-11-15 22:10:49,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:10:49,667 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 31 [2019-11-15 22:10:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:49,668 INFO L225 Difference]: With dead ends: 192 [2019-11-15 22:10:49,668 INFO L226 Difference]: Without dead ends: 192 [2019-11-15 22:10:49,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 22:10:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-15 22:10:49,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 159. [2019-11-15 22:10:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-15 22:10:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2019-11-15 22:10:49,671 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 31 [2019-11-15 22:10:49,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:49,671 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2019-11-15 22:10:49,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 22:10:49,671 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2019-11-15 22:10:49,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:10:49,672 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:49,672 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:49,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:49,872 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:49,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:49,873 INFO L82 PathProgramCache]: Analyzing trace with hash -401665899, now seen corresponding path program 1 times [2019-11-15 22:10:49,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:49,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29676009] [2019-11-15 22:10:49,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:49,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:49,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:10:49,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29676009] [2019-11-15 22:10:49,926 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:10:49,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:10:49,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713370966] [2019-11-15 22:10:49,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:10:49,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:49,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:10:49,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:10:49,943 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand 5 states. [2019-11-15 22:10:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:50,091 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2019-11-15 22:10:50,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:10:50,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-15 22:10:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:50,092 INFO L225 Difference]: With dead ends: 166 [2019-11-15 22:10:50,092 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 22:10:50,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:10:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 22:10:50,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 159. [2019-11-15 22:10:50,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-15 22:10:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 176 transitions. [2019-11-15 22:10:50,095 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 176 transitions. Word has length 33 [2019-11-15 22:10:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:50,095 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 176 transitions. [2019-11-15 22:10:50,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:10:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 176 transitions. [2019-11-15 22:10:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:10:50,095 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:50,096 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:50,096 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:50,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:50,096 INFO L82 PathProgramCache]: Analyzing trace with hash 103774826, now seen corresponding path program 3 times [2019-11-15 22:10:50,096 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:50,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108844527] [2019-11-15 22:10:50,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:50,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:50,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:50,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108844527] [2019-11-15 22:10:50,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429772193] [2019-11-15 22:10:50,376 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:50,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 22:10:50,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:50,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-15 22:10:50,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:50,577 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:50,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:10:50,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:50,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:50,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:50,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 22:10:50,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:50,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:50,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:50,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:50,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-15 22:10:50,718 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 22:10:50,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2019-11-15 22:10:50,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:50,746 INFO L567 ElimStorePlain]: treesize reduction 10, result has 66.7 percent of original size [2019-11-15 22:10:50,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:50,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:20 [2019-11-15 22:10:50,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:50,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 46 [2019-11-15 22:10:50,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:50,825 INFO L567 ElimStorePlain]: treesize reduction 24, result has 52.9 percent of original size [2019-11-15 22:10:50,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:50,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2019-11-15 22:10:50,886 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:50,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:10:50,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:50,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:50,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:50,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-11-15 22:10:50,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 22:10:50,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:50,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:50,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:50,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2019-11-15 22:10:51,097 INFO L341 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2019-11-15 22:10:51,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 66 [2019-11-15 22:10:51,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,101 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:10:51,133 INFO L567 ElimStorePlain]: treesize reduction 22, result has 65.1 percent of original size [2019-11-15 22:10:51,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:10:51,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:44 [2019-11-15 22:10:51,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,213 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:51,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 104 [2019-11-15 22:10:51,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:10:51,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:51,243 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:51,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 54 [2019-11-15 22:10:51,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:10:51,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:51,355 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2019-11-15 22:10:51,356 INFO L567 ElimStorePlain]: treesize reduction 646, result has 11.4 percent of original size [2019-11-15 22:10:51,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 22:10:51,357 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:81 [2019-11-15 22:10:51,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,525 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[v_prenex_4]} [2019-11-15 22:10:51,549 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:51,549 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-15 22:10:51,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:51,587 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.0 percent of original size [2019-11-15 22:10:51,610 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:51,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 62 [2019-11-15 22:10:51,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:51,618 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:10:51,668 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.7 percent of original size [2019-11-15 22:10:51,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:51,669 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:89, output treesize:5 [2019-11-15 22:10:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:51,679 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:51,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2019-11-15 22:10:51,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920742756] [2019-11-15 22:10:51,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 22:10:51,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:51,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 22:10:51,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 22:10:51,681 INFO L87 Difference]: Start difference. First operand 159 states and 176 transitions. Second operand 33 states. [2019-11-15 22:10:54,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:10:54,227 INFO L93 Difference]: Finished difference Result 239 states and 265 transitions. [2019-11-15 22:10:54,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-15 22:10:54,227 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-11-15 22:10:54,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:10:54,228 INFO L225 Difference]: With dead ends: 239 [2019-11-15 22:10:54,229 INFO L226 Difference]: Without dead ends: 239 [2019-11-15 22:10:54,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=587, Invalid=3193, Unknown=2, NotChecked=0, Total=3782 [2019-11-15 22:10:54,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-15 22:10:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 174. [2019-11-15 22:10:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 22:10:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2019-11-15 22:10:54,234 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 33 [2019-11-15 22:10:54,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:10:54,234 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2019-11-15 22:10:54,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 22:10:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2019-11-15 22:10:54,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:10:54,235 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:10:54,235 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:10:54,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:54,439 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:10:54,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:10:54,440 INFO L82 PathProgramCache]: Analyzing trace with hash 103774827, now seen corresponding path program 2 times [2019-11-15 22:10:54,440 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:10:54,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20042856] [2019-11-15 22:10:54,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:54,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:10:54,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:10:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:10:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:54,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20042856] [2019-11-15 22:10:54,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763775633] [2019-11-15 22:10:54,809 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:10:54,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:10:54,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:10:54,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-15 22:10:54,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:10:55,070 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:55,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:10:55,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:55,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 22:10:55,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:55,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:55,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:10:55,124 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:55,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,134 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2019-11-15 22:10:55,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:10:55,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 22:10:55,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:55,262 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 22:10:55,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2019-11-15 22:10:55,262 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,279 INFO L567 ElimStorePlain]: treesize reduction 10, result has 73.0 percent of original size [2019-11-15 22:10:55,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,279 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:27 [2019-11-15 22:10:55,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:10:55,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:10:55,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:55,339 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:55,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 46 [2019-11-15 22:10:55,339 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,367 INFO L567 ElimStorePlain]: treesize reduction 24, result has 64.7 percent of original size [2019-11-15 22:10:55,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,368 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:44 [2019-11-15 22:10:55,415 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:55,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:10:55,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:55,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2019-11-15 22:10:55,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 22:10:55,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:55,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 22:10:55,497 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:55,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,512 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:40 [2019-11-15 22:10:55,643 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_51|], 6=[|v_#memory_$Pointer$.base_64|]} [2019-11-15 22:10:55,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:10:55,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 22:10:55,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:55,709 INFO L341 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2019-11-15 22:10:55,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 68 [2019-11-15 22:10:55,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,714 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:10:55,761 INFO L567 ElimStorePlain]: treesize reduction 22, result has 70.7 percent of original size [2019-11-15 22:10:55,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:10:55,762 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:62 [2019-11-15 22:10:55,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,825 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_52|], 10=[|v_#memory_$Pointer$.base_65|]} [2019-11-15 22:10:55,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 90 [2019-11-15 22:10:55,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2019-11-15 22:10:55,846 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:55,925 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:55,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 123 [2019-11-15 22:10:55,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:10:55,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,932 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:55,969 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:55,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 75 [2019-11-15 22:10:55,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:10:55,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:55,971 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:56,119 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-11-15 22:10:56,119 INFO L567 ElimStorePlain]: treesize reduction 505, result has 26.4 percent of original size [2019-11-15 22:10:56,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:56,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 22:10:56,121 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:173, output treesize:180 [2019-11-15 22:10:56,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:56,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:56,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:56,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:56,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:56,677 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-15 22:10:56,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:10:56,953 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|, v_prenex_13, v_prenex_11, v_prenex_16, v_prenex_15], 6=[|#memory_$Pointer$.base|]} [2019-11-15 22:10:56,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2019-11-15 22:10:56,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:57,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:57,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2019-11-15 22:10:57,035 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:57,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:57,098 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:57,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2019-11-15 22:10:57,099 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:57,202 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-15 22:10:57,202 INFO L567 ElimStorePlain]: treesize reduction 12, result has 92.5 percent of original size [2019-11-15 22:10:57,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 52 [2019-11-15 22:10:57,209 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:57,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:57,268 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:57,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2019-11-15 22:10:57,269 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 22:10:57,333 INFO L567 ElimStorePlain]: treesize reduction 12, result has 89.2 percent of original size [2019-11-15 22:10:57,353 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:10:57,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 70 [2019-11-15 22:10:57,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:57,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:57,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:57,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:57,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:57,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:57,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:57,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:57,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:57,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:57,357 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:10:57,453 INFO L567 ElimStorePlain]: treesize reduction 24, result has 75.3 percent of original size [2019-11-15 22:10:57,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:57,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 22:10:57,455 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 13 variables, input treesize:221, output treesize:36 [2019-11-15 22:10:57,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:10:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:10:57,538 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:10:57,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2019-11-15 22:10:57,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643848626] [2019-11-15 22:10:57,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 22:10:57,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:10:57,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 22:10:57,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1066, Unknown=7, NotChecked=0, Total=1190 [2019-11-15 22:10:57,539 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand 35 states. [2019-11-15 22:10:58,510 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-11-15 22:10:59,374 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 73 [2019-11-15 22:11:01,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:01,291 INFO L93 Difference]: Finished difference Result 236 states and 263 transitions. [2019-11-15 22:11:01,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 22:11:01,291 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 33 [2019-11-15 22:11:01,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:01,292 INFO L225 Difference]: With dead ends: 236 [2019-11-15 22:11:01,292 INFO L226 Difference]: Without dead ends: 236 [2019-11-15 22:11:01,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=427, Invalid=2872, Unknown=7, NotChecked=0, Total=3306 [2019-11-15 22:11:01,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-11-15 22:11:01,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 176. [2019-11-15 22:11:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-15 22:11:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 199 transitions. [2019-11-15 22:11:01,298 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 199 transitions. Word has length 33 [2019-11-15 22:11:01,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:01,298 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 199 transitions. [2019-11-15 22:11:01,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 22:11:01,298 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 199 transitions. [2019-11-15 22:11:01,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 22:11:01,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:01,299 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:01,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:01,499 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:11:01,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:01,500 INFO L82 PathProgramCache]: Analyzing trace with hash 124999693, now seen corresponding path program 2 times [2019-11-15 22:11:01,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:01,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812068642] [2019-11-15 22:11:01,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:01,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:01,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:01,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812068642] [2019-11-15 22:11:01,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581141795] [2019-11-15 22:11:01,868 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:02,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:11:02,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:11:02,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-15 22:11:02,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:02,037 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_59|], 1=[|v_#valid_75|]} [2019-11-15 22:11:02,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:11:02,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:02,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:02,056 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:02,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:11:02,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:02,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:02,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:02,066 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-15 22:11:02,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:11:02,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:02,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:02,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:11:02,111 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:02,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:02,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:02,132 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2019-11-15 22:11:02,201 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_25|], 2=[|v_#memory_$Pointer$.base_67|, |v_#memory_$Pointer$.offset_54|]} [2019-11-15 22:11:02,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-15 22:11:02,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:02,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:02,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:11:02,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 70 [2019-11-15 22:11:02,244 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:02,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:02,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 14 [2019-11-15 22:11:02,267 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:02,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:02,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:02,284 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:61 [2019-11-15 22:11:02,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:11:02,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:02,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:02,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:02,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:58 [2019-11-15 22:11:02,416 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:02,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 82 [2019-11-15 22:11:02,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:11:02,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:02,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:11:02,480 INFO L567 ElimStorePlain]: treesize reduction 172, result has 34.4 percent of original size [2019-11-15 22:11:02,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:11:02,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 56 [2019-11-15 22:11:02,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:02,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:02,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:02,514 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:97, output treesize:48 [2019-11-15 22:11:02,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2019-11-15 22:11:02,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:02,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:02,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:02,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:25 [2019-11-15 22:11:02,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2019-11-15 22:11:02,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:02,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:02,657 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:02,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-11-15 22:11:02,658 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 22:11:02,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:02,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:02,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:02,667 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:16 [2019-11-15 22:11:02,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:02,710 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:11:02,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2019-11-15 22:11:02,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33214152] [2019-11-15 22:11:02,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 22:11:02,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:02,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 22:11:02,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:11:02,711 INFO L87 Difference]: Start difference. First operand 176 states and 199 transitions. Second operand 27 states. [2019-11-15 22:11:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:04,287 INFO L93 Difference]: Finished difference Result 222 states and 247 transitions. [2019-11-15 22:11:04,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 22:11:04,288 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2019-11-15 22:11:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:04,289 INFO L225 Difference]: With dead ends: 222 [2019-11-15 22:11:04,289 INFO L226 Difference]: Without dead ends: 221 [2019-11-15 22:11:04,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=280, Invalid=1360, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:11:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-15 22:11:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 178. [2019-11-15 22:11:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-15 22:11:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 201 transitions. [2019-11-15 22:11:04,293 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 201 transitions. Word has length 34 [2019-11-15 22:11:04,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:04,293 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 201 transitions. [2019-11-15 22:11:04,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 22:11:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 201 transitions. [2019-11-15 22:11:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:11:04,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:04,294 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:04,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:04,497 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:11:04,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:04,498 INFO L82 PathProgramCache]: Analyzing trace with hash -421607656, now seen corresponding path program 1 times [2019-11-15 22:11:04,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:04,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964129342] [2019-11-15 22:11:04,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:04,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:04,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:04,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964129342] [2019-11-15 22:11:04,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834504482] [2019-11-15 22:11:04,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:04,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-15 22:11:04,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:05,032 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:05,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:11:05,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:05,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:05,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:05,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:39 [2019-11-15 22:11:05,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-15 22:11:05,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:05,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:05,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-15 22:11:05,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:05,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:05,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:05,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:21 [2019-11-15 22:11:05,179 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_56|], 2=[|v_#memory_$Pointer$.base_70|]} [2019-11-15 22:11:05,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 1 [2019-11-15 22:11:05,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:05,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:05,215 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:05,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 64 [2019-11-15 22:11:05,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:05,216 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:05,235 INFO L567 ElimStorePlain]: treesize reduction 32, result has 39.6 percent of original size [2019-11-15 22:11:05,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:05,235 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:21 [2019-11-15 22:11:05,292 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:05,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 73 [2019-11-15 22:11:05,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:11:05,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:05,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:11:05,321 INFO L567 ElimStorePlain]: treesize reduction 110, result has 29.9 percent of original size [2019-11-15 22:11:05,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-11-15 22:11:05,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:05,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:05,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:05,331 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:39 [2019-11-15 22:11:05,529 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:05,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 52 [2019-11-15 22:11:05,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:05,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:05,531 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:05,548 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-11-15 22:11:05,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-11-15 22:11:05,551 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:05,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:05,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:05,558 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2019-11-15 22:11:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:05,564 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:11:05,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 25 [2019-11-15 22:11:05,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380209384] [2019-11-15 22:11:05,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 22:11:05,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:05,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 22:11:05,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:11:05,565 INFO L87 Difference]: Start difference. First operand 178 states and 201 transitions. Second operand 25 states. [2019-11-15 22:11:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:06,798 INFO L93 Difference]: Finished difference Result 245 states and 272 transitions. [2019-11-15 22:11:06,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 22:11:06,798 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2019-11-15 22:11:06,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:06,799 INFO L225 Difference]: With dead ends: 245 [2019-11-15 22:11:06,799 INFO L226 Difference]: Without dead ends: 245 [2019-11-15 22:11:06,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=1356, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:11:06,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-15 22:11:06,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 196. [2019-11-15 22:11:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-15 22:11:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 220 transitions. [2019-11-15 22:11:06,804 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 220 transitions. Word has length 35 [2019-11-15 22:11:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:06,804 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 220 transitions. [2019-11-15 22:11:06,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 22:11:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 220 transitions. [2019-11-15 22:11:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:11:06,805 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:06,805 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:07,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:07,006 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:11:07,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:07,006 INFO L82 PathProgramCache]: Analyzing trace with hash -961288442, now seen corresponding path program 1 times [2019-11-15 22:11:07,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:07,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366195084] [2019-11-15 22:11:07,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:07,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:07,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:07,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366195084] [2019-11-15 22:11:07,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28073395] [2019-11-15 22:11:07,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:07,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-15 22:11:07,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:07,543 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:07,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:11:07,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:07,569 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 22:11:07,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:07,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 22:11:07,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:11:07,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:07,628 INFO L567 ElimStorePlain]: treesize reduction 5, result has 84.8 percent of original size [2019-11-15 22:11:07,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:07,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-11-15 22:11:07,756 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 22:11:07,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2019-11-15 22:11:07,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:07,777 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-15 22:11:07,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:07,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:22 [2019-11-15 22:11:07,823 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:07,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-15 22:11:07,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:11:07,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:07,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:11:07,857 INFO L567 ElimStorePlain]: treesize reduction 70, result has 33.3 percent of original size [2019-11-15 22:11:07,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:07,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-11-15 22:11:07,937 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:07,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-15 22:11:07,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:07,977 INFO L567 ElimStorePlain]: treesize reduction 40, result has 56.0 percent of original size [2019-11-15 22:11:07,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:07,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:51 [2019-11-15 22:11:08,074 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-15 22:11:08,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 56 [2019-11-15 22:11:08,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:08,103 INFO L567 ElimStorePlain]: treesize reduction 34, result has 60.0 percent of original size [2019-11-15 22:11:08,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:08,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:51 [2019-11-15 22:11:08,129 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_58|], 6=[|v_#memory_$Pointer$.base_76|]} [2019-11-15 22:11:08,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:11:08,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:08,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:08,168 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:08,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 77 [2019-11-15 22:11:08,169 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:08,203 INFO L567 ElimStorePlain]: treesize reduction 56, result has 53.7 percent of original size [2019-11-15 22:11:08,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:08,204 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:73, output treesize:95 [2019-11-15 22:11:08,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2019-11-15 22:11:08,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:08,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:08,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:08,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:109, output treesize:86 [2019-11-15 22:11:08,414 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:08,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 71 [2019-11-15 22:11:08,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:08,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:08,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:08,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:08,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:08,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:08,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:08,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:08,417 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:08,439 INFO L567 ElimStorePlain]: treesize reduction 36, result has 43.8 percent of original size [2019-11-15 22:11:08,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:08,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:90, output treesize:28 [2019-11-15 22:11:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:08,555 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:11:08,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 34 [2019-11-15 22:11:08,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500669223] [2019-11-15 22:11:08,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 22:11:08,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:08,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 22:11:08,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 22:11:08,557 INFO L87 Difference]: Start difference. First operand 196 states and 220 transitions. Second operand 35 states. [2019-11-15 22:11:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:11,551 INFO L93 Difference]: Finished difference Result 301 states and 331 transitions. [2019-11-15 22:11:11,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-15 22:11:11,552 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-11-15 22:11:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:11,553 INFO L225 Difference]: With dead ends: 301 [2019-11-15 22:11:11,553 INFO L226 Difference]: Without dead ends: 301 [2019-11-15 22:11:11,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1469 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=716, Invalid=3976, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 22:11:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-15 22:11:11,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 211. [2019-11-15 22:11:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-15 22:11:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 237 transitions. [2019-11-15 22:11:11,558 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 237 transitions. Word has length 35 [2019-11-15 22:11:11,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:11,558 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 237 transitions. [2019-11-15 22:11:11,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 22:11:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 237 transitions. [2019-11-15 22:11:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:11:11,559 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:11,559 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:11,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:11,761 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION]=== [2019-11-15 22:11:11,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:11,761 INFO L82 PathProgramCache]: Analyzing trace with hash -961288441, now seen corresponding path program 1 times [2019-11-15 22:11:11,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:11,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268766653] [2019-11-15 22:11:11,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:11,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:11,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:12,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268766653] [2019-11-15 22:11:12,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319937296] [2019-11-15 22:11:12,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:12,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-15 22:11:12,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:12,661 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_60|], 1=[|v_#valid_79|]} [2019-11-15 22:11:12,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:11:12,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:12,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:12,689 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:12,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:11:12,689 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:12,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:12,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:12,697 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 22:11:12,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:11:12,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:12,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:12,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:11:12,744 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:12,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:12,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:12,755 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2019-11-15 22:11:12,881 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 22:11:12,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2019-11-15 22:11:12,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:12,904 INFO L567 ElimStorePlain]: treesize reduction 10, result has 82.8 percent of original size [2019-11-15 22:11:12,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 22:11:12,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:12,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:12,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:12,929 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:29 [2019-11-15 22:11:12,985 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:12,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 62 [2019-11-15 22:11:12,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:12,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:13,014 INFO L567 ElimStorePlain]: treesize reduction 20, result has 75.0 percent of original size [2019-11-15 22:11:13,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-15 22:11:13,021 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:13,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:13,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:13,035 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:52 [2019-11-15 22:11:13,084 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:13,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:11:13,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:13,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:13,114 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:13,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2019-11-15 22:11:13,115 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:13,140 INFO L567 ElimStorePlain]: treesize reduction 26, result has 68.3 percent of original size [2019-11-15 22:11:13,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:13,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:56 [2019-11-15 22:11:13,235 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-15 22:11:13,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 59 [2019-11-15 22:11:13,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:13,298 INFO L567 ElimStorePlain]: treesize reduction 20, result has 81.7 percent of original size [2019-11-15 22:11:13,324 INFO L341 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2019-11-15 22:11:13,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2019-11-15 22:11:13,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:13,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:13,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:13,358 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:84 [2019-11-15 22:11:13,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,448 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:13,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 107 [2019-11-15 22:11:13,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:13,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2019-11-15 22:11:13,455 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:13,534 INFO L567 ElimStorePlain]: treesize reduction 69, result has 63.7 percent of original size [2019-11-15 22:11:13,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:13,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 112 [2019-11-15 22:11:13,564 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:13,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2019-11-15 22:11:13,570 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:13,637 INFO L567 ElimStorePlain]: treesize reduction 36, result has 75.8 percent of original size [2019-11-15 22:11:13,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 22:11:13,638 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:142, output treesize:161 [2019-11-15 22:11:13,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,948 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:13,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 104 [2019-11-15 22:11:13,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,953 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:13,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:13,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 57 [2019-11-15 22:11:13,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:13,968 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:14,065 INFO L567 ElimStorePlain]: treesize reduction 48, result has 66.7 percent of original size [2019-11-15 22:11:14,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 22 [2019-11-15 22:11:14,070 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:14,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:14,272 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-15 22:11:14,275 INFO L168 Benchmark]: Toolchain (without parser) took 51021.66 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 550.5 MB). Free memory was 946.1 MB in the beginning and 871.9 MB in the end (delta: 74.1 MB). Peak memory consumption was 624.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:11:14,275 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:11:14,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:11:14,276 INFO L168 Benchmark]: Boogie Preprocessor took 55.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:11:14,276 INFO L168 Benchmark]: RCFGBuilder took 818.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:11:14,276 INFO L168 Benchmark]: TraceAbstraction took 49603.90 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 388.0 MB). Free memory was 1.1 GB in the beginning and 871.9 MB in the end (delta: 200.2 MB). Peak memory consumption was 588.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:11:14,278 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 540.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 818.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49603.90 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 388.0 MB). Free memory was 1.1 GB in the beginning and 871.9 MB in the end (delta: 200.2 MB). Peak memory consumption was 588.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 22:11:16,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:11:16,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:11:16,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:11:16,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:11:16,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:11:16,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:11:16,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:11:16,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:11:16,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:11:16,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:11:16,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:11:16,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:11:16,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:11:16,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:11:16,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:11:16,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:11:16,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:11:16,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:11:16,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:11:16,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:11:16,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:11:16,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:11:16,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:11:16,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:11:16,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:11:16,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:11:16,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:11:16,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:11:16,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:11:16,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:11:16,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:11:16,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:11:16,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:11:16,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:11:16,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:11:16,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:11:16,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:11:16,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:11:16,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:11:16,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:11:16,441 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2019-11-15 22:11:16,468 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:11:16,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:11:16,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:11:16,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:11:16,470 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:11:16,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:11:16,471 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:11:16,471 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:11:16,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:11:16,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:11:16,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:11:16,472 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:11:16,472 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:11:16,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:11:16,472 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:11:16,473 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:11:16,473 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:11:16,473 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:11:16,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:11:16,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:11:16,474 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:11:16,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:11:16,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:11:16,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:11:16,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:11:16,475 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:11:16,475 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:11:16,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:11:16,475 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adee0aad8018029b1a093d0ddfc0de44abfd0e03 [2019-11-15 22:11:16,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:11:16,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:11:16,517 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:11:16,518 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:11:16,519 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:11:16,520 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i [2019-11-15 22:11:16,581 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/data/a42968b45/d149bebf7bfd4fcbb212747609333637/FLAGb440f4ea8 [2019-11-15 22:11:17,038 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:11:17,042 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i [2019-11-15 22:11:17,056 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/data/a42968b45/d149bebf7bfd4fcbb212747609333637/FLAGb440f4ea8 [2019-11-15 22:11:17,368 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/data/a42968b45/d149bebf7bfd4fcbb212747609333637 [2019-11-15 22:11:17,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:11:17,371 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:11:17,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:11:17,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:11:17,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:11:17,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:11:17" (1/1) ... [2019-11-15 22:11:17,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f7017c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:17, skipping insertion in model container [2019-11-15 22:11:17,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:11:17" (1/1) ... [2019-11-15 22:11:17,385 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:11:17,419 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:11:17,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:11:17,820 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:11:17,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:11:17,924 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:11:17,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:17 WrapperNode [2019-11-15 22:11:17,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:11:17,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:11:17,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:11:17,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:11:17,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:17" (1/1) ... [2019-11-15 22:11:17,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:17" (1/1) ... [2019-11-15 22:11:17,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:17" (1/1) ... [2019-11-15 22:11:17,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:17" (1/1) ... [2019-11-15 22:11:17,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:17" (1/1) ... [2019-11-15 22:11:17,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:17" (1/1) ... [2019-11-15 22:11:17,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:17" (1/1) ... [2019-11-15 22:11:17,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:11:17,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:11:17,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:11:17,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:11:17,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:11:18,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:11:18,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:11:18,059 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:11:18,060 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:11:18,060 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:11:18,060 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:11:18,060 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:11:18,060 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:11:18,061 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:11:18,061 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:11:18,061 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:11:18,061 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:11:18,061 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:11:18,062 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:11:18,062 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:11:18,062 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:11:18,062 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:11:18,062 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:11:18,062 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:11:18,063 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:11:18,063 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:11:18,063 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:11:18,063 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:11:18,063 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:11:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:11:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:11:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:11:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:11:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:11:18,064 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:11:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:11:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:11:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:11:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:11:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:11:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:11:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:11:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:11:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:11:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:11:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:11:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:11:18,067 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:11:18,067 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:11:18,067 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:11:18,067 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:11:18,067 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:11:18,067 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:11:18,068 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:11:18,068 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:11:18,068 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:11:18,068 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:11:18,068 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:11:18,068 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:11:18,069 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:11:18,069 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:11:18,069 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:11:18,069 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 22:11:18,069 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:11:18,069 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:11:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:11:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:11:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:11:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:11:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:11:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:11:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:11:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:11:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:11:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:11:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:11:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:11:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:11:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:11:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:11:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:11:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:11:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:11:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:11:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:11:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:11:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:11:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:11:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:11:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:11:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:11:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:11:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:11:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:11:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:11:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:11:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:11:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:11:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:11:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:11:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:11:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:11:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:11:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:11:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:11:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:11:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:11:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:11:18,077 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:11:18,077 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:11:18,077 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:11:18,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:11:18,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:11:18,077 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:11:18,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:11:18,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:11:18,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:11:18,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:11:18,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:11:18,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:11:18,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:11:18,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:11:19,028 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:11:19,029 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:11:19,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:11:19 BoogieIcfgContainer [2019-11-15 22:11:19,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:11:19,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:11:19,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:11:19,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:11:19,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:11:17" (1/3) ... [2019-11-15 22:11:19,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4aaee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:11:19, skipping insertion in model container [2019-11-15 22:11:19,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:17" (2/3) ... [2019-11-15 22:11:19,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4aaee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:11:19, skipping insertion in model container [2019-11-15 22:11:19,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:11:19" (3/3) ... [2019-11-15 22:11:19,040 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-2.i [2019-11-15 22:11:19,049 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:11:19,058 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 48 error locations. [2019-11-15 22:11:19,072 INFO L249 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2019-11-15 22:11:19,092 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:11:19,093 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:11:19,093 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:11:19,093 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:11:19,093 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:11:19,094 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:11:19,094 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:11:19,095 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:11:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-15 22:11:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:11:19,130 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:19,140 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:19,142 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION]=== [2019-11-15 22:11:19,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:19,148 INFO L82 PathProgramCache]: Analyzing trace with hash 208980062, now seen corresponding path program 1 times [2019-11-15 22:11:19,157 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:11:19,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1079138440] [2019-11-15 22:11:19,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b671758-e650-4466-8796-6015fb1bda03/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:11:19,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:11:19,391 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:11:19,395 INFO L168 Benchmark]: Toolchain (without parser) took 2023.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -118.8 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:11:19,395 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:11:19,396 INFO L168 Benchmark]: CACSL2BoogieTranslator took 553.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -206.8 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:11:19,397 INFO L168 Benchmark]: Boogie Preprocessor took 67.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:11:19,398 INFO L168 Benchmark]: RCFGBuilder took 1033.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 69.5 MB). Peak memory consumption was 69.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:11:19,398 INFO L168 Benchmark]: TraceAbstraction took 362.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:11:19,401 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 553.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -206.8 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1033.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 69.5 MB). Peak memory consumption was 69.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 362.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...