./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/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_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/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 2ec1c4691200cd1b12315d54c84be55eae1c29c8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/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_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/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 2ec1c4691200cd1b12315d54c84be55eae1c29c8 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_46 input size 11 context size 11 output size 11 --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:41:04,729 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:41:04,731 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:41:04,738 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:41:04,738 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:41:04,739 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:41:04,740 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:41:04,742 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:41:04,743 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:41:04,744 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:41:04,745 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:41:04,745 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:41:04,746 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:41:04,747 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:41:04,748 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:41:04,748 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:41:04,749 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:41:04,751 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:41:04,752 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:41:04,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:41:04,754 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:41:04,755 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:41:04,757 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:41:04,758 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:41:04,758 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:41:04,759 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:41:04,760 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:41:04,760 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:41:04,761 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:41:04,762 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:41:04,762 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:41:04,763 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:41:04,763 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:41:04,763 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:41:04,764 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:41:04,765 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:41:04,765 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 21:41:04,777 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:41:04,777 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:41:04,778 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:41:04,778 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:41:04,778 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 21:41:04,779 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 21:41:04,779 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 21:41:04,779 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 21:41:04,779 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 21:41:04,779 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 21:41:04,779 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 21:41:04,780 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 21:41:04,780 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 21:41:04,781 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:41:04,781 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:41:04,781 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:41:04,781 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:41:04,781 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:41:04,781 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:41:04,782 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:41:04,782 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:41:04,782 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:41:04,782 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:41:04,782 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:41:04,783 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:41:04,783 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:41:04,783 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:41:04,783 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:41:04,783 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:41:04,784 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:41:04,784 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:41:04,784 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:41:04,784 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:41:04,784 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 21:41:04,784 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:41:04,785 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:41:04,785 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 21:41:04,785 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_c3971c39-20b8-4f9d-b633-185caab1b509/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 -> 2ec1c4691200cd1b12315d54c84be55eae1c29c8 [2018-11-22 21:41:04,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:41:04,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:41:04,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:41:04,830 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:41:04,830 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:41:04,831 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-11-22 21:41:04,886 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/data/91043ff82/e61fc8bace8f41dc90d06ce328a37f58/FLAG541c00d07 [2018-11-22 21:41:05,307 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:41:05,307 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-11-22 21:41:05,317 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/data/91043ff82/e61fc8bace8f41dc90d06ce328a37f58/FLAG541c00d07 [2018-11-22 21:41:05,333 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/data/91043ff82/e61fc8bace8f41dc90d06ce328a37f58 [2018-11-22 21:41:05,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:41:05,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:41:05,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:41:05,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:41:05,342 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:41:05,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:05" (1/1) ... [2018-11-22 21:41:05,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97dd10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:05, skipping insertion in model container [2018-11-22 21:41:05,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:05" (1/1) ... [2018-11-22 21:41:05,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:41:05,397 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:41:05,650 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:41:05,657 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:41:05,749 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:41:05,784 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:41:05,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:05 WrapperNode [2018-11-22 21:41:05,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:41:05,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:41:05,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:41:05,786 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:41:05,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:05" (1/1) ... [2018-11-22 21:41:05,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:05" (1/1) ... [2018-11-22 21:41:05,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:41:05,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:41:05,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:41:05,808 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:41:05,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:05" (1/1) ... [2018-11-22 21:41:05,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:05" (1/1) ... [2018-11-22 21:41:05,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:05" (1/1) ... [2018-11-22 21:41:05,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:05" (1/1) ... [2018-11-22 21:41:05,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:05" (1/1) ... [2018-11-22 21:41:05,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:05" (1/1) ... [2018-11-22 21:41:05,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:05" (1/1) ... [2018-11-22 21:41:05,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:41:05,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:41:05,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:41:05,832 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:41:05,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:41:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:41:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:41:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 21:41:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure receive [2018-11-22 21:41:05,866 INFO L138 BoogieDeclarations]: Found implementation of procedure receive [2018-11-22 21:41:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure process_prio_queue [2018-11-22 21:41:05,866 INFO L138 BoogieDeclarations]: Found implementation of procedure process_prio_queue [2018-11-22 21:41:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:41:05,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:41:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2018-11-22 21:41:05,866 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2018-11-22 21:41:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:41:05,866 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:41:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-22 21:41:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-22 21:41:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2018-11-22 21:41:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure send [2018-11-22 21:41:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:41:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-22 21:41:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure process_normal_queue [2018-11-22 21:41:05,867 INFO L138 BoogieDeclarations]: Found implementation of procedure process_normal_queue [2018-11-22 21:41:05,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-22 21:41:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:41:05,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:41:06,176 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:41:06,176 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-22 21:41:06,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:06 BoogieIcfgContainer [2018-11-22 21:41:06,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:41:06,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:41:06,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:41:06,179 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:41:06,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:41:05" (1/3) ... [2018-11-22 21:41:06,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d64633a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:41:06, skipping insertion in model container [2018-11-22 21:41:06,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:05" (2/3) ... [2018-11-22 21:41:06,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d64633a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:41:06, skipping insertion in model container [2018-11-22 21:41:06,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:06" (3/3) ... [2018-11-22 21:41:06,182 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter_true-unreach-call.i [2018-11-22 21:41:06,191 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:41:06,197 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-22 21:41:06,206 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-22 21:41:06,225 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:41:06,225 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:41:06,225 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:41:06,225 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:41:06,225 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:41:06,226 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:41:06,226 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:41:06,226 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:41:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-22 21:41:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-22 21:41:06,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:41:06,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:06,244 INFO L423 AbstractCegarLoop]: === Iteration 1 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:41:06,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:06,248 INFO L82 PathProgramCache]: Analyzing trace with hash -70149457, now seen corresponding path program 1 times [2018-11-22 21:41:06,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:41:06,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:06,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:06,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:06,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:41:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:41:06,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:41:06,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 21:41:06,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:41:06,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 21:41:06,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 21:41:06,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:41:06,344 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-11-22 21:41:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:41:06,359 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2018-11-22 21:41:06,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 21:41:06,360 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-22 21:41:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:41:06,367 INFO L225 Difference]: With dead ends: 86 [2018-11-22 21:41:06,367 INFO L226 Difference]: Without dead ends: 50 [2018-11-22 21:41:06,370 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-11-22 21:41:06,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-22 21:41:06,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-22 21:41:06,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-22 21:41:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2018-11-22 21:41:06,402 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 14 [2018-11-22 21:41:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:41:06,402 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2018-11-22 21:41:06,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 21:41:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2018-11-22 21:41:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-22 21:41:06,403 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:41:06,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:06,403 INFO L423 AbstractCegarLoop]: === Iteration 2 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:41:06,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:06,403 INFO L82 PathProgramCache]: Analyzing trace with hash 325102647, now seen corresponding path program 1 times [2018-11-22 21:41:06,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:41:06,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:06,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:06,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:06,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:41:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:41:06,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:41:06,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:41:06,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:41:06,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:41:06,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:41:06,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:41:06,465 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 3 states. [2018-11-22 21:41:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:41:06,488 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-11-22 21:41:06,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:41:06,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-22 21:41:06,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:41:06,490 INFO L225 Difference]: With dead ends: 53 [2018-11-22 21:41:06,490 INFO L226 Difference]: Without dead ends: 51 [2018-11-22 21:41:06,491 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-11-22 21:41:06,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-22 21:41:06,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-22 21:41:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-22 21:41:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2018-11-22 21:41:06,496 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 15 [2018-11-22 21:41:06,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:41:06,497 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2018-11-22 21:41:06,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:41:06,497 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-22 21:41:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-22 21:41:06,497 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:41:06,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:06,498 INFO L423 AbstractCegarLoop]: === Iteration 3 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:41:06,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:06,498 INFO L82 PathProgramCache]: Analyzing trace with hash 325104569, now seen corresponding path program 1 times [2018-11-22 21:41:06,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:41:06,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:06,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:06,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:06,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:41:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:41:06,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:41:06,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:41:06,596 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:41:06,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:41:06,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:41:06,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:41:06,597 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 6 states. [2018-11-22 21:41:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:41:06,755 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-11-22 21:41:06,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 21:41:06,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-22 21:41:06,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:41:06,758 INFO L225 Difference]: With dead ends: 82 [2018-11-22 21:41:06,758 INFO L226 Difference]: Without dead ends: 62 [2018-11-22 21:41:06,759 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-11-22 21:41:06,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-22 21:41:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-11-22 21:41:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-22 21:41:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-11-22 21:41:06,770 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 15 [2018-11-22 21:41:06,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:41:06,770 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-11-22 21:41:06,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:41:06,770 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-11-22 21:41:06,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-22 21:41:06,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:41:06,771 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-11-22 21:41:06,772 INFO L423 AbstractCegarLoop]: === Iteration 4 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:41:06,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:06,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1323640266, now seen corresponding path program 1 times [2018-11-22 21:41:06,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:41:06,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:06,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:06,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:06,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:41:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:41:06,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:41:06,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:41:06,861 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:41:06,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:41:06,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:41:06,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:41:06,862 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 6 states. [2018-11-22 21:41:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:41:07,003 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2018-11-22 21:41:07,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 21:41:07,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-22 21:41:07,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:41:07,005 INFO L225 Difference]: With dead ends: 71 [2018-11-22 21:41:07,005 INFO L226 Difference]: Without dead ends: 54 [2018-11-22 21:41:07,006 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-11-22 21:41:07,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-22 21:41:07,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-22 21:41:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-22 21:41:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-11-22 21:41:07,012 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2018-11-22 21:41:07,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:41:07,012 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-22 21:41:07,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:41:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-22 21:41:07,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 21:41:07,013 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:41:07,013 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-11-22 21:41:07,013 INFO L423 AbstractCegarLoop]: === Iteration 5 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:41:07,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:07,014 INFO L82 PathProgramCache]: Analyzing trace with hash 861249640, now seen corresponding path program 1 times [2018-11-22 21:41:07,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:41:07,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:07,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:07,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:41:07,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:41:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:07,342 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-22 21:41:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:41:07,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:41:07,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 21:41:07,427 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-22 21:41:07,429 INFO L202 CegarAbsIntRunner]: [0], [3], [7], [8], [9], [17], [22], [26], [27], [41], [46], [49], [51], [53], [75], [77], [81], [87], [88], [122], [123], [130], [134], [135], [136] [2018-11-22 21:41:07,461 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 21:41:07,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 21:41:07,613 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 21:41:07,614 INFO L272 AbstractInterpreter]: Visited 25 different actions 25 times. Never merged. Never widened. Performed 222 root evaluator evaluations with a maximum evaluation depth of 4. Performed 222 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-11-22 21:41:07,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:07,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 21:41:07,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:41:07,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:41:07,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:07,635 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 21:41:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:07,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:07,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:07,726 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-11-22 21:41:07,730 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-11-22 21:41:07,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:07,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:07,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:07,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-11-22 21:41:07,786 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 17 treesize of output 20 [2018-11-22 21:41:07,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:07,804 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-11-22 21:41:07,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:34 [2018-11-22 21:41:07,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:07,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:07,925 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:07,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:07,960 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:07,964 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:07,986 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:07,990 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:08,007 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-11-22 21:41:08,007 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-11-22 21:41:12,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:12,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:12,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:12,075 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 16 treesize of output 13 [2018-11-22 21:41:12,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,102 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-11-22 21:41:12,106 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-11-22 21:41:12,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:12,112 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-11-22 21:41:12,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:12,118 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:12,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:12,124 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-11-22 21:41:12,124 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,146 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,173 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,201 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-11-22 21:41:12,205 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-11-22 21:41:12,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:12,211 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-11-22 21:41:12,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:12,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:12,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:12,219 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-11-22 21:41:12,220 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,228 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,235 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,243 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,259 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-11-22 21:41:12,259 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:76, output treesize:15 [2018-11-22 21:41:12,272 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-11-22 21:41:12,274 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-11-22 21:41:12,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,281 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-11-22 21:41:12,283 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-11-22 21:41:12,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,287 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-22 21:41:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:41:12,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:41:12,775 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-11-22 21:41:12,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:12,835 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:12,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:12,853 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:12,871 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:12,873 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:12,890 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:13,306 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:13,319 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:13,321 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:13,335 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:13,336 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:13,352 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:13,354 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:13,364 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:13,687 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:13,701 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:13,702 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:13,717 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:13,718 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:13,733 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:13,955 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:13,966 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:13,967 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:13,979 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:13,980 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:13,990 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,163 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,170 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,171 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,178 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,179 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,187 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,188 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,195 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,352 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,359 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,361 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:14,375 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:14,377 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:14,389 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:14,531 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,537 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,539 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:14,544 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:14,546 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:14,561 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:14,563 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:14,569 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:14,653 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,658 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,659 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,665 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,666 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,673 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:14,736 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-11-22 21:41:14,736 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 14 variables, input treesize:193, output treesize:158 [2018-11-22 21:41:15,108 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 47 [2018-11-22 21:41:15,116 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-22 21:41:17,145 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_14 Int) (v_prenex_13 Int)) (or (= (select (select |c_#memory_$Pointer$.offset| v_prenex_13) v_prenex_14) 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_22 Int) (v_prenex_21 Int)) (and (= (select |c_old(#valid)| v_prenex_22) 0) (not (= 0 (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_22 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_22) v_prenex_21 v_prenex_16) (+ v_prenex_21 4) v_prenex_15)) v_prenex_13) v_prenex_14))) (not (= v_prenex_14 (+ v_prenex_21 8))))) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (and (not (= v_prenex_14 (+ v_prenex_19 8))) (not (= (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_18 (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_18) v_prenex_19 v_prenex_20) (+ v_prenex_19 4) v_prenex_17)) v_prenex_13) v_prenex_14) 0)) (= 0 (select |c_old(#valid)| v_prenex_18)))))) (forall ((|v_main_~#prio_queue~0.offset_BEFORE_CALL_2| Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_2| Int)) (or (= (select (select |c_#memory_$Pointer$.base| |v_main_~#prio_queue~0.base_BEFORE_CALL_2|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_2|) 0) (exists ((v_prenex_7 Int) (v_DerPreprocessor_14 Int) (v_DerPreprocessor_56 Int) (v_prenex_8 Int)) (and (not (= 0 (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_7 (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_7) v_prenex_8 v_DerPreprocessor_56) (+ v_prenex_8 4) v_DerPreprocessor_14)) |v_main_~#prio_queue~0.base_BEFORE_CALL_2|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_2|))) (not (= |v_main_~#prio_queue~0.offset_BEFORE_CALL_2| (+ v_prenex_8 8))) (= (select |c_old(#valid)| v_prenex_7) 0))) (exists ((v_DerPreprocessor_34 Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_DerPreprocessor_48 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_12)) (not (= (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_12 (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_12) v_prenex_11 v_DerPreprocessor_48) (+ v_prenex_11 4) v_DerPreprocessor_34)) |v_main_~#prio_queue~0.base_BEFORE_CALL_2|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_2|) 0)) (not (= |v_main_~#prio_queue~0.offset_BEFORE_CALL_2| (+ v_prenex_11 8)))))))) is different from false [2018-11-22 21:41:17,155 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-22 21:41:17,172 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-11-22 21:41:17,821 WARN L180 SmtUtils]: Spent 638.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2018-11-22 21:41:18,023 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:41:18,023 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-11-22 21:41:18,027 INFO L168 Benchmark]: Toolchain (without parser) took 12690.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.5 MB). Free memory was 951.1 MB in the beginning and 1.0 GB in the end (delta: -52.4 MB). Peak memory consumption was 185.1 MB. Max. memory is 11.5 GB. [2018-11-22 21:41:18,027 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:41:18,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 447.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.0 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -218.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-22 21:41:18,028 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-22 21:41:18,029 INFO L168 Benchmark]: Boogie Preprocessor took 24.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-22 21:41:18,030 INFO L168 Benchmark]: RCFGBuilder took 344.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:41:18,030 INFO L168 Benchmark]: TraceAbstraction took 11849.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 121.9 MB). Peak memory consumption was 175.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:41:18,035 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 447.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.0 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -218.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 344.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11849.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 121.9 MB). Peak memory consumption was 175.4 MB. 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-aa41828 [2018-11-22 21:41:19,729 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:41:19,730 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:41:19,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:41:19,739 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:41:19,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:41:19,741 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:41:19,743 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:41:19,744 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:41:19,745 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:41:19,746 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:41:19,746 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:41:19,747 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:41:19,748 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:41:19,749 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:41:19,749 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:41:19,750 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:41:19,752 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:41:19,754 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:41:19,755 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:41:19,756 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:41:19,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:41:19,760 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:41:19,760 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:41:19,760 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:41:19,761 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:41:19,762 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:41:19,763 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:41:19,764 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:41:19,764 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:41:19,765 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:41:19,766 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:41:19,766 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:41:19,766 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:41:19,767 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:41:19,767 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:41:19,768 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-22 21:41:19,781 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:41:19,781 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:41:19,782 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:41:19,782 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:41:19,782 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 21:41:19,782 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 21:41:19,783 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 21:41:19,783 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 21:41:19,783 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 21:41:19,783 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 21:41:19,784 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:41:19,784 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:41:19,784 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:41:19,784 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:41:19,784 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:41:19,786 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:41:19,786 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:41:19,786 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-22 21:41:19,787 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-22 21:41:19,787 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:41:19,787 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:41:19,787 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:41:19,787 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:41:19,787 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:41:19,787 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:41:19,788 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:41:19,788 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:41:19,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:41:19,788 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:41:19,788 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:41:19,788 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:41:19,789 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-22 21:41:19,789 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:41:19,789 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-22 21:41:19,789 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-22 21:41:19,789 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_c3971c39-20b8-4f9d-b633-185caab1b509/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 -> 2ec1c4691200cd1b12315d54c84be55eae1c29c8 [2018-11-22 21:41:19,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:41:19,841 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:41:19,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:41:19,846 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:41:19,846 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:41:19,847 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-11-22 21:41:19,908 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/data/fc2b21e4d/aa749775fad84a1f8523b33d327362ff/FLAGfb23e4681 [2018-11-22 21:41:20,330 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:41:20,331 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-11-22 21:41:20,339 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/data/fc2b21e4d/aa749775fad84a1f8523b33d327362ff/FLAGfb23e4681 [2018-11-22 21:41:20,350 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/data/fc2b21e4d/aa749775fad84a1f8523b33d327362ff [2018-11-22 21:41:20,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:41:20,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:41:20,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:41:20,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:41:20,358 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:41:20,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:20" (1/1) ... [2018-11-22 21:41:20,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f5ba8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20, skipping insertion in model container [2018-11-22 21:41:20,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:41:20" (1/1) ... [2018-11-22 21:41:20,369 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:41:20,404 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:41:20,689 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:41:20,703 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:41:20,827 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:41:20,865 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:41:20,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20 WrapperNode [2018-11-22 21:41:20,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:41:20,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:41:20,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:41:20,867 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:41:20,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2018-11-22 21:41:20,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2018-11-22 21:41:20,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:41:20,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:41:20,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:41:20,897 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:41:20,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2018-11-22 21:41:20,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2018-11-22 21:41:20,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2018-11-22 21:41:20,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2018-11-22 21:41:20,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2018-11-22 21:41:20,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2018-11-22 21:41:20,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... [2018-11-22 21:41:20,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:41:20,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:41:20,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:41:20,932 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:41:20,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:41:20,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:41:20,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-22 21:41:20,979 INFO L130 BoogieDeclarations]: Found specification of procedure receive [2018-11-22 21:41:20,979 INFO L138 BoogieDeclarations]: Found implementation of procedure receive [2018-11-22 21:41:20,979 INFO L130 BoogieDeclarations]: Found specification of procedure process_prio_queue [2018-11-22 21:41:20,979 INFO L138 BoogieDeclarations]: Found implementation of procedure process_prio_queue [2018-11-22 21:41:20,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:41:20,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:41:20,980 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2018-11-22 21:41:20,980 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2018-11-22 21:41:20,980 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:41:20,980 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:41:20,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-22 21:41:20,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-22 21:41:20,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2018-11-22 21:41:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure send [2018-11-22 21:41:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:41:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-22 21:41:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-22 21:41:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-11-22 21:41:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure process_normal_queue [2018-11-22 21:41:20,981 INFO L138 BoogieDeclarations]: Found implementation of procedure process_normal_queue [2018-11-22 21:41:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:41:20,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:41:23,367 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:41:23,368 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-22 21:41:23,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:23 BoogieIcfgContainer [2018-11-22 21:41:23,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:41:23,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:41:23,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:41:23,373 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:41:23,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:41:20" (1/3) ... [2018-11-22 21:41:23,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c52a5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:41:23, skipping insertion in model container [2018-11-22 21:41:23,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:41:20" (2/3) ... [2018-11-22 21:41:23,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c52a5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:41:23, skipping insertion in model container [2018-11-22 21:41:23,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:41:23" (3/3) ... [2018-11-22 21:41:23,376 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter_true-unreach-call.i [2018-11-22 21:41:23,386 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:41:23,394 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-22 21:41:23,406 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-22 21:41:23,427 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:41:23,428 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:41:23,428 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:41:23,428 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:41:23,428 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:41:23,428 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:41:23,428 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:41:23,429 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:41:23,429 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:41:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-22 21:41:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-22 21:41:23,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:41:23,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:23,448 INFO L423 AbstractCegarLoop]: === Iteration 1 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:41:23,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:23,452 INFO L82 PathProgramCache]: Analyzing trace with hash -810451345, now seen corresponding path program 1 times [2018-11-22 21:41:23,455 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 21:41:23,455 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 21:41:23,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:23,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:41:23,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:41:23,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:41:23,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:41:23,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:41:23,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:41:23,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:41:23,580 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2018-11-22 21:41:23,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:41:23,619 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2018-11-22 21:41:23,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:41:23,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-22 21:41:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:41:23,629 INFO L225 Difference]: With dead ends: 86 [2018-11-22 21:41:23,629 INFO L226 Difference]: Without dead ends: 50 [2018-11-22 21:41:23,632 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-11-22 21:41:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-22 21:41:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-22 21:41:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-22 21:41:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2018-11-22 21:41:23,668 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 14 [2018-11-22 21:41:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:41:23,668 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2018-11-22 21:41:23,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:41:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2018-11-22 21:41:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-22 21:41:23,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:41:23,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:41:23,670 INFO L423 AbstractCegarLoop]: === Iteration 2 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:41:23,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:23,671 INFO L82 PathProgramCache]: Analyzing trace with hash -810449423, now seen corresponding path program 1 times [2018-11-22 21:41:23,671 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 21:41:23,671 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 21:41:23,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:23,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:23,784 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-11-22 21:41:23,788 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-11-22 21:41:23,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:23,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:23,813 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-11-22 21:41:23,821 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-11-22 21:41:23,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:23,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:23,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:23,833 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-22 21:41:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:41:23,869 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:41:23,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:41:23,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:41:23,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:41:23,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:41:23,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:41:23,873 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 6 states. [2018-11-22 21:41:26,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:41:26,074 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2018-11-22 21:41:26,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 21:41:26,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-22 21:41:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:41:26,078 INFO L225 Difference]: With dead ends: 80 [2018-11-22 21:41:26,078 INFO L226 Difference]: Without dead ends: 60 [2018-11-22 21:41:26,079 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-11-22 21:41:26,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-22 21:41:26,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-11-22 21:41:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-22 21:41:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-11-22 21:41:26,090 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 14 [2018-11-22 21:41:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:41:26,091 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-22 21:41:26,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:41:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-11-22 21:41:26,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 21:41:26,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:41:26,092 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-11-22 21:41:26,093 INFO L423 AbstractCegarLoop]: === Iteration 3 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:41:26,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:26,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1042787858, now seen corresponding path program 1 times [2018-11-22 21:41:26,093 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 21:41:26,094 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 21:41:26,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:26,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:26,207 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-11-22 21:41:26,211 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-11-22 21:41:26,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:26,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:26,222 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-11-22 21:41:26,225 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-11-22 21:41:26,225 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:26,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:26,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:26,231 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-22 21:41:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:41:26,299 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:41:26,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:41:26,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 21:41:26,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 21:41:26,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 21:41:26,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:41:26,306 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 7 states. [2018-11-22 21:41:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:41:34,577 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2018-11-22 21:41:34,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 21:41:34,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-22 21:41:34,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:41:34,579 INFO L225 Difference]: With dead ends: 70 [2018-11-22 21:41:34,580 INFO L226 Difference]: Without dead ends: 53 [2018-11-22 21:41:34,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-22 21:41:34,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-22 21:41:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-22 21:41:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-22 21:41:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2018-11-22 21:41:34,588 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 20 [2018-11-22 21:41:34,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:41:34,588 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2018-11-22 21:41:34,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 21:41:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-22 21:41:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 21:41:34,589 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:41:34,590 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-11-22 21:41:34,590 INFO L423 AbstractCegarLoop]: === Iteration 4 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:41:34,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:41:34,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1624011416, now seen corresponding path program 1 times [2018-11-22 21:41:34,590 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 21:41:34,591 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 21:41:34,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:41:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:41:34,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:41:34,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:34,740 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-11-22 21:41:34,744 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-11-22 21:41:34,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:34,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:34,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:34,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-11-22 21:41:34,799 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-11-22 21:41:34,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:34,817 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-11-22 21:41:34,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-11-22 21:41:34,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:34,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:35,334 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:35,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:35,514 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:35,531 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:35,622 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:35,639 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:35,690 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-11-22 21:41:35,690 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-11-22 21:41:37,704 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_6) .cse0 v_DerPreprocessor_8) .cse1 |v_receive_#t~ret5.base_4|)) |c_#memory_$Pointer$.base|)))) is different from true [2018-11-22 21:41:37,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:37,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:37,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:37,747 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 20 treesize of output 13 [2018-11-22 21:41:37,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:37,909 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-11-22 21:41:37,921 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-11-22 21:41:37,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:37,941 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-11-22 21:41:37,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:37,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:37,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:37,987 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-11-22 21:41:37,988 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:38,036 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:38,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:38,112 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:38,229 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-11-22 21:41:38,238 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-11-22 21:41:38,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:38,274 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-11-22 21:41:38,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:38,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:38,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:41:38,310 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-11-22 21:41:38,311 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:38,347 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:38,372 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:38,406 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:38,493 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-11-22 21:41:38,493 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:80, output treesize:15 [2018-11-22 21:41:38,526 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-11-22 21:41:38,529 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-11-22 21:41:38,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:38,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:38,545 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-11-22 21:41:38,548 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-11-22 21:41:38,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:38,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:38,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:38,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-22 21:41:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:41:38,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:41:39,219 WARN L180 SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-22 21:41:39,719 WARN L180 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-22 21:41:40,945 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 61 [2018-11-22 21:41:41,762 WARN L180 SmtUtils]: Spent 815.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-22 21:41:46,516 WARN L180 SmtUtils]: Spent 4.74 s on a formula simplification that was a NOOP. DAG size: 109 [2018-11-22 21:41:46,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:46,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:46,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:46,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:46,754 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:46,867 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:46,868 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:46,966 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:52,459 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:52,513 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:52,515 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:52,568 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:52,569 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:52,612 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,471 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:56,601 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:56,602 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:56,720 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:56,721 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-22 21:41:56,835 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:41:59,872 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:59,905 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:59,906 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:59,939 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:59,941 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:41:59,980 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:02,654 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:02,705 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:02,706 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:02,784 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:02,785 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:02,836 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:04,370 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:04,420 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:04,421 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:04,446 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:04,447 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:04,484 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:05,346 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:05,361 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:05,362 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:05,388 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:05,389 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:05,405 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:05,912 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:05,929 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:05,931 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:05,962 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:05,963 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:05,976 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:06,437 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-11-22 21:42:06,437 INFO L202 ElimStorePlain]: Needed 51 recursive calls to eliminate 14 variables, input treesize:193, output treesize:131 [2018-11-22 21:42:12,694 WARN L180 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2018-11-22 21:42:12,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:42:12,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:42:12,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:42:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:42:12,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:42:12,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:12,762 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-11-22 21:42:12,765 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-11-22 21:42:12,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:12,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:12,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:12,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-11-22 21:42:12,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:12,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:12,799 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:12,800 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-11-22 21:42:12,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:12,819 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-11-22 21:42:12,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:46 [2018-11-22 21:42:12,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:12,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:13,166 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:13,188 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:13,300 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:13,327 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:13,417 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:13,428 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:13,466 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-11-22 21:42:13,466 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-11-22 21:42:15,481 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_60 (_ BitVec 32)) (|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_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)) (= |c_#memory_$Pointer$.offset| (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_60) .cse1 |v_receive_#t~ret5.offset_11|))) (= (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-11-22 21:42:15,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:15,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:15,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:15,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:15,531 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-11-22 21:42:15,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:15,742 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-11-22 21:42:15,752 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-11-22 21:42:15,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:15,791 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-11-22 21:42:15,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:15,808 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:15,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:15,835 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-11-22 21:42:15,835 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:15,880 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:15,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:15,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:16,102 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-11-22 21:42:16,116 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-11-22 21:42:16,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:16,134 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-11-22 21:42:16,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:16,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:16,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:42:16,169 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-11-22 21:42:16,170 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:16,211 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:16,241 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:16,280 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:16,399 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-11-22 21:42:16,400 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:93, output treesize:15 [2018-11-22 21:42:16,404 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-11-22 21:42:16,407 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-11-22 21:42:16,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:16,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:16,420 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-11-22 21:42:16,422 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-11-22 21:42:16,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:16,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:16,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:16,428 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-22 21:42:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:42:16,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:42:17,112 WARN L180 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-22 21:42:17,955 WARN L180 SmtUtils]: Spent 842.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-22 21:42:19,203 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 61 [2018-11-22 21:42:20,376 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 55 [2018-11-22 21:42:24,801 WARN L180 SmtUtils]: Spent 4.42 s on a formula simplification that was a NOOP. DAG size: 107 [2018-11-22 21:42:24,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:24,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:24,929 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:25,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:25,055 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:25,160 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:25,162 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:25,274 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:35,419 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:35,518 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:35,520 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:35,634 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:35,635 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:35,751 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:44,032 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:44,103 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:44,105 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:44,163 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:44,164 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:44,231 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:49,692 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:49,714 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:49,715 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:49,739 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:49,740 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:49,774 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:53,383 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:53,396 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:53,397 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:53,411 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:53,412 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:53,434 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:56,134 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:56,194 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:56,195 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:56,249 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:56,249 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:56,314 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:56,315 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:56,376 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:57,681 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:57,720 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:57,721 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:57,752 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:57,752 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:57,780 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:57,781 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:57,815 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:58,486 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-22 21:42:58,501 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:42:58,502 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:58,525 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:58,526 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:58,544 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:58,545 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:58,570 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:42:59,045 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-11-22 21:42:59,045 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 14 variables, input treesize:193, output treesize:158 [2018-11-22 21:42:59,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:42:59,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2018-11-22 21:42:59,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 21:42:59,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 21:42:59,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2018-11-22 21:42:59,205 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 12 states. [2018-11-22 21:43:04,217 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_60 (_ BitVec 32)) (|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_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)) (= |c_#memory_$Pointer$.offset| (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_60) .cse1 |v_receive_#t~ret5.offset_11|))) (= (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_6) .cse2 v_DerPreprocessor_8) .cse3 |v_receive_#t~ret5.base_4|)) |c_#memory_$Pointer$.base|))))) is different from true [2018-11-22 21:43:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:43:06,725 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2018-11-22 21:43:06,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 21:43:06,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-11-22 21:43:06,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:43:06,727 INFO L225 Difference]: With dead ends: 90 [2018-11-22 21:43:06,727 INFO L226 Difference]: Without dead ends: 70 [2018-11-22 21:43:06,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=49, Invalid=170, Unknown=3, NotChecked=84, Total=306 [2018-11-22 21:43:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-22 21:43:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-11-22 21:43:06,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-22 21:43:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2018-11-22 21:43:06,737 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 24 [2018-11-22 21:43:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:43:06,737 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2018-11-22 21:43:06,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 21:43:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-11-22 21:43:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 21:43:06,738 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:43:06,739 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-11-22 21:43:06,739 INFO L423 AbstractCegarLoop]: === Iteration 5 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:43:06,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:43:06,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1291150359, now seen corresponding path program 1 times [2018-11-22 21:43:06,740 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 21:43:06,740 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 21:43:06,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:43:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:43:06,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:43:06,857 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-11-22 21:43:06,860 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-11-22 21:43:06,864 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-11-22 21:43:06,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:06,867 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:06,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:06,874 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-11-22 21:43:06,874 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2018-11-22 21:43:06,914 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 30 treesize of output 30 [2018-11-22 21:43:06,917 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 26 treesize of output 15 [2018-11-22 21:43:06,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:06,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 3 [2018-11-22 21:43:06,942 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:06,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:06,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:06,955 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2018-11-22 21:43:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:43:06,968 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:43:06,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:43:06,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 21:43:06,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 21:43:06,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 21:43:06,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-22 21:43:06,971 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 8 states. [2018-11-22 21:43:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:43:11,470 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2018-11-22 21:43:11,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 21:43:11,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-22 21:43:11,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:43:11,472 INFO L225 Difference]: With dead ends: 119 [2018-11-22 21:43:11,472 INFO L226 Difference]: Without dead ends: 75 [2018-11-22 21:43:11,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-22 21:43:11,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-22 21:43:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-11-22 21:43:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-22 21:43:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-11-22 21:43:11,483 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 30 [2018-11-22 21:43:11,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:43:11,483 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-11-22 21:43:11,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 21:43:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2018-11-22 21:43:11,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 21:43:11,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:43:11,487 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-11-22 21:43:11,487 INFO L423 AbstractCegarLoop]: === Iteration 6 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:43:11,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:43:11,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1480779093, now seen corresponding path program 1 times [2018-11-22 21:43:11,488 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 21:43:11,488 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 21:43:11,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:43:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:43:11,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:43:11,649 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-11-22 21:43:11,653 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-11-22 21:43:11,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:11,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:11,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:11,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-11-22 21:43:11,701 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 14 treesize of output 11 [2018-11-22 21:43:11,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:11,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:11,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2018-11-22 21:43:11,773 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:11,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:12,098 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:12,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:12,251 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:12,275 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:12,374 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:12,388 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:12,439 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-11-22 21:43:12,440 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-11-22 21:43:14,449 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_receive_#t~ret5.offset_18| (_ BitVec 32)) (v_DerPreprocessor_124 (_ BitVec 32)) (v_DerPreprocessor_126 (_ BitVec 32)) (v_DerPreprocessor_128 (_ 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_130 (_ 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$.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_124) .cse0 v_DerPreprocessor_126) .cse1 |v_receive_#t~ret5.base_18|)) |c_#memory_$Pointer$.base|) (= (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_128) .cse0 v_DerPreprocessor_130) .cse1 |v_receive_#t~ret5.offset_18|)) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_19|) (_ bv0 1))))) is different from true [2018-11-22 21:43:14,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:14,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:14,484 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 13 treesize of output 4 [2018-11-22 21:43:14,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:14,619 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-11-22 21:43:14,625 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-11-22 21:43:14,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:14,642 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-11-22 21:43:14,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:14,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:14,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:14,681 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-11-22 21:43:14,681 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:14,720 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:14,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:14,786 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:14,889 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-11-22 21:43:14,894 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-11-22 21:43:14,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:14,909 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-11-22 21:43:14,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:14,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:14,923 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:14,938 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-11-22 21:43:14,939 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:14,971 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:14,993 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:15,024 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:15,081 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-11-22 21:43:15,081 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 11 variables, input treesize:69, output treesize:15 [2018-11-22 21:43:17,143 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-11-22 21:43:17,146 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-11-22 21:43:17,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:17,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:17,159 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-11-22 21:43:17,161 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-11-22 21:43:17,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:17,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:17,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:17,169 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-22 21:43:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:43:17,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:43:17,866 WARN L180 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-22 21:43:18,986 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 49 [2018-11-22 21:43:20,144 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 61 [2018-11-22 21:43:21,053 WARN L180 SmtUtils]: Spent 908.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-22 21:43:27,201 WARN L180 SmtUtils]: Spent 6.14 s on a formula simplification that was a NOOP. DAG size: 109 [2018-11-22 21:43:27,203 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:27,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:27,313 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:27,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:27,425 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:27,556 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:27,557 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:27,663 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:41,856 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:41,909 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:41,910 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:41,990 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:41,991 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:42,045 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:42,047 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:42,134 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:48,672 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:48,780 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:48,780 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:48,885 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:48,886 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:49,001 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:52,778 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:52,827 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:52,828 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:52,878 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:52,879 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:52,919 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:54,894 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:54,932 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:54,933 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:54,963 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:54,964 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:54,986 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:56,548 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:56,574 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:56,574 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:56,620 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:56,621 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:56,655 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:56,656 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:56,705 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:57,622 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:57,638 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:57,638 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:57,650 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:57,652 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:57,677 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:58,380 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:58,405 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:58,406 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:58,426 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:58,426 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:58,439 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:58,440 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:58,453 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:58,843 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-11-22 21:43:58,843 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 14 variables, input treesize:193, output treesize:158 [2018-11-22 21:43:59,244 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 44 [2018-11-22 21:43:59,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:43:59,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:43:59,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:43:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:43:59,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:43:59,291 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-11-22 21:43:59,296 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-11-22 21:43:59,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:59,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:43:59,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:59,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-11-22 21:43:59,318 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:59,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:43:59,320 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-11-22 21:43:59,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:43:59,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:59,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2018-11-22 21:43:59,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:59,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:59,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-11-22 21:43:59,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:59,971 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:43:59,998 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:00,119 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:00,138 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:00,191 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-11-22 21:44:00,192 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-11-22 21:44:02,213 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_192 (_ BitVec 32)) (|v_receive_#t~ret5.offset_25| (_ BitVec 32)) (v_DerPreprocessor_194 (_ 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_188) .cse0 v_DerPreprocessor_190) .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_192) .cse0 v_DerPreprocessor_194) .cse1 |v_receive_#t~ret5.base_25|)))))) is different from true [2018-11-22 21:44:02,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:02,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:02,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:02,251 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-11-22 21:44:02,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:02,414 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-11-22 21:44:02,424 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-11-22 21:44:02,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:02,443 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-11-22 21:44:02,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:02,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:02,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:02,483 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-11-22 21:44:02,484 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:02,527 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:02,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:02,598 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:02,712 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-11-22 21:44:02,723 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-11-22 21:44:02,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:02,740 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-11-22 21:44:02,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:02,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:02,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:44:02,781 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-11-22 21:44:02,782 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:02,819 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:02,848 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:02,885 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:02,961 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-11-22 21:44:02,962 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:78, output treesize:15 [2018-11-22 21:44:05,004 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-11-22 21:44:05,006 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-11-22 21:44:05,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:05,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:05,019 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-11-22 21:44:05,020 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-11-22 21:44:05,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:05,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:05,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:05,025 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-22 21:44:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:44:05,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:44:05,644 WARN L180 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-22 21:44:06,363 WARN L180 SmtUtils]: Spent 718.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-22 21:44:07,494 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 61 [2018-11-22 21:44:08,417 WARN L180 SmtUtils]: Spent 921.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-22 21:44:13,580 WARN L180 SmtUtils]: Spent 5.16 s on a formula simplification that was a NOOP. DAG size: 108 [2018-11-22 21:44:13,582 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:13,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:13,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:13,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:13,842 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:13,978 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:13,978 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:14,097 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:32,100 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:32,215 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:32,216 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:32,311 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:32,312 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:32,425 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:37,911 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:37,959 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:37,960 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:38,005 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:38,006 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:38,088 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:38,090 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:38,165 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:42,798 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:42,828 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:42,829 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:42,893 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:42,893 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:42,926 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:42,927 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:42,979 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:46,758 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:46,797 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:46,798 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:46,850 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:46,850 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:46,903 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:48,854 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:48,884 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:48,885 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:48,909 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:48,909 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:48,923 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:48,924 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:48,936 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:49,676 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:49,709 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:49,710 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:49,740 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:49,741 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:49,767 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:50,527 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:50,552 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:50,553 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-22 21:44:50,567 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:44:50,568 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:50,580 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:44:51,073 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-11-22 21:44:51,073 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 14 variables, input treesize:193, output treesize:158 [2018-11-22 21:44:51,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:44:51,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 13 [2018-11-22 21:44:51,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-22 21:44:51,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 21:44:51,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=104, Unknown=3, NotChecked=42, Total=182 [2018-11-22 21:44:51,406 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 13 states. [2018-11-22 21:45:04,803 WARN L854 $PredicateComparison]: unable to prove that (and (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_192 (_ BitVec 32)) (|v_receive_#t~ret5.offset_25| (_ BitVec 32)) (v_DerPreprocessor_194 (_ 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_188) .cse0 v_DerPreprocessor_190) .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_192) .cse0 v_DerPreprocessor_194) .cse1 |v_receive_#t~ret5.base_25|)))))) (exists ((|v_receive_#t~ret5.offset_18| (_ BitVec 32)) (v_DerPreprocessor_124 (_ BitVec 32)) (v_DerPreprocessor_126 (_ BitVec 32)) (v_DerPreprocessor_128 (_ 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_130 (_ BitVec 32))) (let ((.cse2 (bvadd |v_receive_~#packet~0.offset_19| (_ bv4 32))) (.cse3 (bvadd |v_receive_~#packet~0.offset_19| (_ bv8 32)))) (and (= (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_124) .cse2 v_DerPreprocessor_126) .cse3 |v_receive_#t~ret5.base_18|)) |c_#memory_$Pointer$.base|) (= (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_128) .cse2 v_DerPreprocessor_130) .cse3 |v_receive_#t~ret5.offset_18|)) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_19|) (_ bv0 1)))))) is different from true [2018-11-22 21:45:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:45:09,369 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2018-11-22 21:45:09,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 21:45:09,369 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-22 21:45:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:45:09,370 INFO L225 Difference]: With dead ends: 90 [2018-11-22 21:45:09,370 INFO L226 Difference]: Without dead ends: 73 [2018-11-22 21:45:09,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=58, Invalid=190, Unknown=4, NotChecked=90, Total=342 [2018-11-22 21:45:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-22 21:45:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-11-22 21:45:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-22 21:45:09,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2018-11-22 21:45:09,379 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 30 [2018-11-22 21:45:09,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:45:09,380 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2018-11-22 21:45:09,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-22 21:45:09,380 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2018-11-22 21:45:09,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 21:45:09,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:45:09,381 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-11-22 21:45:09,381 INFO L423 AbstractCegarLoop]: === Iteration 7 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:45:09,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:45:09,381 INFO L82 PathProgramCache]: Analyzing trace with hash -868448533, now seen corresponding path program 1 times [2018-11-22 21:45:09,382 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 21:45:09,382 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 21:45:09,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:45:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:45:09,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:45:09,544 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-11-22 21:45:09,547 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-11-22 21:45:09,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:09,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:09,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:09,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:9 [2018-11-22 21:45:44,488 WARN L180 SmtUtils]: Spent 34.92 s on a formula simplification. DAG size of input: 118 DAG size of output: 93 [2018-11-22 21:45:45,570 INFO L303 Elim1Store]: Index analysis took 1081 ms [2018-11-22 21:45:45,571 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 21 treesize of output 18 [2018-11-22 21:45:45,846 INFO L303 Elim1Store]: Index analysis took 274 ms [2018-11-22 21:45:45,846 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-11-22 21:45:46,843 INFO L303 Elim1Store]: Index analysis took 995 ms [2018-11-22 21:45:46,843 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 23 [2018-11-22 21:45:50,395 INFO L303 Elim1Store]: Index analysis took 3550 ms [2018-11-22 21:45:50,396 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 15 [2018-11-22 21:45:50,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:45:51,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:53,080 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:45:55,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:09,577 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:46:10,105 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:46:23,704 INFO L303 Elim1Store]: Index analysis took 3779 ms [2018-11-22 21:46:23,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 53 [2018-11-22 21:46:24,019 INFO L303 Elim1Store]: Index analysis took 118 ms [2018-11-22 21:46:24,019 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 48 treesize of output 50 [2018-11-22 21:46:24,367 INFO L303 Elim1Store]: Index analysis took 346 ms [2018-11-22 21:46:24,367 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 32 treesize of output 34 [2018-11-22 21:46:25,253 INFO L303 Elim1Store]: Index analysis took 885 ms [2018-11-22 21:46:25,254 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-11-22 21:46:27,410 INFO L303 Elim1Store]: Index analysis took 2155 ms [2018-11-22 21:46:27,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-22 21:46:27,411 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-22 21:46:28,210 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:29,212 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:31,603 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:36,013 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:46:44,179 INFO L303 Elim1Store]: Index analysis took 3229 ms [2018-11-22 21:46:44,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 76 [2018-11-22 21:46:44,600 INFO L303 Elim1Store]: Index analysis took 328 ms [2018-11-22 21:46:44,633 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 4 case distinctions, treesize of input 55 treesize of output 59 [2018-11-22 21:46:44,633 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-11-22 21:46:57,110 INFO L303 Elim1Store]: Index analysis took 228 ms [2018-11-22 21:46:57,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 63 [2018-11-22 21:46:57,156 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2018-11-22 21:47:09,001 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-11-22 21:47:09,002 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:18,142 INFO L303 Elim1Store]: Index analysis took 198 ms [2018-11-22 21:47:18,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 40 [2018-11-22 21:47:18,179 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 8 xjuncts. [2018-11-22 21:47:28,137 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-11-22 21:47:39,260 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-11-22 21:47:39,261 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-11-22 21:47:39,357 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-11-22 21:47:39,357 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:47:40,071 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 39 treesize of output 36 [2018-11-22 21:47:40,071 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:40,103 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 40 treesize of output 37 [2018-11-22 21:47:40,104 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:40,404 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 25 treesize of output 19 [2018-11-22 21:47:40,443 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 24 [2018-11-22 21:47:40,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 41 [2018-11-22 21:47:40,540 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 6 xjuncts. [2018-11-22 21:47:40,658 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:47:40,752 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:47:41,145 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:47:41,347 INFO L303 Elim1Store]: Index analysis took 201 ms [2018-11-22 21:47:41,348 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-11-22 21:47:41,364 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-11-22 21:47:41,402 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-11-22 21:47:41,402 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:41,487 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:41,873 INFO L303 Elim1Store]: Index analysis took 108 ms [2018-11-22 21:47:41,874 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-11-22 21:47:41,896 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-11-22 21:47:41,896 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:41,945 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:42,086 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:44,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-11-22 21:47:44,869 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-11-22 21:47:44,869 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:44,976 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 29 treesize of output 26 [2018-11-22 21:47:44,976 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:45,036 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 25 treesize of output 19 [2018-11-22 21:47:45,070 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 24 [2018-11-22 21:47:45,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 41 [2018-11-22 21:47:45,138 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 6 xjuncts. [2018-11-22 21:47:45,210 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:47:45,260 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:47:45,331 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 21:47:45,385 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-11-22 21:47:45,393 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-11-22 21:47:45,406 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-11-22 21:47:45,406 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:45,425 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:45,492 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-11-22 21:47:45,504 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 18 treesize of output 7 [2018-11-22 21:47:45,504 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:45,526 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:45,551 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:46,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 8 dim-0 vars, and 18 xjuncts. [2018-11-22 21:47:46,102 INFO L202 ElimStorePlain]: Needed 40 recursive calls to eliminate 11 variables, input treesize:195, output treesize:750 [2018-11-22 21:47:46,282 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 30 [2018-11-22 21:47:46,340 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-11-22 21:47:46,344 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-11-22 21:47:46,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:46,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:46,372 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 38 treesize of output 32 [2018-11-22 21:47:46,374 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 32 treesize of output 23 [2018-11-22 21:47:46,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:46,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:46,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:47:46,392 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:33 [2018-11-22 21:47:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:47:46,486 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:47:46,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:47:46,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-22 21:47:46,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-22 21:47:46,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-22 21:47:46,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-22 21:47:46,489 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 11 states. [2018-11-22 21:47:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:47:55,466 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2018-11-22 21:47:55,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-22 21:47:55,468 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-11-22 21:47:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:47:55,469 INFO L225 Difference]: With dead ends: 109 [2018-11-22 21:47:55,469 INFO L226 Difference]: Without dead ends: 89 [2018-11-22 21:47:55,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-11-22 21:47:55,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-22 21:47:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2018-11-22 21:47:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-22 21:47:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2018-11-22 21:47:55,488 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 30 [2018-11-22 21:47:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:47:55,488 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2018-11-22 21:47:55,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-22 21:47:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2018-11-22 21:47:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-22 21:47:55,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:47:55,489 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, 1] [2018-11-22 21:47:55,490 INFO L423 AbstractCegarLoop]: === Iteration 8 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:47:55,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:47:55,490 INFO L82 PathProgramCache]: Analyzing trace with hash -125338167, now seen corresponding path program 1 times [2018-11-22 21:47:55,490 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 21:47:55,490 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3971c39-20b8-4f9d-b633-185caab1b509/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 21:47:55,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:47:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:47:55,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:47:55,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:55,692 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-11-22 21:47:55,695 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-11-22 21:47:55,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:55,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:55,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:47:55,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-11-22 21:47:55,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:55,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:55,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:55,732 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-11-22 21:47:55,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:55,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:47:55,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:35 [2018-11-22 21:47:56,605 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-22 21:47:56,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:56,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:56,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:56,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:56,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 29 treesize of output 53 [2018-11-22 21:47:56,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:56,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-22 21:47:56,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:46 [2018-11-22 21:47:56,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:47:56,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-22 21:47:56,862 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 18 treesize of output 11 [2018-11-22 21:47:56,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:56,879 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-11-22 21:47:56,879 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 21:47:56,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:47:56,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-22 21:47:56,909 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:66, output treesize:44 [2018-11-22 21:48:28,991 WARN L180 SmtUtils]: Spent 32.03 s on a formula simplification. DAG size of input: 124 DAG size of output: 99 [2018-11-22 21:48:30,026 INFO L303 Elim1Store]: Index analysis took 1034 ms [2018-11-22 21:48:30,026 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 21 treesize of output 18 [2018-11-22 21:48:30,281 INFO L303 Elim1Store]: Index analysis took 254 ms [2018-11-22 21:48:30,282 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-11-22 21:48:30,973 INFO L303 Elim1Store]: Index analysis took 690 ms [2018-11-22 21:48:30,973 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 23 [2018-11-22 21:48:32,647 INFO L303 Elim1Store]: Index analysis took 1672 ms [2018-11-22 21:48:32,648 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 15 [2018-11-22 21:48:32,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:48:33,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:48:35,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:48:37,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:48:51,551 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:48:51,804 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:48:59,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:01,884 INFO L303 Elim1Store]: Index analysis took 2169 ms [2018-11-22 21:49:01,885 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 47 treesize of output 48 [2018-11-22 21:49:02,086 INFO L303 Elim1Store]: Index analysis took 200 ms [2018-11-22 21:49:02,086 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 29 treesize of output 32 [2018-11-22 21:49:02,420 INFO L303 Elim1Store]: Index analysis took 332 ms [2018-11-22 21:49:02,420 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 32 treesize of output 34 [2018-11-22 21:49:03,674 INFO L303 Elim1Store]: Index analysis took 1253 ms [2018-11-22 21:49:03,675 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-11-22 21:49:05,819 INFO L303 Elim1Store]: Index analysis took 2143 ms [2018-11-22 21:49:05,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-22 21:49:05,820 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-22 21:49:06,933 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:07,839 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:09,082 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:10,522 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:16,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:17,777 INFO L303 Elim1Store]: Index analysis took 2515 ms [2018-11-22 21:49:17,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 80 [2018-11-22 21:49:18,192 INFO L303 Elim1Store]: Index analysis took 323 ms [2018-11-22 21:49:18,227 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 4 case distinctions, treesize of input 59 treesize of output 63 [2018-11-22 21:49:18,228 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-11-22 21:49:29,183 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-11-22 21:49:29,184 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-22 21:49:41,574 INFO L303 Elim1Store]: Index analysis took 239 ms [2018-11-22 21:49:41,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 59 [2018-11-22 21:49:41,621 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 8 xjuncts. [2018-11-22 21:49:48,809 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-22 21:49:55,754 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-11-22 21:49:55,834 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-11-22 21:49:55,835 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 21:49:56,565 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-11-22 21:49:56,667 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-11-22 21:49:56,669 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-11-22 21:49:56,670 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-22 21:49:56,745 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:56,755 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-11-22 21:49:56,809 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 36 [2018-11-22 21:49:56,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:56,837 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 19 treesize of output 25 [2018-11-22 21:49:57,054 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 21:49:57,054 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_46 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-11-22 21:49:57,057 INFO L168 Benchmark]: Toolchain (without parser) took 516704.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.0 MB). Free memory was 944.4 MB in the beginning and 969.6 MB in the end (delta: -25.2 MB). Peak memory consumption was 211.8 MB. Max. memory is 11.5 GB. [2018-11-22 21:49:57,057 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:49:57,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 512.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2018-11-22 21:49:57,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:49:57,058 INFO L168 Benchmark]: Boogie Preprocessor took 34.91 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-11-22 21:49:57,058 INFO L168 Benchmark]: RCFGBuilder took 2436.70 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-11-22 21:49:57,059 INFO L168 Benchmark]: TraceAbstraction took 513686.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 969.6 MB in the end (delta: 127.0 MB). Peak memory consumption was 207.2 MB. Max. memory is 11.5 GB. [2018-11-22 21:49:57,060 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 512.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.18 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. * Boogie Preprocessor took 34.91 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. * RCFGBuilder took 2436.70 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 513686.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 969.6 MB in the end (delta: 127.0 MB). Peak memory consumption was 207.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_46 input size 11 context size 11 output size 11 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_46 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...