./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_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/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_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/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_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/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_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/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-11-10 07:50:39,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:50:39,161 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:50:39,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:50:39,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:50:39,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:50:39,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:50:39,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:50:39,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:50:39,171 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:50:39,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:50:39,172 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:50:39,173 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:50:39,173 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:50:39,174 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:50:39,175 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:50:39,175 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:50:39,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:50:39,177 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:50:39,178 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:50:39,179 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:50:39,179 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:50:39,181 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:50:39,181 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:50:39,181 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:50:39,181 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:50:39,182 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:50:39,183 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:50:39,183 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:50:39,184 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:50:39,184 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:50:39,185 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:50:39,185 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:50:39,185 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:50:39,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:50:39,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:50:39,186 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 07:50:39,193 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:50:39,193 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:50:39,194 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:50:39,194 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 07:50:39,194 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 07:50:39,194 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 07:50:39,194 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 07:50:39,194 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 07:50:39,194 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 07:50:39,194 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 07:50:39,194 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 07:50:39,195 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:50:39,195 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:50:39,195 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:50:39,195 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:50:39,195 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:50:39,196 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:50:39,196 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:50:39,196 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:50:39,196 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:50:39,196 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:50:39,196 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:50:39,196 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:50:39,196 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:50:39,197 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:50:39,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:50:39,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:50:39,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:50:39,197 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:50:39,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:50:39,197 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 07:50:39,197 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:50:39,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:50:39,197 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 07:50:39,197 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_7f59642f-b27b-463b-b782-5fd48142d95b/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-11-10 07:50:39,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:50:39,229 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:50:39,231 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:50:39,231 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:50:39,232 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:50:39,232 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i [2018-11-10 07:50:39,267 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/data/7a752003d/7d9533c037b6496e8f645f75ecdda425/FLAGa0f2305b5 [2018-11-10 07:50:39,709 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:50:39,710 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/sv-benchmarks/c/heap-manipulation/bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i [2018-11-10 07:50:39,719 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/data/7a752003d/7d9533c037b6496e8f645f75ecdda425/FLAGa0f2305b5 [2018-11-10 07:50:39,727 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/data/7a752003d/7d9533c037b6496e8f645f75ecdda425 [2018-11-10 07:50:39,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:50:39,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:50:39,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:50:39,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:50:39,734 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:50:39,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:50:39" (1/1) ... [2018-11-10 07:50:39,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b67d1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:50:39, skipping insertion in model container [2018-11-10 07:50:39,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:50:39" (1/1) ... [2018-11-10 07:50:39,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:50:39,774 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:50:40,028 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:50:40,035 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:50:40,118 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:50:40,191 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:50:40,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:50:40 WrapperNode [2018-11-10 07:50:40,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:50:40,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:50:40,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:50:40,193 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:50:40,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:50:40" (1/1) ... [2018-11-10 07:50:40,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:50:40" (1/1) ... [2018-11-10 07:50:40,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:50:40,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:50:40,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:50:40,242 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:50:40,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:50:40" (1/1) ... [2018-11-10 07:50:40,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:50:40" (1/1) ... [2018-11-10 07:50:40,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:50:40" (1/1) ... [2018-11-10 07:50:40,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:50:40" (1/1) ... [2018-11-10 07:50:40,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:50:40" (1/1) ... [2018-11-10 07:50:40,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:50:40" (1/1) ... [2018-11-10 07:50:40,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:50:40" (1/1) ... [2018-11-10 07:50:40,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:50:40,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:50:40,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:50:40,275 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:50:40,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:50:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/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-11-10 07:50:40,331 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2018-11-10 07:50:40,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2018-11-10 07:50:40,332 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2018-11-10 07:50:40,332 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-11-10 07:50:40,332 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2018-11-10 07:50:40,332 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2018-11-10 07:50:40,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:50:40,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:50:40,332 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-11-10 07:50:40,333 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-11-10 07:50:40,333 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2018-11-10 07:50:40,333 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-11-10 07:50:40,333 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2018-11-10 07:50:40,333 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-11-10 07:50:40,333 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2018-11-10 07:50:40,333 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2018-11-10 07:50:40,333 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-10 07:50:40,333 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-10 07:50:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-11-10 07:50:40,334 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-11-10 07:50:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2018-11-10 07:50:40,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2018-11-10 07:50:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:50:40,334 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:50:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2018-11-10 07:50:40,334 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2018-11-10 07:50:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2018-11-10 07:50:40,334 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2018-11-10 07:50:40,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:50:40,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:50:40,821 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:50:40,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:50:40 BoogieIcfgContainer [2018-11-10 07:50:40,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:50:40,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:50:40,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:50:40,824 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:50:40,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:50:39" (1/3) ... [2018-11-10 07:50:40,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731c61b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:50:40, skipping insertion in model container [2018-11-10 07:50:40,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:50:40" (2/3) ... [2018-11-10 07:50:40,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731c61b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:50:40, skipping insertion in model container [2018-11-10 07:50:40,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:50:40" (3/3) ... [2018-11-10 07:50:40,827 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i [2018-11-10 07:50:40,833 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:50:40,841 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:50:40,851 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:50:40,873 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:50:40,873 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:50:40,873 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:50:40,873 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:50:40,873 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:50:40,873 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:50:40,874 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:50:40,874 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:50:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2018-11-10 07:50:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 07:50:40,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:50:40,894 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:50:40,896 INFO L424 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:50:40,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:50:40,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1217746547, now seen corresponding path program 1 times [2018-11-10 07:50:40,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:50:40,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:40,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:50:40,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:40,941 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:50:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:50:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:50:41,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:50:41,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:50:41,010 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:50:41,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 07:50:41,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:50:41,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:50:41,024 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 2 states. [2018-11-10 07:50:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:50:41,057 INFO L93 Difference]: Finished difference Result 300 states and 471 transitions. [2018-11-10 07:50:41,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:50:41,059 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-10 07:50:41,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:50:41,066 INFO L225 Difference]: With dead ends: 300 [2018-11-10 07:50:41,067 INFO L226 Difference]: Without dead ends: 139 [2018-11-10 07:50:41,070 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-11-10 07:50:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-10 07:50:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-11-10 07:50:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-10 07:50:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2018-11-10 07:50:41,106 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 160 transitions. Word has length 15 [2018-11-10 07:50:41,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:50:41,106 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 160 transitions. [2018-11-10 07:50:41,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 07:50:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2018-11-10 07:50:41,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 07:50:41,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:50:41,108 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-11-10 07:50:41,108 INFO L424 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:50:41,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:50:41,109 INFO L82 PathProgramCache]: Analyzing trace with hash -483005412, now seen corresponding path program 1 times [2018-11-10 07:50:41,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:50:41,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:41,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:50:41,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:41,111 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:50:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:50:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:50:41,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:50:41,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:50:41,229 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:50:41,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:50:41,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:50:41,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:50:41,231 INFO L87 Difference]: Start difference. First operand 139 states and 160 transitions. Second operand 5 states. [2018-11-10 07:50:41,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:50:41,384 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2018-11-10 07:50:41,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:50:41,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-10 07:50:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:50:41,386 INFO L225 Difference]: With dead ends: 141 [2018-11-10 07:50:41,386 INFO L226 Difference]: Without dead ends: 138 [2018-11-10 07:50:41,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:50:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-10 07:50:41,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-10 07:50:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-10 07:50:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 158 transitions. [2018-11-10 07:50:41,398 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 158 transitions. Word has length 35 [2018-11-10 07:50:41,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:50:41,400 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 158 transitions. [2018-11-10 07:50:41,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:50:41,400 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2018-11-10 07:50:41,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 07:50:41,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:50:41,401 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-11-10 07:50:41,401 INFO L424 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:50:41,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:50:41,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1326671008, now seen corresponding path program 1 times [2018-11-10 07:50:41,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:50:41,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:41,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:50:41,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:41,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:50:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:50:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:50:41,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:50:41,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 07:50:41,622 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:50:41,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 07:50:41,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 07:50:41,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:50:41,623 INFO L87 Difference]: Start difference. First operand 138 states and 158 transitions. Second operand 14 states. [2018-11-10 07:50:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:50:42,618 INFO L93 Difference]: Finished difference Result 250 states and 292 transitions. [2018-11-10 07:50:42,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 07:50:42,618 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-11-10 07:50:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:50:42,621 INFO L225 Difference]: With dead ends: 250 [2018-11-10 07:50:42,621 INFO L226 Difference]: Without dead ends: 244 [2018-11-10 07:50:42,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2018-11-10 07:50:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-11-10 07:50:42,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 216. [2018-11-10 07:50:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-10 07:50:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2018-11-10 07:50:42,641 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 38 [2018-11-10 07:50:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:50:42,641 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2018-11-10 07:50:42,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 07:50:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2018-11-10 07:50:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 07:50:42,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:50:42,643 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-11-10 07:50:42,645 INFO L424 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:50:42,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:50:42,645 INFO L82 PathProgramCache]: Analyzing trace with hash -804495318, now seen corresponding path program 1 times [2018-11-10 07:50:42,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:50:42,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:42,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:50:42,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:42,647 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:50:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:50:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:50:42,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:50:42,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-10 07:50:42,985 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:50:42,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 07:50:42,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 07:50:42,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-11-10 07:50:42,986 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand 15 states. [2018-11-10 07:50:44,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:50:44,393 INFO L93 Difference]: Finished difference Result 355 states and 425 transitions. [2018-11-10 07:50:44,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 07:50:44,394 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-11-10 07:50:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:50:44,396 INFO L225 Difference]: With dead ends: 355 [2018-11-10 07:50:44,396 INFO L226 Difference]: Without dead ends: 352 [2018-11-10 07:50:44,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-11-10 07:50:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-11-10 07:50:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 317. [2018-11-10 07:50:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-10 07:50:44,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 380 transitions. [2018-11-10 07:50:44,429 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 380 transitions. Word has length 41 [2018-11-10 07:50:44,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:50:44,429 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 380 transitions. [2018-11-10 07:50:44,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 07:50:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 380 transitions. [2018-11-10 07:50:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:50:44,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:50:44,430 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-11-10 07:50:44,431 INFO L424 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:50:44,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:50:44,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1704057548, now seen corresponding path program 1 times [2018-11-10 07:50:44,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:50:44,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:44,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:50:44,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:44,434 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:50:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:50:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:50:44,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:50:44,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-10 07:50:44,773 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:50:44,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 07:50:44,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 07:50:44,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-11-10 07:50:44,774 INFO L87 Difference]: Start difference. First operand 317 states and 380 transitions. Second operand 15 states. [2018-11-10 07:50:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:50:45,899 INFO L93 Difference]: Finished difference Result 354 states and 423 transitions. [2018-11-10 07:50:45,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 07:50:45,899 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-11-10 07:50:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:50:45,900 INFO L225 Difference]: With dead ends: 354 [2018-11-10 07:50:45,900 INFO L226 Difference]: Without dead ends: 351 [2018-11-10 07:50:45,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2018-11-10 07:50:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-11-10 07:50:45,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 317. [2018-11-10 07:50:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-10 07:50:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 379 transitions. [2018-11-10 07:50:45,925 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 379 transitions. Word has length 45 [2018-11-10 07:50:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:50:45,926 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 379 transitions. [2018-11-10 07:50:45,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 07:50:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 379 transitions. [2018-11-10 07:50:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 07:50:45,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:50:45,927 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-11-10 07:50:45,927 INFO L424 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:50:45,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:50:45,927 INFO L82 PathProgramCache]: Analyzing trace with hash 730040884, now seen corresponding path program 1 times [2018-11-10 07:50:45,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:50:45,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:45,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:50:45,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:45,929 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:50:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:50:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:50:46,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:50:46,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-10 07:50:46,566 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:50:46,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 07:50:46,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 07:50:46,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-11-10 07:50:46,567 INFO L87 Difference]: Start difference. First operand 317 states and 379 transitions. Second operand 19 states. [2018-11-10 07:50:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:50:48,952 INFO L93 Difference]: Finished difference Result 379 states and 453 transitions. [2018-11-10 07:50:48,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 07:50:48,957 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-11-10 07:50:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:50:48,958 INFO L225 Difference]: With dead ends: 379 [2018-11-10 07:50:48,958 INFO L226 Difference]: Without dead ends: 376 [2018-11-10 07:50:48,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 07:50:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-11-10 07:50:48,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 348. [2018-11-10 07:50:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-11-10 07:50:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 418 transitions. [2018-11-10 07:50:48,994 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 418 transitions. Word has length 48 [2018-11-10 07:50:48,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:50:48,994 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 418 transitions. [2018-11-10 07:50:48,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 07:50:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 418 transitions. [2018-11-10 07:50:48,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 07:50:48,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:50:48,995 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-11-10 07:50:48,995 INFO L424 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:50:48,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:50:48,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1256067134, now seen corresponding path program 1 times [2018-11-10 07:50:48,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:50:48,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:48,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:50:48,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:48,997 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:50:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:50:49,491 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2018-11-10 07:50:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:50:49,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:50:49,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-10 07:50:49,629 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:50:49,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 07:50:49,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 07:50:49,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-11-10 07:50:49,630 INFO L87 Difference]: Start difference. First operand 348 states and 418 transitions. Second operand 16 states. [2018-11-10 07:50:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:50:51,232 INFO L93 Difference]: Finished difference Result 373 states and 445 transitions. [2018-11-10 07:50:51,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 07:50:51,233 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-11-10 07:50:51,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:50:51,234 INFO L225 Difference]: With dead ends: 373 [2018-11-10 07:50:51,234 INFO L226 Difference]: Without dead ends: 370 [2018-11-10 07:50:51,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2018-11-10 07:50:51,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-11-10 07:50:51,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 348. [2018-11-10 07:50:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-11-10 07:50:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 417 transitions. [2018-11-10 07:50:51,257 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 417 transitions. Word has length 51 [2018-11-10 07:50:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:50:51,257 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 417 transitions. [2018-11-10 07:50:51,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 07:50:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 417 transitions. [2018-11-10 07:50:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 07:50:51,258 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:50:51,258 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-11-10 07:50:51,258 INFO L424 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:50:51,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:50:51,259 INFO L82 PathProgramCache]: Analyzing trace with hash 755229644, now seen corresponding path program 1 times [2018-11-10 07:50:51,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:50:51,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:51,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:50:51,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:51,260 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:50:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:50:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:50:51,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:50:51,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-10 07:50:51,552 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:50:51,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 07:50:51,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 07:50:51,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-11-10 07:50:51,553 INFO L87 Difference]: Start difference. First operand 348 states and 417 transitions. Second operand 16 states. [2018-11-10 07:50:52,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:50:52,726 INFO L93 Difference]: Finished difference Result 372 states and 443 transitions. [2018-11-10 07:50:52,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 07:50:52,729 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-11-10 07:50:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:50:52,730 INFO L225 Difference]: With dead ends: 372 [2018-11-10 07:50:52,730 INFO L226 Difference]: Without dead ends: 369 [2018-11-10 07:50:52,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 07:50:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-10 07:50:52,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 348. [2018-11-10 07:50:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-11-10 07:50:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 416 transitions. [2018-11-10 07:50:52,752 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 416 transitions. Word has length 55 [2018-11-10 07:50:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:50:52,753 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 416 transitions. [2018-11-10 07:50:52,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 07:50:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 416 transitions. [2018-11-10 07:50:52,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 07:50:52,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:50:52,754 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-11-10 07:50:52,754 INFO L424 AbstractCegarLoop]: === Iteration 9 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:50:52,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:50:52,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1850540936, now seen corresponding path program 1 times [2018-11-10 07:50:52,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:50:52,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:52,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:50:52,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:52,756 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:50:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:50:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:50:53,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:50:53,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-10 07:50:53,204 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:50:53,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 07:50:53,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 07:50:53,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-11-10 07:50:53,204 INFO L87 Difference]: Start difference. First operand 348 states and 416 transitions. Second operand 17 states. [2018-11-10 07:50:54,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:50:54,789 INFO L93 Difference]: Finished difference Result 371 states and 441 transitions. [2018-11-10 07:50:54,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 07:50:54,790 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-11-10 07:50:54,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:50:54,792 INFO L225 Difference]: With dead ends: 371 [2018-11-10 07:50:54,792 INFO L226 Difference]: Without dead ends: 368 [2018-11-10 07:50:54,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2018-11-10 07:50:54,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-11-10 07:50:54,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 348. [2018-11-10 07:50:54,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-11-10 07:50:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 415 transitions. [2018-11-10 07:50:54,824 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 415 transitions. Word has length 58 [2018-11-10 07:50:54,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:50:54,824 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 415 transitions. [2018-11-10 07:50:54,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 07:50:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 415 transitions. [2018-11-10 07:50:54,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 07:50:54,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:50:54,825 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-11-10 07:50:54,825 INFO L424 AbstractCegarLoop]: === Iteration 10 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:50:54,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:50:54,826 INFO L82 PathProgramCache]: Analyzing trace with hash 399203020, now seen corresponding path program 1 times [2018-11-10 07:50:54,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:50:54,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:54,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:50:54,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:50:54,827 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:50:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:50:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:50:55,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:50:55,581 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:50:55,582 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-11-10 07:50:55,583 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-11-10 07:50:55,617 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:50:55,617 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:50:55,926 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 07:50:55,927 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-11-10 07:50:55,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:50:55,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 07:50:55,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:50:55,949 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/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-11-10 07:50:55,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:50:55,958 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 07:50:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:50:56,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:50:56,060 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-11-10 07:50:56,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,090 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-11-10 07:50:56,095 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-11-10 07:50:56,098 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,099 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-11-10 07:50:56,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,109 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,119 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-11-10 07:50:56,125 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-11-10 07:50:56,127 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,128 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-11-10 07:50:56,128 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,132 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,135 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,142 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-11-10 07:50:56,142 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-11-10 07:50:56,173 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-11-10 07:50:56,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,187 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-11-10 07:50:56,189 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,190 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-11-10 07:50:56,190 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,191 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,198 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-11-10 07:50:56,199 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-11-10 07:50:56,200 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,201 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,207 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:41, output treesize:13 [2018-11-10 07:50:56,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,259 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-11-10 07:50:56,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,264 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-11-10 07:50:56,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-11-10 07:50:56,372 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-11-10 07:50:56,390 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-11-10 07:50:56,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,428 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-11-10 07:50:56,433 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-11-10 07:50:56,437 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,438 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-11-10 07:50:56,438 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,451 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,497 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-11-10 07:50:56,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,503 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-11-10 07:50:56,504 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,540 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-11-10 07:50:56,541 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-10 07:50:56,578 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 07:50:56,664 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-11-10 07:50:56,668 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-11-10 07:50:56,668 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,708 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-11-10 07:50:56,712 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,713 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,722 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-11-10 07:50:56,723 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-10 07:50:56,787 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,789 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-11-10 07:50:56,789 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:56,850 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,851 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,853 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,859 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-11-10 07:50:56,860 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-10 07:50:56,938 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:56,941 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-11-10 07:50:56,942 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:57,008 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-10 07:50:57,087 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-10 07:50:57,222 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-11-10 07:50:57,224 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-11-10 07:50:57,224 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:57,231 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:50:57,235 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-11-10 07:50:57,237 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-11-10 07:50:57,237 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:57,244 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:50:57,384 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-11-10 07:50:57,387 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-11-10 07:50:57,387 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:57,424 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-11-10 07:50:57,425 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-10 07:50:57,445 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 07:50:57,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 07:50:57,519 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-11-10 07:50:57,526 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-11-10 07:50:57,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:57,532 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-11-10 07:50:57,532 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:57,541 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:50:57,595 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-11-10 07:50:57,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:57,599 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-11-10 07:50:57,600 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-10 07:50:57,625 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:57,625 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:57,634 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-11-10 07:50:57,635 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-11-10 07:50:57,669 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 07:50:57,755 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-11-10 07:50:57,757 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:57,769 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-11-10 07:50:57,769 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 4 xjuncts. [2018-11-10 07:50:57,793 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 07:50:57,929 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-11-10 07:50:57,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:50:58,135 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:50:58,136 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-11-10 07:50:58,139 INFO L168 Benchmark]: Toolchain (without parser) took 18408.59 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 382.7 MB). Free memory was 957.6 MB in the beginning and 921.0 MB in the end (delta: 36.6 MB). Peak memory consumption was 419.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:50:58,139 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:50:58,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:50:58,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:50:58,140 INFO L168 Benchmark]: Boogie Preprocessor took 33.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:50:58,141 INFO L168 Benchmark]: RCFGBuilder took 546.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:50:58,141 INFO L168 Benchmark]: TraceAbstraction took 17316.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 1.0 GB in the beginning and 921.0 MB in the end (delta: 121.0 MB). Peak memory consumption was 359.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:50:58,143 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 460.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 546.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17316.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 1.0 GB in the beginning and 921.0 MB in the end (delta: 121.0 MB). Peak memory consumption was 359.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-11-10 07:50:59,527 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:50:59,529 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:50:59,537 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:50:59,537 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:50:59,538 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:50:59,539 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:50:59,540 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:50:59,541 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:50:59,541 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:50:59,542 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:50:59,542 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:50:59,542 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:50:59,543 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:50:59,544 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:50:59,545 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:50:59,546 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:50:59,547 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:50:59,548 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:50:59,549 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:50:59,550 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:50:59,551 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:50:59,553 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:50:59,553 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:50:59,553 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:50:59,554 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:50:59,555 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:50:59,555 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:50:59,556 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:50:59,556 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:50:59,557 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:50:59,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:50:59,557 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:50:59,557 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:50:59,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:50:59,558 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:50:59,559 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 07:50:59,568 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:50:59,568 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:50:59,569 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:50:59,569 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 07:50:59,569 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 07:50:59,569 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 07:50:59,570 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 07:50:59,570 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 07:50:59,570 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:50:59,570 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:50:59,570 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:50:59,571 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:50:59,571 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:50:59,571 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:50:59,571 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:50:59,571 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 07:50:59,571 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 07:50:59,571 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:50:59,571 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:50:59,572 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:50:59,572 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:50:59,572 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:50:59,572 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:50:59,572 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:50:59,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:50:59,574 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:50:59,574 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:50:59,575 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:50:59,575 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 07:50:59,575 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:50:59,575 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 07:50:59,575 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 07:50:59,575 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_7f59642f-b27b-463b-b782-5fd48142d95b/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-11-10 07:50:59,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:50:59,613 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:50:59,615 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:50:59,616 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:50:59,617 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:50:59,617 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i [2018-11-10 07:50:59,660 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/data/9e0ace6ac/945f6505f1514927851a9d563009e089/FLAGc9caa7466 [2018-11-10 07:51:00,111 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:51:00,111 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/sv-benchmarks/c/heap-manipulation/bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i [2018-11-10 07:51:00,122 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/data/9e0ace6ac/945f6505f1514927851a9d563009e089/FLAGc9caa7466 [2018-11-10 07:51:00,131 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/bin-2019/utaipan/data/9e0ace6ac/945f6505f1514927851a9d563009e089 [2018-11-10 07:51:00,134 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:51:00,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:51:00,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:51:00,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:51:00,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:51:00,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:00" (1/1) ... [2018-11-10 07:51:00,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a131e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:00, skipping insertion in model container [2018-11-10 07:51:00,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:00" (1/1) ... [2018-11-10 07:51:00,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:51:00,183 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:51:00,487 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:51:00,495 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:51:00,541 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:51:00,601 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:51:00,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:00 WrapperNode [2018-11-10 07:51:00,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:51:00,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:51:00,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:51:00,602 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:51:00,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:00" (1/1) ... [2018-11-10 07:51:00,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:00" (1/1) ... [2018-11-10 07:51:00,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:51:00,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:51:00,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:51:00,697 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:51:00,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:00" (1/1) ... [2018-11-10 07:51:00,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:00" (1/1) ... [2018-11-10 07:51:00,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:00" (1/1) ... [2018-11-10 07:51:00,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:00" (1/1) ... [2018-11-10 07:51:00,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:00" (1/1) ... [2018-11-10 07:51:00,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:00" (1/1) ... [2018-11-10 07:51:00,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:00" (1/1) ... [2018-11-10 07:51:00,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:51:00,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:51:00,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:51:00,738 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:51:00,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/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-11-10 07:51:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2018-11-10 07:51:00,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2018-11-10 07:51:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2018-11-10 07:51:00,775 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-11-10 07:51:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2018-11-10 07:51:00,776 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2018-11-10 07:51:00,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:51:00,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:51:00,776 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-11-10 07:51:00,776 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-11-10 07:51:00,776 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2018-11-10 07:51:00,776 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-11-10 07:51:00,776 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2018-11-10 07:51:00,777 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-11-10 07:51:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2018-11-10 07:51:00,777 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2018-11-10 07:51:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-10 07:51:00,777 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-10 07:51:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-11-10 07:51:00,777 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-11-10 07:51:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2018-11-10 07:51:00,777 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2018-11-10 07:51:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:51:00,778 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:51:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2018-11-10 07:51:00,778 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2018-11-10 07:51:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2018-11-10 07:51:00,778 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2018-11-10 07:51:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:51:00,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:51:01,283 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:51:01,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:51:01 BoogieIcfgContainer [2018-11-10 07:51:01,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:51:01,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:51:01,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:51:01,287 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:51:01,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:51:00" (1/3) ... [2018-11-10 07:51:01,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418b28b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:51:01, skipping insertion in model container [2018-11-10 07:51:01,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:00" (2/3) ... [2018-11-10 07:51:01,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418b28b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:51:01, skipping insertion in model container [2018-11-10 07:51:01,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:51:01" (3/3) ... [2018-11-10 07:51:01,289 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux_false-unreach-call_false-valid-memcleanup.i [2018-11-10 07:51:01,295 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:51:01,300 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:51:01,308 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:51:01,329 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:51:01,329 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:51:01,329 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:51:01,329 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:51:01,329 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:51:01,330 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:51:01,330 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:51:01,330 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:51:01,330 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:51:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2018-11-10 07:51:01,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 07:51:01,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:51:01,348 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:51:01,349 INFO L424 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:51:01,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:01,353 INFO L82 PathProgramCache]: Analyzing trace with hash -914397588, now seen corresponding path program 1 times [2018-11-10 07:51:01,355 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 07:51:01,356 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/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-11-10 07:51:01,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:01,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:01,424 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 07:51:01,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:51:01,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:51:01,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 07:51:01,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:51:01,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:51:01,438 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 2 states. [2018-11-10 07:51:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:51:01,471 INFO L93 Difference]: Finished difference Result 298 states and 469 transitions. [2018-11-10 07:51:01,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:51:01,472 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-10 07:51:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:51:01,479 INFO L225 Difference]: With dead ends: 298 [2018-11-10 07:51:01,479 INFO L226 Difference]: Without dead ends: 138 [2018-11-10 07:51:01,482 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-11-10 07:51:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-10 07:51:01,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-10 07:51:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-10 07:51:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 159 transitions. [2018-11-10 07:51:01,516 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 159 transitions. Word has length 15 [2018-11-10 07:51:01,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:51:01,516 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 159 transitions. [2018-11-10 07:51:01,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 07:51:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 159 transitions. [2018-11-10 07:51:01,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 07:51:01,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:51:01,518 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-11-10 07:51:01,518 INFO L424 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:51:01,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:01,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1731062258, now seen corresponding path program 1 times [2018-11-10 07:51:01,519 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 07:51:01,519 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/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-11-10 07:51:01,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:01,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:01,650 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 (3)] Exception during sending of exit command (exit): Stream closed [2018-11-10 07:51:01,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:51:01,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:51:01,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:51:01,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:51:01,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:51:01,654 INFO L87 Difference]: Start difference. First operand 138 states and 159 transitions. Second operand 5 states. [2018-11-10 07:51:01,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:51:01,825 INFO L93 Difference]: Finished difference Result 140 states and 160 transitions. [2018-11-10 07:51:01,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:51:01,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-10 07:51:01,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:51:01,826 INFO L225 Difference]: With dead ends: 140 [2018-11-10 07:51:01,826 INFO L226 Difference]: Without dead ends: 137 [2018-11-10 07:51:01,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:51:01,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-10 07:51:01,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-11-10 07:51:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-10 07:51:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2018-11-10 07:51:01,839 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 34 [2018-11-10 07:51:01,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:51:01,841 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2018-11-10 07:51:01,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:51:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2018-11-10 07:51:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 07:51:01,843 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:51:01,843 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-11-10 07:51:01,843 INFO L424 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:51:01,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:01,843 INFO L82 PathProgramCache]: Analyzing trace with hash -656289715, now seen corresponding path program 1 times [2018-11-10 07:51:01,845 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 07:51:01,845 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/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-11-10 07:51:01,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:01,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:02,008 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-11-10 07:51:02,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:02,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:02,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 07:51:02,025 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-11-10 07:51:02,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:02,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:02,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-10 07:51:02,093 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-11-10 07:51:02,095 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-11-10 07:51:02,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:02,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:02,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:02,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-10 07:51:02,227 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-11-10 07:51:02,234 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-11-10 07:51:02,248 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-11-10 07:51:02,249 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 07:51:02,270 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 07:51:02,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:51:02,333 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:51:02,334 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-11-10 07:51:02,358 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-11-10 07:51:02,359 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-10 07:51:02,409 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 07:51:02,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 07:51:02,481 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-11-10 07:51:02,482 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:58 [2018-11-10 07:51:02,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:51:02,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:51:02,593 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-11-10 07:51:02,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:02,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:02,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:11 [2018-11-10 07:51:02,666 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-11-10 07:51:02,667 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-11-10 07:51:02,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:02,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:02,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:02,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-10 07:51:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:02,694 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 07:51:02,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:51:02,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-10 07:51:02,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 07:51:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 07:51:02,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-10 07:51:02,697 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 15 states. [2018-11-10 07:51:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:51:05,152 INFO L93 Difference]: Finished difference Result 249 states and 291 transitions. [2018-11-10 07:51:05,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 07:51:05,152 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-10 07:51:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:51:05,155 INFO L225 Difference]: With dead ends: 249 [2018-11-10 07:51:05,156 INFO L226 Difference]: Without dead ends: 243 [2018-11-10 07:51:05,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2018-11-10 07:51:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-10 07:51:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 215. [2018-11-10 07:51:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-11-10 07:51:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 253 transitions. [2018-11-10 07:51:05,178 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 253 transitions. Word has length 37 [2018-11-10 07:51:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:51:05,178 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 253 transitions. [2018-11-10 07:51:05,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 07:51:05,179 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 253 transitions. [2018-11-10 07:51:05,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:51:05,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:51:05,179 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-11-10 07:51:05,180 INFO L424 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:51:05,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:05,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1073322948, now seen corresponding path program 1 times [2018-11-10 07:51:05,180 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 07:51:05,180 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f59642f-b27b-463b-b782-5fd48142d95b/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-11-10 07:51:05,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:51:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:05,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:51:05,334 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-11-10 07:51:05,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:05,370 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-11-10 07:51:05,372 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-11-10 07:51:05,376 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:51:05,379 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-11-10 07:51:05,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:05,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:05,394 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:05,414 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-11-10 07:51:05,416 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-11-10 07:51:05,420 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:51:05,422 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-11-10 07:51:05,422 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:05,430 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:05,436 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:05,452 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-11-10 07:51:05,452 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:42, output treesize:23 [2018-11-10 07:51:05,463 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-11-10 07:51:05,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:05,473 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-11-10 07:51:05,475 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-11-10 07:51:05,476 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:05,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:05,485 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-11-10 07:51:05,487 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-11-10 07:51:05,487 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:05,488 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:05,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:05,493 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:34, output treesize:13 [2018-11-10 07:51:05,583 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-11-10 07:51:05,662 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-11-10 07:51:05,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:05,804 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-11-10 07:51:05,808 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-11-10 07:51:05,813 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:51:05,816 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-11-10 07:51:05,816 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:05,841 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:06,034 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-11-10 07:51:06,041 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:51:06,045 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:51:06,078 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-11-10 07:51:06,078 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-10 07:51:06,158 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 07:51:06,476 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:51:06,484 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-11-10 07:51:06,487 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-11-10 07:51:06,487 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:06,506 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:06,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:51:06,519 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-11-10 07:51:06,522 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-11-10 07:51:06,523 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:06,546 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:06,793 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-11-10 07:51:06,797 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-11-10 07:51:06,798 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:06,944 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-11-10 07:51:06,949 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:51:06,949 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-11-10 07:51:06,950 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:07,015 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:51:07,031 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-11-10 07:51:07,032 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-10 07:51:07,131 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 07:51:07,300 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 07:51:07,697 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-11-10 07:51:07,703 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-11-10 07:51:07,703 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:07,781 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:08,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 07:51:08,080 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-11-10 07:51:08,086 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-11-10 07:51:08,091 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:51:08,091 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-11-10 07:51:08,092 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:08,118 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:08,485 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 07:51:08,486 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-11-10 07:51:08,494 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:51:08,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, 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-11-10 07:51:08,498 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-10 07:51:08,525 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:51:08,899 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-11-10 07:51:08,906 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 07:51:09,107 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 07:51:09,108 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-11-10 07:51:09,110 INFO L168 Benchmark]: Toolchain (without parser) took 8975.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.6 MB). Free memory was 947.9 MB in the beginning and 807.3 MB in the end (delta: 140.6 MB). Peak memory consumption was 359.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:51:09,111 INFO L168 Benchmark]: CDTParser took 0.16 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-11-10 07:51:09,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.72 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 894.2 MB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:51:09,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 894.2 MB in the beginning and 1.1 GB in the end (delta: -237.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:51:09,112 INFO L168 Benchmark]: Boogie Preprocessor took 41.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:51:09,112 INFO L168 Benchmark]: RCFGBuilder took 545.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:51:09,112 INFO L168 Benchmark]: TraceAbstraction took 7824.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 807.3 MB in the end (delta: 265.9 MB). Peak memory consumption was 337.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:51:09,114 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.16 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 465.72 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 894.2 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 94.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 894.2 MB in the beginning and 1.1 GB in the end (delta: -237.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 545.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7824.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 807.3 MB in the end (delta: 265.9 MB). Peak memory consumption was 337.7 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...