./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/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 9a4ddf68ce78594ceb913525b55d91f3f2dce46f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/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 9a4ddf68ce78594ceb913525b55d91f3f2dce46f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_27 input size 11 context size 11 output size 11 --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:15:21,699 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:15:21,700 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:15:21,708 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:15:21,708 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:15:21,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:15:21,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:15:21,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:15:21,711 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:15:21,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:15:21,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:15:21,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:15:21,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:15:21,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:15:21,714 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:15:21,715 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:15:21,715 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:15:21,716 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:15:21,717 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:15:21,718 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:15:21,719 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:15:21,720 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:15:21,722 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:15:21,722 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:15:21,722 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:15:21,722 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:15:21,723 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:15:21,724 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:15:21,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:15:21,725 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:15:21,725 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:15:21,725 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:15:21,725 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:15:21,725 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:15:21,726 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:15:21,726 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:15:21,726 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:15:21,733 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:15:21,733 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:15:21,734 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:15:21,734 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:15:21,734 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:15:21,734 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:15:21,734 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:15:21,734 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:15:21,734 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:15:21,734 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:15:21,734 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:15:21,734 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:15:21,735 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:15:21,735 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:15:21,735 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:15:21,735 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:15:21,735 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:15:21,735 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:15:21,735 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:15:21,735 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:15:21,735 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:15:21,736 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:15:21,736 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:15:21,736 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:15:21,736 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:15:21,736 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:15:21,736 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:15:21,736 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:15:21,736 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:15:21,736 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:15:21,736 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:15:21,737 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:15:21,737 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:15:21,737 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:15:21,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:15:21,737 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:15:21,737 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_3b70d206-13b2-435c-9db7-100c81b08c37/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 -> 9a4ddf68ce78594ceb913525b55d91f3f2dce46f [2018-12-09 19:15:21,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:15:21,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:15:21,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:15:21,763 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:15:21,763 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:15:21,763 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-12-09 19:15:21,799 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/data/6a162c4d5/b30387769517499d9a0676a95a00dd38/FLAG33940d3dc [2018-12-09 19:15:22,296 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:15:22,297 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-12-09 19:15:22,304 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/data/6a162c4d5/b30387769517499d9a0676a95a00dd38/FLAG33940d3dc [2018-12-09 19:15:22,313 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/data/6a162c4d5/b30387769517499d9a0676a95a00dd38 [2018-12-09 19:15:22,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:15:22,316 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:15:22,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:15:22,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:15:22,318 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:15:22,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:15:22" (1/1) ... [2018-12-09 19:15:22,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb8ddb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:22, skipping insertion in model container [2018-12-09 19:15:22,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:15:22" (1/1) ... [2018-12-09 19:15:22,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:15:22,343 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:15:22,491 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:15:22,533 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:15:22,564 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:15:22,586 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:15:22,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:22 WrapperNode [2018-12-09 19:15:22,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:15:22,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:15:22,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:15:22,587 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:15:22,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:22" (1/1) ... [2018-12-09 19:15:22,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:22" (1/1) ... [2018-12-09 19:15:22,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:15:22,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:15:22,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:15:22,605 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:15:22,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:22" (1/1) ... [2018-12-09 19:15:22,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:22" (1/1) ... [2018-12-09 19:15:22,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:22" (1/1) ... [2018-12-09 19:15:22,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:22" (1/1) ... [2018-12-09 19:15:22,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:22" (1/1) ... [2018-12-09 19:15:22,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:22" (1/1) ... [2018-12-09 19:15:22,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:22" (1/1) ... [2018-12-09 19:15:22,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:15:22,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:15:22,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:15:22,629 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:15:22,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/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-12-09 19:15:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:15:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 19:15:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:15:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure receive [2018-12-09 19:15:22,660 INFO L138 BoogieDeclarations]: Found implementation of procedure receive [2018-12-09 19:15:22,660 INFO L130 BoogieDeclarations]: Found specification of procedure process_prio_queue [2018-12-09 19:15:22,660 INFO L138 BoogieDeclarations]: Found implementation of procedure process_prio_queue [2018-12-09 19:15:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:15:22,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:15:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2018-12-09 19:15:22,661 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2018-12-09 19:15:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:15:22,661 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:15:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 19:15:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 19:15:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2018-12-09 19:15:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure send [2018-12-09 19:15:22,661 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2018-12-09 19:15:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:15:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 19:15:22,661 INFO L130 BoogieDeclarations]: Found specification of procedure process_normal_queue [2018-12-09 19:15:22,662 INFO L138 BoogieDeclarations]: Found implementation of procedure process_normal_queue [2018-12-09 19:15:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 19:15:22,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:15:22,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:15:22,922 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:15:22,922 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-09 19:15:22,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:15:22 BoogieIcfgContainer [2018-12-09 19:15:22,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:15:22,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:15:22,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:15:22,926 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:15:22,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:15:22" (1/3) ... [2018-12-09 19:15:22,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355638e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:15:22, skipping insertion in model container [2018-12-09 19:15:22,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:22" (2/3) ... [2018-12-09 19:15:22,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355638e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:15:22, skipping insertion in model container [2018-12-09 19:15:22,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:15:22" (3/3) ... [2018-12-09 19:15:22,928 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter_true-unreach-call.i [2018-12-09 19:15:22,934 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:15:22,939 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-09 19:15:22,948 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-09 19:15:22,967 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:15:22,967 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:15:22,967 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:15:22,967 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:15:22,967 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:15:22,968 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:15:22,968 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:15:22,968 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:15:22,979 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-12-09 19:15:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 19:15:22,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:15:22,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:15:22,985 INFO L423 AbstractCegarLoop]: === Iteration 1 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:15:22,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:15:22,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1336356447, now seen corresponding path program 1 times [2018-12-09 19:15:22,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:15:23,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:15:23,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:15:23,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:15:23,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:15:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:15:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:15:23,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:15:23,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:15:23,070 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:15:23,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 19:15:23,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 19:15:23,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 19:15:23,082 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-12-09 19:15:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:15:23,097 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2018-12-09 19:15:23,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 19:15:23,098 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-12-09 19:15:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:15:23,103 INFO L225 Difference]: With dead ends: 100 [2018-12-09 19:15:23,103 INFO L226 Difference]: Without dead ends: 57 [2018-12-09 19:15:23,105 INFO L631 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-12-09 19:15:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-09 19:15:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-09 19:15:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 19:15:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-12-09 19:15:23,130 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 14 [2018-12-09 19:15:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:15:23,130 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-12-09 19:15:23,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 19:15:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-12-09 19:15:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 19:15:23,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:15:23,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:15:23,131 INFO L423 AbstractCegarLoop]: === Iteration 2 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:15:23,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:15:23,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1073629961, now seen corresponding path program 1 times [2018-12-09 19:15:23,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:15:23,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:15:23,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:15:23,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:15:23,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:15:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:15:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:15:23,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:15:23,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:15:23,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:15:23,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:15:23,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:15:23,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:15:23,164 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 3 states. [2018-12-09 19:15:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:15:23,175 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-12-09 19:15:23,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:15:23,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-09 19:15:23,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:15:23,176 INFO L225 Difference]: With dead ends: 60 [2018-12-09 19:15:23,176 INFO L226 Difference]: Without dead ends: 58 [2018-12-09 19:15:23,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:15:23,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-09 19:15:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-09 19:15:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 19:15:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2018-12-09 19:15:23,182 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 15 [2018-12-09 19:15:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:15:23,182 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-12-09 19:15:23,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:15:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-12-09 19:15:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 19:15:23,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:15:23,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:15:23,182 INFO L423 AbstractCegarLoop]: === Iteration 3 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:15:23,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:15:23,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1073628039, now seen corresponding path program 1 times [2018-12-09 19:15:23,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:15:23,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:15:23,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:15:23,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:15:23,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:15:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:15:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:15:23,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:15:23,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:15:23,231 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:15:23,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:15:23,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:15:23,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:15:23,231 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 6 states. [2018-12-09 19:15:23,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:15:23,314 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2018-12-09 19:15:23,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:15:23,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-09 19:15:23,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:15:23,317 INFO L225 Difference]: With dead ends: 95 [2018-12-09 19:15:23,317 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 19:15:23,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:15:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 19:15:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-12-09 19:15:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 19:15:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-12-09 19:15:23,327 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 15 [2018-12-09 19:15:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:15:23,327 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-12-09 19:15:23,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:15:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-12-09 19:15:23,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 19:15:23,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:15:23,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:15:23,328 INFO L423 AbstractCegarLoop]: === Iteration 4 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:15:23,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:15:23,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1587868396, now seen corresponding path program 1 times [2018-12-09 19:15:23,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:15:23,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:15:23,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:15:23,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:15:23,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:15:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:15:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:15:23,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:15:23,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:15:23,390 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:15:23,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:15:23,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:15:23,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:15:23,391 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 7 states. [2018-12-09 19:15:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:15:23,609 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-12-09 19:15:23,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:15:23,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-09 19:15:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:15:23,610 INFO L225 Difference]: With dead ends: 100 [2018-12-09 19:15:23,611 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 19:15:23,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:15:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 19:15:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2018-12-09 19:15:23,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 19:15:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-12-09 19:15:23,618 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 21 [2018-12-09 19:15:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:15:23,618 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-12-09 19:15:23,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:15:23,619 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-12-09 19:15:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 19:15:23,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:15:23,619 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:15:23,620 INFO L423 AbstractCegarLoop]: === Iteration 5 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:15:23,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:15:23,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1982739994, now seen corresponding path program 1 times [2018-12-09 19:15:23,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:15:23,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:15:23,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:15:23,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:15:23,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:15:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:15:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:15:23,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:15:23,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:15:23,906 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-09 19:15:23,907 INFO L205 CegarAbsIntRunner]: [0], [3], [7], [8], [9], [17], [22], [26], [27], [43], [48], [51], [53], [55], [77], [79], [83], [89], [90], [130], [131], [138], [142], [143], [144] [2018-12-09 19:15:23,927 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:15:23,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:15:24,026 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:15:24,027 INFO L272 AbstractInterpreter]: Visited 25 different actions 25 times. Never merged. Never widened. Performed 218 root evaluator evaluations with a maximum evaluation depth of 3. Performed 218 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-12-09 19:15:24,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:15:24,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:15:24,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:15:24,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/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-12-09 19:15:24,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:15:24,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:15:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:15:24,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:15:24,095 INFO L478 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 9 treesize of output 12 [2018-12-09 19:15:24,100 INFO L478 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 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:15:24,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:24,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:24,110 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-12-09 19:15:24,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-12-09 19:15:24,118 INFO L478 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 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:15:24,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:24,124 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-12-09 19:15:24,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2018-12-09 19:15:24,152 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:24,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:24,181 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:24,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:24,205 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:24,209 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:24,222 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:24,225 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:24,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:24,232 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-09 19:15:28,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:28,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:28,272 INFO L478 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 11 treesize of output 4 [2018-12-09 19:15:28,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,291 INFO L478 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 29 treesize of output 30 [2018-12-09 19:15:28,295 INFO L478 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 18 treesize of output 21 [2018-12-09 19:15:28,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:28,301 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-09 19:15:28,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:28,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:28,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:28,314 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-09 19:15:28,315 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,325 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,341 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,365 INFO L478 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 29 treesize of output 30 [2018-12-09 19:15:28,367 INFO L478 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 18 treesize of output 21 [2018-12-09 19:15:28,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:28,371 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-09 19:15:28,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:28,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:28,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:28,377 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-09 19:15:28,378 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,384 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,391 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,397 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,407 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 11 variables, input treesize:67, output treesize:15 [2018-12-09 19:15:28,417 INFO L478 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-12-09 19:15:28,419 INFO L478 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-12-09 19:15:28,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,424 INFO L478 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-12-09 19:15:28,425 INFO L478 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-12-09 19:15:28,426 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,429 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-09 19:15:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:15:28,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:15:28,774 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-12-09 19:15:28,777 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:28,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:28,790 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:28,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:28,803 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,816 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:28,817 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:28,830 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:29,228 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,238 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,239 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,246 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,247 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,256 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,257 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,266 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,541 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,554 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,555 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,567 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,568 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,578 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,782 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:29,793 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:29,794 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,804 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:29,805 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:29,814 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:30,053 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,068 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,069 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,080 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,082 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,096 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,097 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,109 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,222 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:30,228 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:30,229 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,236 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,237 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:30,243 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:30,328 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:30,334 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:30,335 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:30,339 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:30,340 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,345 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,346 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:30,351 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:30,411 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,415 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,416 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,420 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,421 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,424 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:30,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 8 dim-2 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-12-09 19:15:30,483 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 14 variables, input treesize:193, output treesize:158 [2018-12-09 19:15:30,552 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-12-09 19:15:46,806 WARN L180 SmtUtils]: Spent 6.02 s on a formula simplification that was a NOOP. DAG size: 102 [2018-12-09 19:15:46,816 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-12-09 19:15:46,824 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-12-09 19:15:46,984 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2018-12-09 19:15:47,186 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:15:47,187 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:217) 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.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.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) 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:214) 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:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-09 19:15:47,194 INFO L168 Benchmark]: Toolchain (without parser) took 24878.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:15:47,196 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:15:47,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -136.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-09 19:15:47,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:15:47,200 INFO L168 Benchmark]: Boogie Preprocessor took 22.94 ms. Allocated memory is still 1.1 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-12-09 19:15:47,202 INFO L168 Benchmark]: RCFGBuilder took 293.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:15:47,203 INFO L168 Benchmark]: TraceAbstraction took 24269.80 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 32.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -66.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:15:47,212 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -136.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.94 ms. Allocated memory is still 1.1 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 293.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24269.80 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 32.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -66.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:15:48,524 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:15:48,525 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:15:48,531 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:15:48,531 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:15:48,531 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:15:48,532 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:15:48,533 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:15:48,534 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:15:48,534 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:15:48,535 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:15:48,535 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:15:48,535 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:15:48,536 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:15:48,536 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:15:48,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:15:48,537 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:15:48,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:15:48,539 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:15:48,539 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:15:48,540 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:15:48,540 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:15:48,542 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:15:48,542 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:15:48,542 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:15:48,542 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:15:48,543 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:15:48,543 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:15:48,543 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:15:48,544 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:15:48,544 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:15:48,544 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:15:48,544 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:15:48,545 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:15:48,545 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:15:48,545 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:15:48,545 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 19:15:48,553 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:15:48,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:15:48,553 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:15:48,553 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:15:48,554 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:15:48,554 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:15:48,554 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:15:48,554 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:15:48,554 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:15:48,554 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:15:48,554 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:15:48,554 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:15:48,555 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:15:48,555 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:15:48,555 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:15:48,555 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:15:48,555 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:15:48,555 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 19:15:48,555 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 19:15:48,555 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:15:48,555 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:15:48,555 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 19:15:48,555 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:15:48,556 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:15:48,556 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:15:48,556 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:15:48,556 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:15:48,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:15:48,556 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:15:48,556 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:15:48,556 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:15:48,556 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 19:15:48,556 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:15:48,556 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 19:15:48,557 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 19:15:48,557 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_3b70d206-13b2-435c-9db7-100c81b08c37/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 -> 9a4ddf68ce78594ceb913525b55d91f3f2dce46f [2018-12-09 19:15:48,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:15:48,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:15:48,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:15:48,584 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:15:48,584 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:15:48,584 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-12-09 19:15:48,619 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/data/902916418/6c18d15a06994ff5ba154ba80e6a8bba/FLAG932384cf2 [2018-12-09 19:15:49,042 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:15:49,043 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-12-09 19:15:49,049 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/data/902916418/6c18d15a06994ff5ba154ba80e6a8bba/FLAG932384cf2 [2018-12-09 19:15:49,057 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/data/902916418/6c18d15a06994ff5ba154ba80e6a8bba [2018-12-09 19:15:49,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:15:49,060 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:15:49,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:15:49,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:15:49,064 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:15:49,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:15:49" (1/1) ... [2018-12-09 19:15:49,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1e626f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:49, skipping insertion in model container [2018-12-09 19:15:49,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:15:49" (1/1) ... [2018-12-09 19:15:49,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:15:49,099 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:15:49,265 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:15:49,273 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:15:49,347 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:15:49,370 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:15:49,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:49 WrapperNode [2018-12-09 19:15:49,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:15:49,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:15:49,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:15:49,371 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:15:49,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:49" (1/1) ... [2018-12-09 19:15:49,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:49" (1/1) ... [2018-12-09 19:15:49,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:15:49,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:15:49,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:15:49,391 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:15:49,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:49" (1/1) ... [2018-12-09 19:15:49,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:49" (1/1) ... [2018-12-09 19:15:49,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:49" (1/1) ... [2018-12-09 19:15:49,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:49" (1/1) ... [2018-12-09 19:15:49,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:49" (1/1) ... [2018-12-09 19:15:49,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:49" (1/1) ... [2018-12-09 19:15:49,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:49" (1/1) ... [2018-12-09 19:15:49,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:15:49,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:15:49,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:15:49,416 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:15:49,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/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-12-09 19:15:49,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:15:49,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 19:15:49,446 INFO L130 BoogieDeclarations]: Found specification of procedure receive [2018-12-09 19:15:49,446 INFO L138 BoogieDeclarations]: Found implementation of procedure receive [2018-12-09 19:15:49,446 INFO L130 BoogieDeclarations]: Found specification of procedure process_prio_queue [2018-12-09 19:15:49,446 INFO L138 BoogieDeclarations]: Found implementation of procedure process_prio_queue [2018-12-09 19:15:49,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:15:49,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:15:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2018-12-09 19:15:49,447 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2018-12-09 19:15:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:15:49,447 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:15:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 19:15:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 19:15:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2018-12-09 19:15:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure send [2018-12-09 19:15:49,447 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2018-12-09 19:15:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:15:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-09 19:15:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 19:15:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-12-09 19:15:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure process_normal_queue [2018-12-09 19:15:49,447 INFO L138 BoogieDeclarations]: Found implementation of procedure process_normal_queue [2018-12-09 19:15:49,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:15:49,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:15:51,749 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:15:51,749 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-09 19:15:51,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:15:51 BoogieIcfgContainer [2018-12-09 19:15:51,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:15:51,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:15:51,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:15:51,752 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:15:51,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:15:49" (1/3) ... [2018-12-09 19:15:51,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cb0cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:15:51, skipping insertion in model container [2018-12-09 19:15:51,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:15:49" (2/3) ... [2018-12-09 19:15:51,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cb0cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:15:51, skipping insertion in model container [2018-12-09 19:15:51,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:15:51" (3/3) ... [2018-12-09 19:15:51,754 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter_true-unreach-call.i [2018-12-09 19:15:51,759 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:15:51,764 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-09 19:15:51,773 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-09 19:15:51,790 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 19:15:51,790 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:15:51,790 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:15:51,791 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:15:51,791 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:15:51,791 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:15:51,791 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:15:51,791 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:15:51,791 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:15:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-12-09 19:15:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 19:15:51,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:15:51,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:15:51,806 INFO L423 AbstractCegarLoop]: === Iteration 1 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:15:51,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:15:51,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1331955837, now seen corresponding path program 1 times [2018-12-09 19:15:51,812 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:15:51,812 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:15:51,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:15:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:15:51,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:15:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:15:51,873 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:15:51,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:15:51,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:15:51,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 19:15:51,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 19:15:51,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 19:15:51,892 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2018-12-09 19:15:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:15:51,907 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2018-12-09 19:15:51,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 19:15:51,909 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-12-09 19:15:51,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:15:51,917 INFO L225 Difference]: With dead ends: 99 [2018-12-09 19:15:51,917 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 19:15:51,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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-12-09 19:15:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 19:15:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-09 19:15:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 19:15:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2018-12-09 19:15:51,946 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 14 [2018-12-09 19:15:51,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:15:51,946 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-12-09 19:15:51,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 19:15:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-12-09 19:15:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 19:15:51,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:15:51,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:15:51,947 INFO L423 AbstractCegarLoop]: === Iteration 2 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:15:51,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:15:51,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2076658335, now seen corresponding path program 1 times [2018-12-09 19:15:51,948 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:15:51,948 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:15:51,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:15:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:15:51,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:15:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:15:51,989 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:15:51,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:15:51,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:15:51,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:15:51,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:15:51,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:15:51,992 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 3 states. [2018-12-09 19:15:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:15:52,004 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-12-09 19:15:52,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:15:52,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-09 19:15:52,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:15:52,005 INFO L225 Difference]: With dead ends: 59 [2018-12-09 19:15:52,005 INFO L226 Difference]: Without dead ends: 57 [2018-12-09 19:15:52,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:15:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-09 19:15:52,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-09 19:15:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 19:15:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-12-09 19:15:52,011 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 14 [2018-12-09 19:15:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:15:52,011 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-12-09 19:15:52,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:15:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-12-09 19:15:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 19:15:52,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:15:52,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:15:52,012 INFO L423 AbstractCegarLoop]: === Iteration 3 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:15:52,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:15:52,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2076656413, now seen corresponding path program 1 times [2018-12-09 19:15:52,013 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:15:52,013 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:15:52,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:15:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:15:52,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:15:52,090 INFO L478 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-12-09 19:15:52,093 INFO L478 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-12-09 19:15:52,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:52,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:52,108 INFO L478 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-12-09 19:15:52,111 INFO L478 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-12-09 19:15:52,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:52,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:52,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:52,117 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-09 19:15:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:15:52,148 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:15:52,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:15:52,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:15:52,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:15:52,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:15:52,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:15:52,150 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 6 states. [2018-12-09 19:15:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:15:54,361 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2018-12-09 19:15:54,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:15:54,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-09 19:15:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:15:54,364 INFO L225 Difference]: With dead ends: 93 [2018-12-09 19:15:54,364 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 19:15:54,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:15:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 19:15:54,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-12-09 19:15:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 19:15:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-12-09 19:15:54,372 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 14 [2018-12-09 19:15:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:15:54,372 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-12-09 19:15:54,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:15:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-12-09 19:15:54,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 19:15:54,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:15:54,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:15:54,373 INFO L423 AbstractCegarLoop]: === Iteration 4 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:15:54,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:15:54,373 INFO L82 PathProgramCache]: Analyzing trace with hash 644197206, now seen corresponding path program 1 times [2018-12-09 19:15:54,374 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:15:54,374 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:15:54,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:15:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:15:54,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:15:54,445 INFO L478 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-12-09 19:15:54,447 INFO L478 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-12-09 19:15:54,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:54,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:54,457 INFO L478 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-12-09 19:15:54,459 INFO L478 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-12-09 19:15:54,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:54,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:54,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:54,464 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-09 19:15:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:15:54,495 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:15:54,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:15:54,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:15:54,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:15:54,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:15:54,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:15:54,498 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 7 states. [2018-12-09 19:15:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:15:56,978 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2018-12-09 19:15:56,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:15:56,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-09 19:15:56,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:15:56,980 INFO L225 Difference]: With dead ends: 98 [2018-12-09 19:15:56,980 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 19:15:56,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:15:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 19:15:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 58. [2018-12-09 19:15:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 19:15:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2018-12-09 19:15:56,985 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 20 [2018-12-09 19:15:56,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:15:56,985 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-12-09 19:15:56,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:15:56,985 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-12-09 19:15:56,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 19:15:56,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:15:56,986 INFO L402 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] [2018-12-09 19:15:56,986 INFO L423 AbstractCegarLoop]: === Iteration 5 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:15:56,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:15:56,986 INFO L82 PathProgramCache]: Analyzing trace with hash -309506550, now seen corresponding path program 1 times [2018-12-09 19:15:56,986 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:15:56,987 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:15:57,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:15:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:15:57,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:15:57,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:57,111 INFO L478 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 15 treesize of output 27 [2018-12-09 19:15:57,115 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:15:57,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:57,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:15:57,138 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-12-09 19:15:57,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-12-09 19:15:57,160 INFO L478 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 21 treesize of output 20 [2018-12-09 19:15:57,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:57,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:57,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-12-09 19:15:57,230 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:57,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:57,494 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:57,524 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:57,619 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:57,633 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:57,699 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:57,710 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:57,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-09 19:15:57,747 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-09 19:15:59,756 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_receive_~#packet~0.base_4| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_receive_#t~ret5.base_4| (_ BitVec 32)) (|v_receive_#t~ret5.offset_4| (_ BitVec 32)) (|v_receive_~#packet~0.offset_4| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse0 (bvadd |v_receive_~#packet~0.offset_4| (_ bv4 32))) (.cse1 (bvadd |v_receive_~#packet~0.offset_4| (_ bv8 32)))) (and (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_4) .cse1 |v_receive_#t~ret5.offset_4|)) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| |v_receive_~#packet~0.base_4|)) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_8) .cse0 v_DerPreprocessor_6) .cse1 |v_receive_#t~ret5.base_4|)) |c_#memory_$Pointer$.base|)))) is different from true [2018-12-09 19:15:59,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:59,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:59,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:59,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-09 19:15:59,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:59,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 19:15:59,902 INFO L478 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 18 treesize of output 21 [2018-12-09 19:15:59,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:59,920 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-09 19:15:59,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:59,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:59,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:15:59,953 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-09 19:15:59,954 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:15:59,989 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:00,020 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:00,054 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:00,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 19:16:00,139 INFO L478 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 18 treesize of output 21 [2018-12-09 19:16:00,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:00,153 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-09 19:16:00,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:00,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:00,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:00,181 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-09 19:16:00,181 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:00,207 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:00,226 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:00,250 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:00,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:00,319 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:78, output treesize:15 [2018-12-09 19:16:00,343 INFO L478 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-12-09 19:16:00,346 INFO L478 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-12-09 19:16:00,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:00,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:00,355 INFO L478 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-12-09 19:16:00,356 INFO L478 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-12-09 19:16:00,357 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:00,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:00,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:00,361 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-09 19:16:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:16:00,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:16:00,829 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-09 19:16:01,228 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-09 19:16:01,948 WARN L180 SmtUtils]: Spent 717.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-09 19:16:02,625 WARN L180 SmtUtils]: Spent 675.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 19:16:06,073 WARN L180 SmtUtils]: Spent 3.44 s on a formula simplification that was a NOOP. DAG size: 109 [2018-12-09 19:16:06,075 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:06,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:06,150 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:06,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:06,219 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:06,295 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:06,296 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:06,394 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:12,447 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:12,541 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:12,542 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:12,622 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:12,623 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:12,737 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:18,910 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:18,970 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:18,971 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:19,009 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:19,010 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:19,050 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:22,098 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:22,133 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:22,134 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:22,176 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:22,177 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:22,214 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:22,215 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:22,256 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:23,405 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:23,431 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:23,432 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:23,452 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:23,453 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:23,477 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:24,356 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:24,378 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:24,379 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:24,392 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:24,393 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:24,407 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:24,911 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:24,947 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:24,948 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:24,969 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:24,970 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:24,993 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:25,303 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:25,321 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:25,322 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:25,333 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:25,334 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:25,347 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:25,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 8 dim-2 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2018-12-09 19:16:25,567 INFO L202 ElimStorePlain]: Needed 53 recursive calls to eliminate 14 variables, input treesize:193, output treesize:131 [2018-12-09 19:16:27,701 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2018-12-09 19:16:27,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:16:27,704 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:16:27,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:16:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:16:27,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:16:27,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:27,754 INFO L478 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 15 treesize of output 27 [2018-12-09 19:16:27,757 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-09 19:16:27,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:27,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:27,772 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-12-09 19:16:27,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-12-09 19:16:27,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:27,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:27,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:27,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-12-09 19:16:27,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:27,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:27,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:46 [2018-12-09 19:16:27,841 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:27,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:28,105 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:28,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:28,234 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:28,249 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:28,333 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:28,343 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:28,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:28,380 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-09 19:16:30,390 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_receive_~#packet~0.base_11| (_ BitVec 32)) (v_DerPreprocessor_64 (_ BitVec 32)) (|v_receive_#t~ret5.base_11| (_ BitVec 32)) (|v_receive_~#packet~0.offset_11| (_ BitVec 32)) (v_DerPreprocessor_62 (_ BitVec 32)) (v_DerPreprocessor_68 (_ BitVec 32)) (|v_receive_#t~ret5.offset_11| (_ BitVec 32)) (v_DerPreprocessor_66 (_ BitVec 32))) (let ((.cse0 (bvadd |v_receive_~#packet~0.offset_11| (_ bv4 32))) (.cse1 (bvadd |v_receive_~#packet~0.offset_11| (_ bv8 32)))) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_11|) (_ bv0 1)) (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_11| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_11|) |v_receive_~#packet~0.offset_11| v_DerPreprocessor_66) .cse0 v_DerPreprocessor_68) .cse1 |v_receive_#t~ret5.offset_11|)) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_11| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_11|) |v_receive_~#packet~0.offset_11| v_DerPreprocessor_62) .cse0 v_DerPreprocessor_64) .cse1 |v_receive_#t~ret5.base_11|)) |c_#memory_$Pointer$.base|)))) is different from true [2018-12-09 19:16:30,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:30,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:30,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:30,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:30,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-12-09 19:16:30,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:30,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 19:16:30,586 INFO L478 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 18 treesize of output 21 [2018-12-09 19:16:30,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:30,603 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-09 19:16:30,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:30,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:30,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:30,643 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-09 19:16:30,643 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:30,682 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:30,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:30,740 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:30,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 19:16:30,864 INFO L478 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 18 treesize of output 21 [2018-12-09 19:16:30,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:30,879 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-09 19:16:30,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:30,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:30,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:16:30,908 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-09 19:16:30,908 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:30,938 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:30,963 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:30,998 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:31,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:31,071 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:93, output treesize:15 [2018-12-09 19:16:31,075 INFO L478 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-12-09 19:16:31,076 INFO L478 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-12-09 19:16:31,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:31,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:31,085 INFO L478 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-12-09 19:16:31,086 INFO L478 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-12-09 19:16:31,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:31,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:31,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:31,090 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-09 19:16:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:16:31,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:16:31,582 WARN L180 SmtUtils]: Spent 487.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-09 19:16:32,009 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-09 19:16:32,816 WARN L180 SmtUtils]: Spent 806.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-09 19:16:33,367 WARN L180 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 19:16:36,516 WARN L180 SmtUtils]: Spent 3.14 s on a formula simplification that was a NOOP. DAG size: 107 [2018-12-09 19:16:36,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:36,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:36,600 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:36,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:36,687 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:36,756 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:36,757 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:36,829 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:41,731 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:41,821 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:41,822 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:41,899 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:41,900 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:41,984 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:46,719 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:46,760 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:46,761 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:46,791 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:46,792 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:46,827 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:49,515 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:49,558 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:49,559 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:49,625 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:49,626 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:49,669 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:50,816 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:50,845 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:50,846 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:50,872 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:50,873 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:50,905 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:51,892 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:51,904 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:51,905 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:51,915 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:51,916 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:51,933 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:16:52,489 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:52,511 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:52,512 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:52,531 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:52,532 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:52,559 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:52,847 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:52,865 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:52,866 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:52,881 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:52,882 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-09 19:16:52,895 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:16:53,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 8 dim-2 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2018-12-09 19:16:53,129 INFO L202 ElimStorePlain]: Needed 51 recursive calls to eliminate 14 variables, input treesize:193, output treesize:131 [2018-12-09 19:16:53,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:16:53,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2018-12-09 19:16:53,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:16:53,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:16:53,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2018-12-09 19:16:53,242 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 12 states. [2018-12-09 19:16:55,845 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_receive_~#packet~0.base_11| (_ BitVec 32)) (v_DerPreprocessor_64 (_ BitVec 32)) (|v_receive_#t~ret5.base_11| (_ BitVec 32)) (|v_receive_~#packet~0.offset_11| (_ BitVec 32)) (v_DerPreprocessor_62 (_ BitVec 32)) (v_DerPreprocessor_68 (_ BitVec 32)) (|v_receive_#t~ret5.offset_11| (_ BitVec 32)) (v_DerPreprocessor_66 (_ BitVec 32))) (let ((.cse0 (bvadd |v_receive_~#packet~0.offset_11| (_ bv4 32))) (.cse1 (bvadd |v_receive_~#packet~0.offset_11| (_ bv8 32)))) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_11|) (_ bv0 1)) (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_11| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_11|) |v_receive_~#packet~0.offset_11| v_DerPreprocessor_66) .cse0 v_DerPreprocessor_68) .cse1 |v_receive_#t~ret5.offset_11|)) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_11| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_11|) |v_receive_~#packet~0.offset_11| v_DerPreprocessor_62) .cse0 v_DerPreprocessor_64) .cse1 |v_receive_#t~ret5.base_11|)) |c_#memory_$Pointer$.base|)))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_receive_~#packet~0.base_4| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_receive_#t~ret5.base_4| (_ BitVec 32)) (|v_receive_#t~ret5.offset_4| (_ BitVec 32)) (|v_receive_~#packet~0.offset_4| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse2 (bvadd |v_receive_~#packet~0.offset_4| (_ bv4 32))) (.cse3 (bvadd |v_receive_~#packet~0.offset_4| (_ bv8 32)))) (and (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_2) .cse2 v_DerPreprocessor_4) .cse3 |v_receive_#t~ret5.offset_4|)) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| |v_receive_~#packet~0.base_4|)) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_8) .cse2 v_DerPreprocessor_6) .cse3 |v_receive_#t~ret5.base_4|)) |c_#memory_$Pointer$.base|))))) is different from true [2018-12-09 19:17:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:08,688 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2018-12-09 19:17:08,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:17:08,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-12-09 19:17:08,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:08,689 INFO L225 Difference]: With dead ends: 121 [2018-12-09 19:17:08,689 INFO L226 Difference]: Without dead ends: 94 [2018-12-09 19:17:08,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=49, Invalid=170, Unknown=3, NotChecked=84, Total=306 [2018-12-09 19:17:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-09 19:17:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 69. [2018-12-09 19:17:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 19:17:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2018-12-09 19:17:08,695 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 24 [2018-12-09 19:17:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:08,695 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2018-12-09 19:17:08,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:17:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2018-12-09 19:17:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:17:08,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:08,696 INFO L402 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] [2018-12-09 19:17:08,696 INFO L423 AbstractCegarLoop]: === Iteration 6 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:17:08,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:08,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1333878491, now seen corresponding path program 1 times [2018-12-09 19:17:08,696 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:17:08,696 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:17:08,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:08,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:08,816 INFO L478 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 18 treesize of output 15 [2018-12-09 19:17:08,818 INFO L478 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 15 treesize of output 18 [2018-12-09 19:17:08,821 INFO L478 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 18 treesize of output 7 [2018-12-09 19:17:08,821 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:08,823 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:08,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:08,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:08,829 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2018-12-09 19:17:08,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-09 19:17:08,871 INFO L478 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 22 treesize of output 15 [2018-12-09 19:17:08,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:08,882 INFO L478 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 15 treesize of output 8 [2018-12-09 19:17:08,882 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:08,892 INFO L478 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-12-09 19:17:08,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:08,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:08,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:08,896 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-12-09 19:17:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:08,904 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 19:17:08,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:17:08,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:17:08,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:17:08,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:17:08,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:17:08,907 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 9 states. [2018-12-09 19:17:10,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:17:10,396 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions. [2018-12-09 19:17:10,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:17:10,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-12-09 19:17:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:17:10,401 INFO L225 Difference]: With dead ends: 133 [2018-12-09 19:17:10,401 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 19:17:10,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:17:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 19:17:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-12-09 19:17:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 19:17:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2018-12-09 19:17:10,408 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 30 [2018-12-09 19:17:10,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:17:10,408 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2018-12-09 19:17:10,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:17:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2018-12-09 19:17:10,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:17:10,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:17:10,409 INFO L402 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] [2018-12-09 19:17:10,409 INFO L423 AbstractCegarLoop]: === Iteration 7 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:17:10,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:17:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1218673859, now seen corresponding path program 1 times [2018-12-09 19:17:10,409 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:17:10,409 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:17:10,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:10,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:10,532 INFO L478 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 9 treesize of output 12 [2018-12-09 19:17:10,535 INFO L478 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 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:17:10,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:10,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:10,546 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-12-09 19:17:10,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-12-09 19:17:10,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:10,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:10,571 INFO L478 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 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-09 19:17:10,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:10,582 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-12-09 19:17:10,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2018-12-09 19:17:10,647 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:10,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:10,957 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:10,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:11,109 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:11,122 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:11,207 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:11,217 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:11,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:11,256 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-09 19:17:13,267 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_122 (_ BitVec 32)) (|v_receive_#t~ret5.offset_18| (_ BitVec 32)) (v_DerPreprocessor_124 (_ BitVec 32)) (v_DerPreprocessor_126 (_ BitVec 32)) (|v_receive_#t~ret5.base_18| (_ BitVec 32)) (|v_receive_~#packet~0.base_19| (_ BitVec 32)) (|v_receive_~#packet~0.offset_19| (_ BitVec 32)) (v_DerPreprocessor_120 (_ BitVec 32))) (let ((.cse0 (bvadd |v_receive_~#packet~0.offset_19| (_ bv4 32))) (.cse1 (bvadd |v_receive_~#packet~0.offset_19| (_ bv8 32)))) (and (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_19| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_19|) |v_receive_~#packet~0.offset_19| v_DerPreprocessor_120) .cse0 v_DerPreprocessor_124) .cse1 |v_receive_#t~ret5.offset_18|)) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_19|) (_ bv0 1)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_19| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_19|) |v_receive_~#packet~0.offset_19| v_DerPreprocessor_122) .cse0 v_DerPreprocessor_126) .cse1 |v_receive_#t~ret5.base_18|)))))) is different from true [2018-12-09 19:17:13,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:13,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:13,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:13,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-09 19:17:13,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:13,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 19:17:13,408 INFO L478 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 18 treesize of output 21 [2018-12-09 19:17:13,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:13,421 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-09 19:17:13,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:13,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:13,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:13,451 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-09 19:17:13,451 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:13,479 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:13,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:13,529 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:13,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 19:17:13,607 INFO L478 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 18 treesize of output 21 [2018-12-09 19:17:13,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:13,620 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-09 19:17:13,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:13,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:13,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:13,644 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-09 19:17:13,644 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:13,668 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:13,688 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:13,718 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:13,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:13,780 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:78, output treesize:15 [2018-12-09 19:17:13,812 INFO L478 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-12-09 19:17:13,813 INFO L478 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-12-09 19:17:13,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:13,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:13,821 INFO L478 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-12-09 19:17:13,822 INFO L478 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-12-09 19:17:13,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:13,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:13,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:13,826 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-09 19:17:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:13,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:17:16,321 WARN L180 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-09 19:17:16,803 WARN L180 SmtUtils]: Spent 481.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-09 19:17:17,587 WARN L180 SmtUtils]: Spent 782.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-09 19:17:18,136 WARN L180 SmtUtils]: Spent 547.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 19:17:21,953 WARN L180 SmtUtils]: Spent 3.81 s on a formula simplification that was a NOOP. DAG size: 109 [2018-12-09 19:17:21,954 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:22,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:22,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:22,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:22,126 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:22,202 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:22,203 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:22,309 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:29,041 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:29,097 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:29,098 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:29,161 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:29,162 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:29,203 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:29,204 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:29,251 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:33,385 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:33,416 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:33,417 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:33,449 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:33,450 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:33,481 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:33,482 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:33,507 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:37,094 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:37,111 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:37,112 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:37,123 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:37,123 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:37,139 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:37,139 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:37,148 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:39,037 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:39,111 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:39,112 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:39,204 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:39,205 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:39,288 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:40,785 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:40,824 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:40,825 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:40,867 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:40,868 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:40,920 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:41,711 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:41,731 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:41,732 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:41,761 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:41,761 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:41,784 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:42,235 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:42,255 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:42,256 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:42,267 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:42,267 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:42,277 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:42,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 8 dim-2 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-12-09 19:17:42,608 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 14 variables, input treesize:193, output treesize:158 [2018-12-09 19:17:45,936 WARN L180 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 105 DAG size of output: 47 [2018-12-09 19:17:45,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:17:45,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:17:45,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:17:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:17:45,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:17:45,983 INFO L478 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 9 treesize of output 12 [2018-12-09 19:17:45,986 INFO L478 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 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 19:17:45,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:45,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:45,997 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-12-09 19:17:45,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-12-09 19:17:46,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:46,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:46,002 INFO L478 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 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-09 19:17:46,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:46,012 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-12-09 19:17:46,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2018-12-09 19:17:46,016 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:46,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:46,331 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:46,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:46,448 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:46,463 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:46,525 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:46,535 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:46,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:46,571 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-09 19:17:48,586 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_188 (_ BitVec 32)) (|v_receive_~#packet~0.offset_26| (_ BitVec 32)) (|v_receive_#t~ret5.base_25| (_ BitVec 32)) (|v_receive_~#packet~0.base_26| (_ BitVec 32)) (v_DerPreprocessor_190 (_ BitVec 32)) (v_DerPreprocessor_184 (_ BitVec 32)) (|v_receive_#t~ret5.offset_25| (_ BitVec 32)) (v_DerPreprocessor_186 (_ BitVec 32))) (let ((.cse0 (bvadd |v_receive_~#packet~0.offset_26| (_ bv4 32))) (.cse1 (bvadd |v_receive_~#packet~0.offset_26| (_ bv8 32)))) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_26|) (_ bv0 1)) (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_26| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_26|) |v_receive_~#packet~0.offset_26| v_DerPreprocessor_184) .cse0 v_DerPreprocessor_186) .cse1 |v_receive_#t~ret5.offset_25|)) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_26| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_26|) |v_receive_~#packet~0.offset_26| v_DerPreprocessor_190) .cse0 v_DerPreprocessor_188) .cse1 |v_receive_#t~ret5.base_25|)))))) is different from true [2018-12-09 19:17:48,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:48,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:48,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:48,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-09 19:17:48,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:48,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 19:17:48,731 INFO L478 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 18 treesize of output 21 [2018-12-09 19:17:48,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:48,744 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-09 19:17:48,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:48,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:48,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:48,771 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-09 19:17:48,771 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:48,802 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:48,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:48,855 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:48,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 19:17:48,946 INFO L478 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 18 treesize of output 21 [2018-12-09 19:17:48,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:48,960 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-09 19:17:48,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:48,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:48,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:17:48,988 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-09 19:17:48,989 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:49,015 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:49,033 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:49,060 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:49,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:49,114 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:78, output treesize:15 [2018-12-09 19:17:49,118 INFO L478 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-12-09 19:17:49,120 INFO L478 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-12-09 19:17:49,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:49,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:49,128 INFO L478 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-12-09 19:17:49,129 INFO L478 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-12-09 19:17:49,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:49,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:49,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:17:49,133 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-09 19:17:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:17:49,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:17:51,709 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-09 19:17:52,288 WARN L180 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-09 19:17:53,072 WARN L180 SmtUtils]: Spent 782.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-09 19:17:53,634 WARN L180 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-09 19:17:56,270 WARN L180 SmtUtils]: Spent 2.63 s on a formula simplification that was a NOOP. DAG size: 108 [2018-12-09 19:17:56,271 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:56,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:56,341 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:56,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:56,438 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:56,539 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:17:56,540 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 19:17:56,622 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:01,842 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:01,895 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:01,896 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:01,952 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:01,952 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:01,999 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:02,000 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:02,038 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:06,558 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:06,589 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:06,590 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:06,614 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:06,614 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:06,649 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:06,650 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:06,671 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:09,937 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:10,012 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:10,013 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:10,092 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:10,093 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:10,162 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:12,469 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:12,479 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:12,480 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:12,501 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:12,502 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:12,521 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:12,522 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:12,532 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:13,473 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:13,514 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:13,514 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:13,558 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:13,558 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:13,599 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:14,479 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:14,502 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:14,502 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:14,527 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:14,527 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:14,551 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:15,090 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:15,108 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:15,109 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:15,118 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:18:15,119 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:15,128 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:15,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 8 dim-2 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-12-09 19:18:15,425 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 14 variables, input treesize:193, output treesize:158 [2018-12-09 19:18:17,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 19:18:17,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-09 19:18:17,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:18:17,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:18:17,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=126, Unknown=3, NotChecked=46, Total=210 [2018-12-09 19:18:17,557 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 13 states. [2018-12-09 19:18:20,098 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_122 (_ BitVec 32)) (|v_receive_#t~ret5.offset_18| (_ BitVec 32)) (v_DerPreprocessor_124 (_ BitVec 32)) (v_DerPreprocessor_126 (_ BitVec 32)) (|v_receive_#t~ret5.base_18| (_ BitVec 32)) (|v_receive_~#packet~0.base_19| (_ BitVec 32)) (|v_receive_~#packet~0.offset_19| (_ BitVec 32)) (v_DerPreprocessor_120 (_ BitVec 32))) (let ((.cse0 (bvadd |v_receive_~#packet~0.offset_19| (_ bv4 32))) (.cse1 (bvadd |v_receive_~#packet~0.offset_19| (_ bv8 32)))) (and (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_19| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_19|) |v_receive_~#packet~0.offset_19| v_DerPreprocessor_120) .cse0 v_DerPreprocessor_124) .cse1 |v_receive_#t~ret5.offset_18|)) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_19|) (_ bv0 1)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_19| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_19|) |v_receive_~#packet~0.offset_19| v_DerPreprocessor_122) .cse0 v_DerPreprocessor_126) .cse1 |v_receive_#t~ret5.base_18|)))))) (exists ((v_DerPreprocessor_188 (_ BitVec 32)) (|v_receive_~#packet~0.offset_26| (_ BitVec 32)) (|v_receive_#t~ret5.base_25| (_ BitVec 32)) (|v_receive_~#packet~0.base_26| (_ BitVec 32)) (v_DerPreprocessor_190 (_ BitVec 32)) (v_DerPreprocessor_184 (_ BitVec 32)) (|v_receive_#t~ret5.offset_25| (_ BitVec 32)) (v_DerPreprocessor_186 (_ BitVec 32))) (let ((.cse2 (bvadd |v_receive_~#packet~0.offset_26| (_ bv4 32))) (.cse3 (bvadd |v_receive_~#packet~0.offset_26| (_ bv8 32)))) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_26|) (_ bv0 1)) (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_26| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_26|) |v_receive_~#packet~0.offset_26| v_DerPreprocessor_184) .cse2 v_DerPreprocessor_186) .cse3 |v_receive_#t~ret5.offset_25|)) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_26| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_26|) |v_receive_~#packet~0.offset_26| v_DerPreprocessor_190) .cse2 v_DerPreprocessor_188) .cse3 |v_receive_#t~ret5.base_25|))))))) is different from true [2018-12-09 19:18:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:18:34,860 INFO L93 Difference]: Finished difference Result 117 states and 147 transitions. [2018-12-09 19:18:34,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:18:34,860 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-12-09 19:18:34,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:18:34,861 INFO L225 Difference]: With dead ends: 117 [2018-12-09 19:18:34,861 INFO L226 Difference]: Without dead ends: 95 [2018-12-09 19:18:34,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=63, Invalid=217, Unknown=4, NotChecked=96, Total=380 [2018-12-09 19:18:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-09 19:18:34,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 71. [2018-12-09 19:18:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-09 19:18:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2018-12-09 19:18:34,867 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 30 [2018-12-09 19:18:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:18:34,867 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2018-12-09 19:18:34,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:18:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2018-12-09 19:18:34,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:18:34,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:18:34,868 INFO L402 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] [2018-12-09 19:18:34,868 INFO L423 AbstractCegarLoop]: === Iteration 8 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:18:34,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:18:34,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1756580317, now seen corresponding path program 1 times [2018-12-09 19:18:34,868 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 19:18:34,868 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b70d206-13b2-435c-9db7-100c81b08c37/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:18:34,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:18:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:18:35,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:18:35,046 INFO L478 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 21 treesize of output 17 [2018-12-09 19:18:35,047 INFO L478 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 17 treesize of output 5 [2018-12-09 19:18:35,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:18:35,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:35,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:18:35,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:9 [2018-12-09 19:19:05,988 WARN L180 SmtUtils]: Spent 30.93 s on a formula simplification. DAG size of input: 118 DAG size of output: 93 [2018-12-09 19:19:05,989 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:19:06,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:19:15,047 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:19:15,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:19:24,434 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:19:25,012 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:19:32,134 INFO L303 Elim1Store]: Index analysis took 623 ms [2018-12-09 19:19:32,135 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-12-09 19:19:32,175 INFO L478 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 15 treesize of output 18 [2018-12-09 19:19:32,268 INFO L478 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 18 treesize of output 19 [2018-12-09 19:19:32,268 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 19:19:32,572 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:19:34,198 INFO L303 Elim1Store]: Index analysis took 676 ms [2018-12-09 19:19:34,198 INFO L478 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 30 treesize of output 29 [2018-12-09 19:19:34,299 INFO L478 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 18 treesize of output 7 [2018-12-09 19:19:34,300 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 19:19:34,827 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:19:35,498 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:19:36,314 INFO L303 Elim1Store]: Index analysis took 815 ms [2018-12-09 19:19:36,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-12-09 19:19:36,674 INFO L303 Elim1Store]: Index analysis took 359 ms [2018-12-09 19:19:36,699 INFO L478 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 41 treesize of output 47 [2018-12-09 19:19:36,700 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 19:19:38,733 INFO L478 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 40 treesize of output 30 [2018-12-09 19:19:39,219 INFO L303 Elim1Store]: Index analysis took 485 ms [2018-12-09 19:19:39,221 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2018-12-09 19:19:39,221 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 19:19:39,634 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:19:39,702 INFO L478 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 39 treesize of output 31 [2018-12-09 19:19:39,955 INFO L303 Elim1Store]: Index analysis took 251 ms [2018-12-09 19:19:39,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 28 treesize of output 32 [2018-12-09 19:19:40,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:19:40,174 INFO L303 Elim1Store]: Index analysis took 218 ms [2018-12-09 19:19:40,174 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-09 19:19:40,427 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 19:19:40,428 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_arrayElimArr_27 input size 11 context size 11 output size 11 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.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:232) 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:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-09 19:19:40,434 INFO L168 Benchmark]: Toolchain (without parser) took 231374.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -103.7 MB). Peak memory consumption was 81.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:19:40,435 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:19:40,435 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:19:40,436 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:19:40,436 INFO L168 Benchmark]: Boogie Preprocessor took 25.11 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-12-09 19:19:40,437 INFO L168 Benchmark]: RCFGBuilder took 2334.03 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: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:19:40,437 INFO L168 Benchmark]: TraceAbstraction took 228682.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.4 MB). Peak memory consumption was 70.2 MB. Max. memory is 11.5 GB. [2018-12-09 19:19:40,438 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.11 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 2334.03 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: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 228682.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.4 MB). Peak memory consumption was 70.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_27 input size 11 context size 11 output size 11 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_27 input size 11 context size 11 output size 11: 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...