./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30390fe155d7f123b603151bf2b8a7453d49cf9d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30390fe155d7f123b603151bf2b8a7453d49cf9d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_21 term size 24 --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:10:21,560 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:10:21,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:10:21,573 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:10:21,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:10:21,575 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:10:21,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:10:21,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:10:21,580 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:10:21,580 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:10:21,581 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:10:21,582 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:10:21,583 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:10:21,584 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:10:21,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:10:21,587 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:10:21,588 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:10:21,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:10:21,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:10:21,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:10:21,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:10:21,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:10:21,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:10:21,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:10:21,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:10:21,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:10:21,601 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:10:21,601 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:10:21,603 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:10:21,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:10:21,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:10:21,605 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:10:21,605 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:10:21,605 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:10:21,607 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:10:21,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:10:21,608 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 22:10:21,621 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:10:21,621 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:10:21,621 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:10:21,622 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:10:21,622 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:10:21,622 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:10:21,623 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 22:10:21,623 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:10:21,623 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 22:10:21,623 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 22:10:21,623 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:10:21,624 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:10:21,624 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:10:21,624 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:10:21,624 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:10:21,624 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:10:21,625 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:10:21,625 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:10:21,625 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:10:21,625 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:10:21,625 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:10:21,625 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:10:21,625 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:10:21,626 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:10:21,628 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:10:21,628 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:10:21,628 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:10:21,628 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:10:21,628 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:10:21,629 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:10:21,629 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 22:10:21,629 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:10:21,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:10:21,629 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:10:21,629 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 30390fe155d7f123b603151bf2b8a7453d49cf9d [2018-10-26 22:10:21,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:10:21,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:10:21,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:10:21,669 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:10:21,669 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:10:21,670 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i [2018-10-26 22:10:21,723 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/data/ea62be6ad/d6de7a6acb7144a8830a3a5eae344c05/FLAGde1d2e8c0 [2018-10-26 22:10:22,219 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:10:22,219 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/sv-benchmarks/c/heap-manipulation/bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i [2018-10-26 22:10:22,243 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/data/ea62be6ad/d6de7a6acb7144a8830a3a5eae344c05/FLAGde1d2e8c0 [2018-10-26 22:10:22,257 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/data/ea62be6ad/d6de7a6acb7144a8830a3a5eae344c05 [2018-10-26 22:10:22,260 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:10:22,261 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:10:22,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:10:22,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:10:22,266 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:10:22,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:10:22" (1/1) ... [2018-10-26 22:10:22,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a669605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:10:22, skipping insertion in model container [2018-10-26 22:10:22,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:10:22" (1/1) ... [2018-10-26 22:10:22,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:10:22,328 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:10:22,805 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:10:22,817 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:10:22,879 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:10:22,988 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:10:22,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:10:22 WrapperNode [2018-10-26 22:10:22,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:10:22,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:10:22,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:10:22,989 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:10:23,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:10:22" (1/1) ... [2018-10-26 22:10:23,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:10:22" (1/1) ... [2018-10-26 22:10:23,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:10:23,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:10:23,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:10:23,160 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:10:23,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:10:22" (1/1) ... [2018-10-26 22:10:23,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:10:22" (1/1) ... [2018-10-26 22:10:23,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:10:22" (1/1) ... [2018-10-26 22:10:23,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:10:22" (1/1) ... [2018-10-26 22:10:23,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:10:22" (1/1) ... [2018-10-26 22:10:23,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:10:22" (1/1) ... [2018-10-26 22:10:23,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:10:22" (1/1) ... [2018-10-26 22:10:23,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:10:23,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:10:23,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:10:23,216 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:10:23,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:10:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/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 [2018-10-26 22:10:23,303 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2018-10-26 22:10:23,304 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2018-10-26 22:10:23,305 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2018-10-26 22:10:23,305 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-10-26 22:10:23,305 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2018-10-26 22:10:23,305 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2018-10-26 22:10:23,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:10:23,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:10:23,306 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-10-26 22:10:23,306 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-10-26 22:10:23,306 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2018-10-26 22:10:23,306 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-10-26 22:10:23,306 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2018-10-26 22:10:23,306 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-10-26 22:10:23,307 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2018-10-26 22:10:23,307 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2018-10-26 22:10:23,307 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-10-26 22:10:23,307 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-10-26 22:10:23,307 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-10-26 22:10:23,307 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-10-26 22:10:23,307 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2018-10-26 22:10:23,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2018-10-26 22:10:23,311 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:10:23,312 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:10:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2018-10-26 22:10:23,312 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2018-10-26 22:10:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2018-10-26 22:10:23,312 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2018-10-26 22:10:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:10:23,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:10:24,637 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:10:24,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:10:24 BoogieIcfgContainer [2018-10-26 22:10:24,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:10:24,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:10:24,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:10:24,642 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:10:24,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:10:22" (1/3) ... [2018-10-26 22:10:24,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ec3ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:10:24, skipping insertion in model container [2018-10-26 22:10:24,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:10:22" (2/3) ... [2018-10-26 22:10:24,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ec3ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:10:24, skipping insertion in model container [2018-10-26 22:10:24,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:10:24" (3/3) ... [2018-10-26 22:10:24,647 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i [2018-10-26 22:10:24,658 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:10:24,665 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:10:24,677 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:10:24,709 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:10:24,709 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:10:24,709 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:10:24,709 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:10:24,709 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:10:24,709 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:10:24,710 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:10:24,710 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:10:24,731 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2018-10-26 22:10:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 22:10:24,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:10:24,737 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:10:24,740 INFO L424 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:10:24,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:10:24,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1217746547, now seen corresponding path program 1 times [2018-10-26 22:10:24,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:10:24,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:24,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:10:24,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:24,803 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:10:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:10:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:10:24,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:10:24,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 22:10:24,907 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:10:24,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 22:10:24,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 22:10:24,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:10:24,931 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 2 states. [2018-10-26 22:10:24,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:10:24,999 INFO L93 Difference]: Finished difference Result 300 states and 471 transitions. [2018-10-26 22:10:24,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 22:10:25,000 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-10-26 22:10:25,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:10:25,015 INFO L225 Difference]: With dead ends: 300 [2018-10-26 22:10:25,015 INFO L226 Difference]: Without dead ends: 139 [2018-10-26 22:10:25,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:10:25,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-26 22:10:25,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-10-26 22:10:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-26 22:10:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2018-10-26 22:10:25,083 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 160 transitions. Word has length 15 [2018-10-26 22:10:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:10:25,084 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 160 transitions. [2018-10-26 22:10:25,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 22:10:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2018-10-26 22:10:25,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-26 22:10:25,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:10:25,086 INFO L375 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, 1, 1] [2018-10-26 22:10:25,086 INFO L424 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:10:25,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:10:25,087 INFO L82 PathProgramCache]: Analyzing trace with hash -483005412, now seen corresponding path program 1 times [2018-10-26 22:10:25,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:10:25,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:25,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:10:25,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:25,090 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:10:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:10:25,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:10:25,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:10:25,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:10:25,468 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:10:25,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:10:25,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:10:25,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:10:25,471 INFO L87 Difference]: Start difference. First operand 139 states and 160 transitions. Second operand 5 states. [2018-10-26 22:10:25,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:10:25,755 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2018-10-26 22:10:25,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:10:25,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-10-26 22:10:25,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:10:25,760 INFO L225 Difference]: With dead ends: 141 [2018-10-26 22:10:25,760 INFO L226 Difference]: Without dead ends: 138 [2018-10-26 22:10:25,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:10:25,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-26 22:10:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-10-26 22:10:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-26 22:10:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 158 transitions. [2018-10-26 22:10:25,778 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 158 transitions. Word has length 35 [2018-10-26 22:10:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:10:25,780 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 158 transitions. [2018-10-26 22:10:25,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:10:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2018-10-26 22:10:25,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 22:10:25,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:10:25,782 INFO L375 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, 1, 1, 1, 1, 1] [2018-10-26 22:10:25,782 INFO L424 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:10:25,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:10:25,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1326671008, now seen corresponding path program 1 times [2018-10-26 22:10:25,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:10:25,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:25,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:10:25,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:25,785 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:10:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:10:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:10:26,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:10:26,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-26 22:10:26,603 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:10:26,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 22:10:26,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 22:10:26,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:10:26,604 INFO L87 Difference]: Start difference. First operand 138 states and 158 transitions. Second operand 14 states. [2018-10-26 22:10:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:10:28,985 INFO L93 Difference]: Finished difference Result 250 states and 292 transitions. [2018-10-26 22:10:28,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 22:10:28,986 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-10-26 22:10:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:10:28,990 INFO L225 Difference]: With dead ends: 250 [2018-10-26 22:10:28,991 INFO L226 Difference]: Without dead ends: 244 [2018-10-26 22:10:28,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2018-10-26 22:10:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-26 22:10:29,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 216. [2018-10-26 22:10:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-26 22:10:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2018-10-26 22:10:29,024 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 38 [2018-10-26 22:10:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:10:29,025 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2018-10-26 22:10:29,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 22:10:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2018-10-26 22:10:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 22:10:29,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:10:29,026 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:10:29,027 INFO L424 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:10:29,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:10:29,027 INFO L82 PathProgramCache]: Analyzing trace with hash -804495318, now seen corresponding path program 1 times [2018-10-26 22:10:29,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:10:29,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:29,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:10:29,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:29,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:10:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:10:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:10:29,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:10:29,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-26 22:10:29,526 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:10:29,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 22:10:29,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 22:10:29,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:10:29,527 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand 15 states. [2018-10-26 22:10:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:10:34,575 INFO L93 Difference]: Finished difference Result 355 states and 425 transitions. [2018-10-26 22:10:34,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 22:10:34,576 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-10-26 22:10:34,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:10:34,577 INFO L225 Difference]: With dead ends: 355 [2018-10-26 22:10:34,577 INFO L226 Difference]: Without dead ends: 352 [2018-10-26 22:10:34,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-10-26 22:10:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-10-26 22:10:34,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 317. [2018-10-26 22:10:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-26 22:10:34,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 380 transitions. [2018-10-26 22:10:34,623 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 380 transitions. Word has length 41 [2018-10-26 22:10:34,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:10:34,624 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 380 transitions. [2018-10-26 22:10:34,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 22:10:34,624 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 380 transitions. [2018-10-26 22:10:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 22:10:34,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:10:34,625 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:10:34,627 INFO L424 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:10:34,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:10:34,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1704057548, now seen corresponding path program 1 times [2018-10-26 22:10:34,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:10:34,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:34,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:10:34,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:34,630 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:10:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:10:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:10:35,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:10:35,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-26 22:10:35,189 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:10:35,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 22:10:35,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 22:10:35,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:10:35,191 INFO L87 Difference]: Start difference. First operand 317 states and 380 transitions. Second operand 15 states. [2018-10-26 22:10:37,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:10:37,233 INFO L93 Difference]: Finished difference Result 354 states and 423 transitions. [2018-10-26 22:10:37,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 22:10:37,234 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-10-26 22:10:37,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:10:37,236 INFO L225 Difference]: With dead ends: 354 [2018-10-26 22:10:37,236 INFO L226 Difference]: Without dead ends: 351 [2018-10-26 22:10:37,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2018-10-26 22:10:37,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-26 22:10:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 317. [2018-10-26 22:10:37,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-26 22:10:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 379 transitions. [2018-10-26 22:10:37,281 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 379 transitions. Word has length 45 [2018-10-26 22:10:37,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:10:37,283 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 379 transitions. [2018-10-26 22:10:37,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 22:10:37,283 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 379 transitions. [2018-10-26 22:10:37,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-26 22:10:37,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:10:37,285 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:10:37,285 INFO L424 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:10:37,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:10:37,286 INFO L82 PathProgramCache]: Analyzing trace with hash 730040884, now seen corresponding path program 1 times [2018-10-26 22:10:37,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:10:37,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:37,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:10:37,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:37,290 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:10:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:10:37,659 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2018-10-26 22:10:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:10:38,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:10:38,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-10-26 22:10:38,487 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:10:38,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-26 22:10:38,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-26 22:10:38,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-10-26 22:10:38,489 INFO L87 Difference]: Start difference. First operand 317 states and 379 transitions. Second operand 19 states. [2018-10-26 22:10:40,352 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2018-10-26 22:10:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:10:43,489 INFO L93 Difference]: Finished difference Result 379 states and 453 transitions. [2018-10-26 22:10:43,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-26 22:10:43,490 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-10-26 22:10:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:10:43,492 INFO L225 Difference]: With dead ends: 379 [2018-10-26 22:10:43,492 INFO L226 Difference]: Without dead ends: 376 [2018-10-26 22:10:43,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2018-10-26 22:10:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-26 22:10:43,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 348. [2018-10-26 22:10:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-26 22:10:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 418 transitions. [2018-10-26 22:10:43,549 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 418 transitions. Word has length 48 [2018-10-26 22:10:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:10:43,550 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 418 transitions. [2018-10-26 22:10:43,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-26 22:10:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 418 transitions. [2018-10-26 22:10:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-26 22:10:43,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:10:43,553 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:10:43,554 INFO L424 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:10:43,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:10:43,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1256067134, now seen corresponding path program 1 times [2018-10-26 22:10:43,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:10:43,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:43,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:10:43,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:43,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:10:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:10:43,840 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2018-10-26 22:10:44,190 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2018-10-26 22:10:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:10:44,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:10:44,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-26 22:10:44,390 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:10:44,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 22:10:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 22:10:44,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-10-26 22:10:44,391 INFO L87 Difference]: Start difference. First operand 348 states and 418 transitions. Second operand 16 states. [2018-10-26 22:10:44,978 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-26 22:10:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:10:47,104 INFO L93 Difference]: Finished difference Result 373 states and 445 transitions. [2018-10-26 22:10:47,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-26 22:10:47,105 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-10-26 22:10:47,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:10:47,107 INFO L225 Difference]: With dead ends: 373 [2018-10-26 22:10:47,107 INFO L226 Difference]: Without dead ends: 370 [2018-10-26 22:10:47,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2018-10-26 22:10:47,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-26 22:10:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 348. [2018-10-26 22:10:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-26 22:10:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 417 transitions. [2018-10-26 22:10:47,156 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 417 transitions. Word has length 51 [2018-10-26 22:10:47,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:10:47,156 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 417 transitions. [2018-10-26 22:10:47,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 22:10:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 417 transitions. [2018-10-26 22:10:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-26 22:10:47,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:10:47,159 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:10:47,159 INFO L424 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:10:47,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:10:47,160 INFO L82 PathProgramCache]: Analyzing trace with hash 755229644, now seen corresponding path program 1 times [2018-10-26 22:10:47,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:10:47,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:47,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:10:47,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:47,162 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:10:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:10:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:10:47,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:10:47,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-26 22:10:47,578 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:10:47,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 22:10:47,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 22:10:47,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-10-26 22:10:47,579 INFO L87 Difference]: Start difference. First operand 348 states and 417 transitions. Second operand 16 states. [2018-10-26 22:10:49,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:10:49,541 INFO L93 Difference]: Finished difference Result 372 states and 443 transitions. [2018-10-26 22:10:49,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-26 22:10:49,543 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-10-26 22:10:49,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:10:49,545 INFO L225 Difference]: With dead ends: 372 [2018-10-26 22:10:49,545 INFO L226 Difference]: Without dead ends: 369 [2018-10-26 22:10:49,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 22:10:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-26 22:10:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 348. [2018-10-26 22:10:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-26 22:10:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 416 transitions. [2018-10-26 22:10:49,581 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 416 transitions. Word has length 55 [2018-10-26 22:10:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:10:49,581 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 416 transitions. [2018-10-26 22:10:49,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 22:10:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 416 transitions. [2018-10-26 22:10:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-26 22:10:49,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:10:49,584 INFO L375 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, 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] [2018-10-26 22:10:49,584 INFO L424 AbstractCegarLoop]: === Iteration 9 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:10:49,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:10:49,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1850540936, now seen corresponding path program 1 times [2018-10-26 22:10:49,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:10:49,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:49,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:10:49,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:49,586 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:10:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:10:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:10:50,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:10:50,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-10-26 22:10:50,157 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:10:50,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 22:10:50,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 22:10:50,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-10-26 22:10:50,158 INFO L87 Difference]: Start difference. First operand 348 states and 416 transitions. Second operand 17 states. [2018-10-26 22:10:52,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:10:52,573 INFO L93 Difference]: Finished difference Result 371 states and 441 transitions. [2018-10-26 22:10:52,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-26 22:10:52,594 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-10-26 22:10:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:10:52,596 INFO L225 Difference]: With dead ends: 371 [2018-10-26 22:10:52,596 INFO L226 Difference]: Without dead ends: 368 [2018-10-26 22:10:52,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2018-10-26 22:10:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-26 22:10:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 348. [2018-10-26 22:10:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-26 22:10:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 415 transitions. [2018-10-26 22:10:52,647 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 415 transitions. Word has length 58 [2018-10-26 22:10:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:10:52,647 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 415 transitions. [2018-10-26 22:10:52,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 22:10:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 415 transitions. [2018-10-26 22:10:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-26 22:10:52,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:10:52,648 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-10-26 22:10:52,649 INFO L424 AbstractCegarLoop]: === Iteration 10 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:10:52,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:10:52,649 INFO L82 PathProgramCache]: Analyzing trace with hash 399203020, now seen corresponding path program 1 times [2018-10-26 22:10:52,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:10:52,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:52,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:10:52,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:10:52,659 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:10:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:10:53,175 WARN L179 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2018-10-26 22:10:53,595 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 22:10:54,443 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 24 [2018-10-26 22:10:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:10:54,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:10:54,644 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:10:54,644 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-10-26 22:10:54,646 INFO L202 CegarAbsIntRunner]: [0], [1], [56], [58], [60], [63], [65], [69], [86], [89], [90], [96], [100], [106], [110], [118], [124], [128], [136], [139], [424], [426], [427], [431], [436], [438], [443], [447], [453], [462], [463], [464], [472], [473], [482], [512], [513], [514], [515], [516], [518], [519] [2018-10-26 22:10:54,702 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:10:54,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:10:55,229 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:10:55,230 INFO L272 AbstractInterpreter]: Visited 42 different actions 60 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 44 variables. [2018-10-26 22:10:55,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:10:55,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:10:55,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:10:55,288 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:10:55,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:10:55,310 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 22:10:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:10:55,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:10:55,507 INFO L477 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 [2018-10-26 22:10:55,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:55,587 INFO L477 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 16 treesize of output 13 [2018-10-26 22:10:55,600 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-10-26 22:10:55,609 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:55,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2018-10-26 22:10:55,615 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:55,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:10:55,625 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:10:55,636 INFO L477 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 16 treesize of output 13 [2018-10-26 22:10:55,648 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-10-26 22:10:55,651 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:55,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2018-10-26 22:10:55,652 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:55,657 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:10:55,660 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:10:55,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:10:55,669 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-10-26 22:10:55,744 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 22:10:55,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:55,782 INFO L477 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 13 [2018-10-26 22:10:55,816 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:55,817 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-10-26 22:10:55,817 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:55,822 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:10:55,830 INFO L477 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 7 treesize of output 5 [2018-10-26 22:10:55,840 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 22:10:55,841 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:55,842 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:10:55,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:10:55,847 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:41, output treesize:13 [2018-10-26 22:10:56,072 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 22:10:56,106 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:56,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 5 [2018-10-26 22:10:56,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:56,159 INFO L267 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. [2018-10-26 22:10:56,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-10-26 22:10:56,686 INFO L477 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 0 case distinctions, treesize of input 77 treesize of output 48 [2018-10-26 22:10:56,761 INFO L477 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 10 treesize of output 9 [2018-10-26 22:10:56,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:56,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 38 treesize of output 53 [2018-10-26 22:10:56,821 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2018-10-26 22:10:56,866 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:56,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 22 treesize of output 35 [2018-10-26 22:10:56,876 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:57,043 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:10:57,594 INFO L477 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 2 case distinctions, treesize of input 39 treesize of output 47 [2018-10-26 22:10:57,598 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:57,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 39 treesize of output 46 [2018-10-26 22:10:57,600 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:57,627 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:57,628 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:57,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 64 [2018-10-26 22:10:57,643 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-26 22:10:57,871 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:10:57,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 50 [2018-10-26 22:10:57,986 INFO L477 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 41 treesize of output 40 [2018-10-26 22:10:57,987 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:58,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 58 [2018-10-26 22:10:58,079 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:58,080 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:58,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 81 [2018-10-26 22:10:58,093 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-10-26 22:10:58,169 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:58,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 40 treesize of output 53 [2018-10-26 22:10:58,172 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:58,436 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:58,437 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:58,440 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:58,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-10-26 22:10:58,448 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-10-26 22:10:58,561 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:58,562 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:58,562 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-10-26 22:10:58,563 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:58,637 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-26 22:10:58,723 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-26 22:10:58,883 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2018-10-26 22:10:58,886 INFO L477 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 8 treesize of output 13 [2018-10-26 22:10:58,886 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:58,895 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:10:58,910 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2018-10-26 22:10:58,912 INFO L477 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 8 treesize of output 13 [2018-10-26 22:10:58,913 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:58,921 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:10:59,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 57 [2018-10-26 22:10:59,089 INFO L477 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 48 treesize of output 53 [2018-10-26 22:10:59,089 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:59,131 INFO L477 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 58 [2018-10-26 22:10:59,132 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-10-26 22:10:59,160 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:10:59,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-26 22:10:59,263 INFO L477 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 45 treesize of output 58 [2018-10-26 22:10:59,299 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-10-26 22:10:59,339 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:59,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 36 treesize of output 46 [2018-10-26 22:10:59,370 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:59,384 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:10:59,446 INFO L477 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 2 case distinctions, treesize of input 44 treesize of output 49 [2018-10-26 22:10:59,450 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:59,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 41 treesize of output 45 [2018-10-26 22:10:59,453 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-26 22:10:59,485 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:59,486 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:59,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 63 [2018-10-26 22:10:59,498 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-10-26 22:10:59,541 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:10:59,637 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-10-26 22:10:59,643 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:10:59,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 58 [2018-10-26 22:10:59,667 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 4 xjuncts. [2018-10-26 22:10:59,700 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:10:59,844 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 55 [2018-10-26 22:10:59,851 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:00,053 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:11:00,054 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_18 term size 27 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) 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:286) 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.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2018-10-26 22:11:00,057 INFO L168 Benchmark]: Toolchain (without parser) took 37797.06 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 478.7 MB). Free memory was 953.1 MB in the beginning and 1.2 GB in the end (delta: -271.3 MB). Peak memory consumption was 567.5 MB. Max. memory is 11.5 GB. [2018-10-26 22:11:00,058 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:11:00,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.17 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 904.7 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:11:00,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 170.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 904.7 MB in the beginning and 1.2 GB in the end (delta: -251.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-10-26 22:11:00,059 INFO L168 Benchmark]: Boogie Preprocessor took 55.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:11:00,059 INFO L168 Benchmark]: RCFGBuilder took 1421.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. [2018-10-26 22:11:00,059 INFO L168 Benchmark]: TraceAbstraction took 35417.66 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 314.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -131.6 MB). Peak memory consumption was 542.6 MB. Max. memory is 11.5 GB. [2018-10-26 22:11:00,062 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 727.17 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 904.7 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 170.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 904.7 MB in the beginning and 1.2 GB in the end (delta: -251.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1421.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35417.66 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 314.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -131.6 MB). Peak memory consumption was 542.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_18 term size 27 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_18 term size 27: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:11:02,209 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:11:02,211 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:11:02,222 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:11:02,222 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:11:02,223 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:11:02,224 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:11:02,226 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:11:02,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:11:02,229 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:11:02,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:11:02,230 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:11:02,231 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:11:02,232 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:11:02,233 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:11:02,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:11:02,235 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:11:02,237 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:11:02,247 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:11:02,248 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:11:02,249 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:11:02,251 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:11:02,253 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:11:02,253 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:11:02,254 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:11:02,255 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:11:02,256 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:11:02,257 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:11:02,257 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:11:02,259 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:11:02,259 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:11:02,260 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:11:02,260 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:11:02,260 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:11:02,261 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:11:02,263 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:11:02,263 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 22:11:02,277 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:11:02,277 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:11:02,278 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:11:02,279 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:11:02,279 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:11:02,279 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:11:02,279 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:11:02,279 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:11:02,280 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:11:02,280 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:11:02,280 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:11:02,280 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:11:02,281 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:11:02,281 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:11:02,281 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:11:02,281 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 22:11:02,281 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 22:11:02,281 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:11:02,282 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:11:02,282 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:11:02,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:11:02,284 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:11:02,284 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:11:02,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:11:02,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:11:02,285 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:11:02,285 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:11:02,285 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:11:02,285 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 22:11:02,285 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:11:02,285 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 22:11:02,286 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 22:11:02,286 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 30390fe155d7f123b603151bf2b8a7453d49cf9d [2018-10-26 22:11:02,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:11:02,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:11:02,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:11:02,351 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:11:02,351 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:11:02,352 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i [2018-10-26 22:11:02,404 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/data/89fb041a6/b9661f5c2b604c87ac8629e7fad03f36/FLAG0b9a2e20f [2018-10-26 22:11:02,905 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:11:02,906 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/sv-benchmarks/c/heap-manipulation/bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i [2018-10-26 22:11:02,922 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/data/89fb041a6/b9661f5c2b604c87ac8629e7fad03f36/FLAG0b9a2e20f [2018-10-26 22:11:02,935 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/data/89fb041a6/b9661f5c2b604c87ac8629e7fad03f36 [2018-10-26 22:11:02,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:11:02,940 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:11:02,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:11:02,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:11:02,946 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:11:02,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:11:02" (1/1) ... [2018-10-26 22:11:02,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f28d48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:02, skipping insertion in model container [2018-10-26 22:11:02,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:11:02" (1/1) ... [2018-10-26 22:11:02,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:11:03,010 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:11:03,544 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:11:03,559 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:11:03,642 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:11:03,758 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:11:03,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:03 WrapperNode [2018-10-26 22:11:03,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:11:03,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:11:03,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:11:03,760 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:11:03,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:03" (1/1) ... [2018-10-26 22:11:03,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:03" (1/1) ... [2018-10-26 22:11:03,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:11:03,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:11:03,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:11:03,916 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:11:03,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:03" (1/1) ... [2018-10-26 22:11:03,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:03" (1/1) ... [2018-10-26 22:11:03,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:03" (1/1) ... [2018-10-26 22:11:03,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:03" (1/1) ... [2018-10-26 22:11:03,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:03" (1/1) ... [2018-10-26 22:11:03,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:03" (1/1) ... [2018-10-26 22:11:03,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:03" (1/1) ... [2018-10-26 22:11:03,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:11:03,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:11:03,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:11:03,979 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:11:03,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/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 [2018-10-26 22:11:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2018-10-26 22:11:04,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2018-10-26 22:11:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2018-10-26 22:11:04,025 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-10-26 22:11:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2018-10-26 22:11:04,026 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2018-10-26 22:11:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:11:04,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:11:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-10-26 22:11:04,026 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-10-26 22:11:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2018-10-26 22:11:04,027 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-10-26 22:11:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2018-10-26 22:11:04,027 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-10-26 22:11:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2018-10-26 22:11:04,027 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2018-10-26 22:11:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-10-26 22:11:04,027 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-10-26 22:11:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-10-26 22:11:04,028 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-10-26 22:11:04,028 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2018-10-26 22:11:04,028 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2018-10-26 22:11:04,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:11:04,028 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:11:04,028 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2018-10-26 22:11:04,028 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2018-10-26 22:11:04,028 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2018-10-26 22:11:04,029 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2018-10-26 22:11:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:11:04,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:11:05,266 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:11:05,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:11:05 BoogieIcfgContainer [2018-10-26 22:11:05,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:11:05,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:11:05,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:11:05,272 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:11:05,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:11:02" (1/3) ... [2018-10-26 22:11:05,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2505777d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:11:05, skipping insertion in model container [2018-10-26 22:11:05,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:03" (2/3) ... [2018-10-26 22:11:05,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2505777d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:11:05, skipping insertion in model container [2018-10-26 22:11:05,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:11:05" (3/3) ... [2018-10-26 22:11:05,276 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i [2018-10-26 22:11:05,284 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:11:05,291 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:11:05,308 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:11:05,342 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:11:05,342 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:11:05,343 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:11:05,343 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:11:05,343 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:11:05,346 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:11:05,346 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:11:05,346 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:11:05,347 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:11:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2018-10-26 22:11:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 22:11:05,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:11:05,375 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:11:05,377 INFO L424 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:11:05,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:11:05,384 INFO L82 PathProgramCache]: Analyzing trace with hash -914397588, now seen corresponding path program 1 times [2018-10-26 22:11:05,389 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:11:05,390 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:11:05,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:11:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:11:05,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:11:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:11:05,495 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:11:05,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:11:05,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 22:11:05,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 22:11:05,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 22:11:05,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:11:05,520 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 2 states. [2018-10-26 22:11:05,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:11:05,592 INFO L93 Difference]: Finished difference Result 298 states and 469 transitions. [2018-10-26 22:11:05,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 22:11:05,594 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-10-26 22:11:05,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:11:05,611 INFO L225 Difference]: With dead ends: 298 [2018-10-26 22:11:05,611 INFO L226 Difference]: Without dead ends: 138 [2018-10-26 22:11:05,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:11:05,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-26 22:11:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-10-26 22:11:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-26 22:11:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 159 transitions. [2018-10-26 22:11:05,673 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 159 transitions. Word has length 15 [2018-10-26 22:11:05,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:11:05,675 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 159 transitions. [2018-10-26 22:11:05,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 22:11:05,675 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 159 transitions. [2018-10-26 22:11:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 22:11:05,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:11:05,678 INFO L375 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, 1] [2018-10-26 22:11:05,678 INFO L424 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:11:05,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:11:05,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1731062258, now seen corresponding path program 1 times [2018-10-26 22:11:05,680 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:11:05,680 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:11:05,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:11:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:11:05,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:11:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:11:05,886 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:11:05,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:11:05,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:11:05,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:11:05,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:11:05,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:11:05,894 INFO L87 Difference]: Start difference. First operand 138 states and 159 transitions. Second operand 5 states. [2018-10-26 22:11:06,049 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 22:11:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:11:06,596 INFO L93 Difference]: Finished difference Result 140 states and 160 transitions. [2018-10-26 22:11:06,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:11:06,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-10-26 22:11:06,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:11:06,599 INFO L225 Difference]: With dead ends: 140 [2018-10-26 22:11:06,599 INFO L226 Difference]: Without dead ends: 137 [2018-10-26 22:11:06,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:11:06,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-26 22:11:06,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-10-26 22:11:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-26 22:11:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2018-10-26 22:11:06,619 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 34 [2018-10-26 22:11:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:11:06,621 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2018-10-26 22:11:06,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:11:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2018-10-26 22:11:06,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 22:11:06,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:11:06,623 INFO L375 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, 1, 1, 1, 1] [2018-10-26 22:11:06,624 INFO L424 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:11:06,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:11:06,624 INFO L82 PathProgramCache]: Analyzing trace with hash -656289715, now seen corresponding path program 1 times [2018-10-26 22:11:06,625 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:11:06,625 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:11:06,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:11:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:11:06,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:11:06,861 INFO L477 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 [2018-10-26 22:11:06,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:06,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:06,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:11:06,913 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-26 22:11:06,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:06,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:06,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-10-26 22:11:07,103 INFO L477 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 11 treesize of output 8 [2018-10-26 22:11:07,106 INFO L477 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 8 treesize of output 7 [2018-10-26 22:11:07,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:07,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:07,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:07,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-26 22:11:07,384 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 36 [2018-10-26 22:11:07,391 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-10-26 22:11:07,411 INFO L477 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-10-26 22:11:07,412 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-26 22:11:07,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:11:07,540 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:07,542 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:07,543 INFO L477 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 0 case distinctions, treesize of input 22 treesize of output 34 [2018-10-26 22:11:07,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 34 [2018-10-26 22:11:07,618 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-26 22:11:07,714 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:11:07,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:11:07,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-26 22:11:07,824 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:58 [2018-10-26 22:11:08,067 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:08,090 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:08,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-10-26 22:11:08,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:08,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:08,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:11 [2018-10-26 22:11:08,264 INFO L477 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 11 [2018-10-26 22:11:08,267 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 22:11:08,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:08,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:08,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:08,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-10-26 22:11:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:11:08,326 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 22:11:08,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:11:08,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-26 22:11:08,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 22:11:08,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 22:11:08,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:11:08,335 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 15 states. [2018-10-26 22:11:12,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:11:12,376 INFO L93 Difference]: Finished difference Result 249 states and 291 transitions. [2018-10-26 22:11:12,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-26 22:11:12,377 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-10-26 22:11:12,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:11:12,382 INFO L225 Difference]: With dead ends: 249 [2018-10-26 22:11:12,383 INFO L226 Difference]: Without dead ends: 243 [2018-10-26 22:11:12,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2018-10-26 22:11:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-26 22:11:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 215. [2018-10-26 22:11:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-26 22:11:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 253 transitions. [2018-10-26 22:11:12,427 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 253 transitions. Word has length 37 [2018-10-26 22:11:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:11:12,431 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 253 transitions. [2018-10-26 22:11:12,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 22:11:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 253 transitions. [2018-10-26 22:11:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 22:11:12,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:11:12,433 INFO L375 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:11:12,433 INFO L424 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:11:12,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:11:12,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1073322948, now seen corresponding path program 1 times [2018-10-26 22:11:12,434 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:11:12,434 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_624ecf9e-4ee0-42eb-a57a-ae97e8031c80/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:11:12,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:11:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:11:12,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:11:12,691 INFO L477 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 [2018-10-26 22:11:12,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:12,753 INFO L477 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 16 treesize of output 13 [2018-10-26 22:11:12,756 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-10-26 22:11:12,761 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:12,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2018-10-26 22:11:12,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:12,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:12,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:12,809 INFO L477 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 16 treesize of output 13 [2018-10-26 22:11:12,813 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-10-26 22:11:12,818 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:12,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2018-10-26 22:11:12,821 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:12,830 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:12,838 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:12,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:12,857 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:42, output treesize:23 [2018-10-26 22:11:12,894 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-26 22:11:12,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:12,935 INFO L477 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 7 treesize of output 5 [2018-10-26 22:11:12,950 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 22:11:12,951 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:12,961 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:12,976 INFO L477 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 7 treesize of output 5 [2018-10-26 22:11:12,978 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 22:11:12,978 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:12,983 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:12,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:12,991 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:34, output treesize:13 [2018-10-26 22:11:13,120 INFO L477 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 0 case distinctions, treesize of input 77 treesize of output 48 [2018-10-26 22:11:13,278 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-26 22:11:13,298 INFO L477 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 10 treesize of output 9 [2018-10-26 22:11:13,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:13,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 38 treesize of output 53 [2018-10-26 22:11:13,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 42 treesize of output 44 [2018-10-26 22:11:13,564 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:13,569 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 22:11:13,569 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:13,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:13,880 INFO L477 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 0 case distinctions, treesize of input 39 treesize of output 41 [2018-10-26 22:11:13,891 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:13,898 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:13,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 48 [2018-10-26 22:11:13,963 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-26 22:11:14,073 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:11:14,563 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:14,573 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-10-26 22:11:14,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-10-26 22:11:14,578 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:14,606 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:14,611 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:14,630 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-10-26 22:11:14,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-10-26 22:11:14,648 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:14,681 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:15,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 50 [2018-10-26 22:11:15,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 41 treesize of output 40 [2018-10-26 22:11:15,092 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:15,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 52 [2018-10-26 22:11:15,315 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:15,316 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2018-10-26 22:11:15,317 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:15,422 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:15,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 69 [2018-10-26 22:11:15,600 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-10-26 22:11:15,756 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:11:16,013 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 22:11:16,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 53 [2018-10-26 22:11:16,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 42 treesize of output 41 [2018-10-26 22:11:16,571 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:16,744 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:16,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:11:17,072 INFO L477 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 45 treesize of output 58 [2018-10-26 22:11:17,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 47 treesize of output 46 [2018-10-26 22:11:17,088 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:17,089 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-10-26 22:11:17,090 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:17,127 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:17,776 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:11:17,777 INFO L477 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 0 case distinctions, treesize of input 44 treesize of output 43 [2018-10-26 22:11:17,790 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:11:17,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-10-26 22:11:17,799 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-26 22:11:17,840 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:11:18,294 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 55 [2018-10-26 22:11:18,304 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:11:18,505 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:11:18,506 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_21 term size 24 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) 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:286) 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.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2018-10-26 22:11:18,510 INFO L168 Benchmark]: Toolchain (without parser) took 15570.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 946.5 MB in the beginning and 781.2 MB in the end (delta: 165.3 MB). Peak memory consumption was 351.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:11:18,511 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:11:18,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.71 ms. Allocated memory is still 1.0 GB. Free memory was 946.5 MB in the beginning and 892.8 MB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2018-10-26 22:11:18,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 155.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 892.8 MB in the beginning and 1.1 GB in the end (delta: -203.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:11:18,512 INFO L168 Benchmark]: Boogie Preprocessor took 61.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:11:18,512 INFO L168 Benchmark]: RCFGBuilder took 1288.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2018-10-26 22:11:18,513 INFO L168 Benchmark]: TraceAbstraction took 13240.84 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.0 GB in the beginning and 781.2 MB in the end (delta: 256.2 MB). Peak memory consumption was 332.2 MB. Max. memory is 11.5 GB. [2018-10-26 22:11:18,519 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 817.71 ms. Allocated memory is still 1.0 GB. Free memory was 946.5 MB in the beginning and 892.8 MB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 155.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 892.8 MB in the beginning and 1.1 GB in the end (delta: -203.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1288.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13240.84 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.0 GB in the beginning and 781.2 MB in the end (delta: 256.2 MB). Peak memory consumption was 332.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_21 term size 24 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_21 term size 24: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...