./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/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 30338be39fffa4ca48f26b164131a7bd561f2b23 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/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 30338be39fffa4ca48f26b164131a7bd561f2b23 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_29 term size 33 --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:06:27,766 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:06:27,768 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:06:27,778 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:06:27,778 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:06:27,780 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:06:27,781 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:06:27,782 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:06:27,784 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:06:27,785 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:06:27,785 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:06:27,786 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:06:27,786 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:06:27,788 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:06:27,789 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:06:27,790 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:06:27,790 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:06:27,792 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:06:27,794 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:06:27,796 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:06:27,797 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:06:27,798 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:06:27,800 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:06:27,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:06:27,801 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:06:27,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:06:27,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:06:27,804 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:06:27,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:06:27,806 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:06:27,806 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:06:27,807 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:06:27,807 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:06:27,808 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:06:27,808 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:06:27,810 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:06:27,810 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 21:06:27,828 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:06:27,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:06:27,830 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:06:27,830 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 21:06:27,830 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 21:06:27,831 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 21:06:27,831 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 21:06:27,832 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 21:06:27,832 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 21:06:27,832 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 21:06:27,832 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 21:06:27,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:06:27,835 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:06:27,835 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:06:27,835 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:06:27,835 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:06:27,835 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:06:27,835 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:06:27,836 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:06:27,836 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:06:27,836 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:06:27,836 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:06:27,836 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:06:27,836 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:06:27,837 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:06:27,837 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:06:27,837 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:06:27,837 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:06:27,837 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:06:27,837 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:06:27,837 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 21:06:27,838 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:06:27,838 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:06:27,838 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:06:27,838 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_b7fe73fc-227a-403f-9de4-30514aef523c/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 -> 30338be39fffa4ca48f26b164131a7bd561f2b23 [2018-10-26 21:06:27,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:06:27,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:06:27,898 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:06:27,900 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:06:27,901 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:06:27,901 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:06:27,959 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/data/60a16cdf1/a9e20107bee44ff085f3010674cd64da/FLAG84fdc449a [2018-10-26 21:06:28,414 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:06:28,415 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:06:28,426 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/data/60a16cdf1/a9e20107bee44ff085f3010674cd64da/FLAG84fdc449a [2018-10-26 21:06:28,441 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/data/60a16cdf1/a9e20107bee44ff085f3010674cd64da [2018-10-26 21:06:28,445 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:06:28,446 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:06:28,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:06:28,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:06:28,451 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:06:28,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:06:28" (1/1) ... [2018-10-26 21:06:28,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df825d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:28, skipping insertion in model container [2018-10-26 21:06:28,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:06:28" (1/1) ... [2018-10-26 21:06:28,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:06:28,503 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:06:28,767 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:06:28,779 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:06:28,845 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:06:28,906 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:06:28,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:28 WrapperNode [2018-10-26 21:06:28,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:06:28,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:06:28,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:06:28,908 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:06:28,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:28" (1/1) ... [2018-10-26 21:06:28,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:28" (1/1) ... [2018-10-26 21:06:29,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:06:29,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:06:29,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:06:29,059 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:06:29,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:28" (1/1) ... [2018-10-26 21:06:29,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:28" (1/1) ... [2018-10-26 21:06:29,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:28" (1/1) ... [2018-10-26 21:06:29,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:28" (1/1) ... [2018-10-26 21:06:29,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:28" (1/1) ... [2018-10-26 21:06:29,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:28" (1/1) ... [2018-10-26 21:06:29,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:28" (1/1) ... [2018-10-26 21:06:29,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:06:29,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:06:29,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:06:29,126 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:06:29,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:06:29,206 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-10-26 21:06:29,207 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-10-26 21:06:29,207 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:06:29,208 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-26 21:06:29,208 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-10-26 21:06:29,208 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-10-26 21:06:29,208 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-10-26 21:06:29,208 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-10-26 21:06:29,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:06:29,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:06:29,209 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:06:29,209 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:06:29,209 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-10-26 21:06:29,209 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-10-26 21:06:29,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:06:29,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:06:29,868 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:06:29,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:06:29 BoogieIcfgContainer [2018-10-26 21:06:29,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:06:29,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:06:29,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:06:29,872 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:06:29,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:06:28" (1/3) ... [2018-10-26 21:06:29,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f967793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:06:29, skipping insertion in model container [2018-10-26 21:06:29,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:28" (2/3) ... [2018-10-26 21:06:29,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f967793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:06:29, skipping insertion in model container [2018-10-26 21:06:29,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:06:29" (3/3) ... [2018-10-26 21:06:29,877 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:06:29,884 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:06:29,891 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:06:29,907 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:06:29,939 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:06:29,939 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:06:29,940 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:06:29,940 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:06:29,940 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:06:29,941 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:06:29,941 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:06:29,941 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:06:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-10-26 21:06:29,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 21:06:29,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:06:29,965 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:06:29,968 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:06:29,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash 305391789, now seen corresponding path program 1 times [2018-10-26 21:06:29,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:06:30,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:06:30,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:30,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:06:30,037 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:06:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:06:30,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:06:30,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 21:06:30,152 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:06:30,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 21:06:30,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 21:06:30,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 21:06:30,174 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2018-10-26 21:06:30,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:06:30,200 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2018-10-26 21:06:30,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 21:06:30,201 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-10-26 21:06:30,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:06:30,211 INFO L225 Difference]: With dead ends: 96 [2018-10-26 21:06:30,211 INFO L226 Difference]: Without dead ends: 41 [2018-10-26 21:06:30,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 21:06:30,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-26 21:06:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-26 21:06:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-26 21:06:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-10-26 21:06:30,258 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 29 [2018-10-26 21:06:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:06:30,259 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-10-26 21:06:30,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 21:06:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-10-26 21:06:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 21:06:30,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:06:30,261 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:06:30,261 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:06:30,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:30,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2050074932, now seen corresponding path program 1 times [2018-10-26 21:06:30,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:06:30,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:06:30,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:30,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:06:30,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:06:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:06:30,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:06:30,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-26 21:06:30,639 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:06:30,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 21:06:30,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 21:06:30,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:06:30,642 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 10 states. [2018-10-26 21:06:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:06:31,097 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-10-26 21:06:31,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 21:06:31,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-10-26 21:06:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:06:31,099 INFO L225 Difference]: With dead ends: 58 [2018-10-26 21:06:31,099 INFO L226 Difference]: Without dead ends: 55 [2018-10-26 21:06:31,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:06:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-26 21:06:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2018-10-26 21:06:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-26 21:06:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-10-26 21:06:31,111 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 31 [2018-10-26 21:06:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:06:31,113 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-10-26 21:06:31,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 21:06:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-10-26 21:06:31,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 21:06:31,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:06:31,115 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:06:31,116 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:06:31,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:31,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2050076606, now seen corresponding path program 1 times [2018-10-26 21:06:31,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:06:31,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:06:31,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:31,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:06:31,119 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:06:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:06:31,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:06:31,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:06:31,221 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:06:31,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:06:31,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:06:31,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:06:31,222 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 5 states. [2018-10-26 21:06:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:06:31,305 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-10-26 21:06:31,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:06:31,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-10-26 21:06:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:06:31,307 INFO L225 Difference]: With dead ends: 84 [2018-10-26 21:06:31,307 INFO L226 Difference]: Without dead ends: 52 [2018-10-26 21:06:31,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:06:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-26 21:06:31,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-10-26 21:06:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-26 21:06:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-10-26 21:06:31,317 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 31 [2018-10-26 21:06:31,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:06:31,317 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-10-26 21:06:31,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:06:31,317 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-10-26 21:06:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:06:31,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:06:31,318 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:06:31,319 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:06:31,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:31,320 INFO L82 PathProgramCache]: Analyzing trace with hash -770662756, now seen corresponding path program 1 times [2018-10-26 21:06:31,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:06:31,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:06:31,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:31,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:06:31,322 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:06:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 21:06:31,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:06:31,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:06:31,440 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:06:31,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:06:31,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:06:31,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:06:31,441 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-10-26 21:06:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:06:31,547 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2018-10-26 21:06:31,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:06:31,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-26 21:06:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:06:31,549 INFO L225 Difference]: With dead ends: 90 [2018-10-26 21:06:31,549 INFO L226 Difference]: Without dead ends: 52 [2018-10-26 21:06:31,550 INFO L605 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-10-26 21:06:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-26 21:06:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-10-26 21:06:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-26 21:06:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-10-26 21:06:31,557 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 42 [2018-10-26 21:06:31,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:06:31,557 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-10-26 21:06:31,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:06:31,558 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-10-26 21:06:31,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:06:31,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:06:31,559 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:06:31,560 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:06:31,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:31,561 INFO L82 PathProgramCache]: Analyzing trace with hash -630114146, now seen corresponding path program 1 times [2018-10-26 21:06:31,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:06:31,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:06:31,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:31,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:06:31,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:06:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 21:06:31,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:06:31,859 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:06:31,861 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-10-26 21:06:31,863 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [18], [23], [25], [29], [30], [31], [33], [36], [55], [59], [61], [63], [67], [73], [76], [89], [107], [113], [115], [116], [117], [118], [119], [120], [121], [122], [123], [125], [126], [127], [128] [2018-10-26 21:06:31,913 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:06:31,913 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:06:32,426 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 21:06:32,427 INFO L272 AbstractInterpreter]: Visited 20 different actions 31 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2018-10-26 21:06:32,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:32,484 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 21:06:32,895 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 85.26% of their original sizes. [2018-10-26 21:06:32,895 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 21:06:34,124 INFO L415 sIntCurrentIteration]: We unified 41 AI predicates to 41 [2018-10-26 21:06:34,124 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 21:06:34,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:06:34,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-10-26 21:06:34,125 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:06:34,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 21:06:34,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 21:06:34,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:06:34,126 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 13 states. [2018-10-26 21:06:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:06:36,834 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-10-26 21:06:36,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:06:36,834 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-10-26 21:06:36,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:06:36,835 INFO L225 Difference]: With dead ends: 95 [2018-10-26 21:06:36,836 INFO L226 Difference]: Without dead ends: 63 [2018-10-26 21:06:36,836 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-10-26 21:06:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-26 21:06:36,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-10-26 21:06:36,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-26 21:06:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-10-26 21:06:36,858 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 42 [2018-10-26 21:06:36,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:06:36,858 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-10-26 21:06:36,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 21:06:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-10-26 21:06:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 21:06:36,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:06:36,860 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:06:36,860 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:06:36,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:36,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1069337020, now seen corresponding path program 1 times [2018-10-26 21:06:36,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:06:36,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:06:36,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:36,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:06:36,862 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:06:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:37,656 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-10-26 21:06:37,948 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-10-26 21:06:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:06:38,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:06:38,066 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:06:38,067 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-10-26 21:06:38,067 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [18], [21], [23], [25], [29], [30], [31], [33], [36], [55], [59], [61], [63], [67], [73], [76], [89], [107], [113], [115], [116], [117], [118], [119], [120], [121], [122], [123], [125], [126], [127], [128] [2018-10-26 21:06:38,070 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:06:38,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:06:38,699 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 21:06:38,699 INFO L272 AbstractInterpreter]: Visited 38 different actions 120 times. Merged at 18 different actions 40 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 48 variables. [2018-10-26 21:06:38,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:38,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 21:06:38,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:06:38,702 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:06:38,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:38,714 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 21:06:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:38,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:06:38,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:06:38,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:06:38,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:38,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:39,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:39,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-26 21:06:39,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:06:39,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:06:39,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:39,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:39,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:06:39,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:06:39,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:39,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:39,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:39,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-10-26 21:06:39,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-26 21:06:39,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-10-26 21:06:39,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:39,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:39,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 21:06:39,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-10-26 21:06:39,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:39,372 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:39,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:39,376 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-10-26 21:06:39,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 21:06:39,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 21:06:39,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:39,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:39,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:39,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2018-10-26 21:06:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 21:06:39,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:06:39,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-10-26 21:06:39,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-10-26 21:06:39,866 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:06:39,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:06:39,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-10-26 21:06:39,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-26 21:06:39,883 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:06:39,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:06:39,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-10-26 21:06:39,902 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:54 [2018-10-26 21:06:40,462 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2018-10-26 21:06:40,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-10-26 21:06:40,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-10-26 21:06:40,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:40,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:40,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-10-26 21:06:40,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 21:06:40,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:40,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:40,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-10-26 21:06:40,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-10-26 21:06:40,500 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:40,511 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:40,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-10-26 21:06:40,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 21:06:40,516 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:40,519 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:40,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:06:40,533 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:42, output treesize:10 [2018-10-26 21:06:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 21:06:40,592 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:06:40,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [18] total 33 [2018-10-26 21:06:40,592 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:06:40,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:06:40,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:06:40,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=976, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 21:06:40,593 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 12 states. [2018-10-26 21:06:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:06:41,072 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2018-10-26 21:06:41,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:06:41,075 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-10-26 21:06:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:06:41,076 INFO L225 Difference]: With dead ends: 71 [2018-10-26 21:06:41,076 INFO L226 Difference]: Without dead ends: 69 [2018-10-26 21:06:41,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=118, Invalid=1364, Unknown=0, NotChecked=0, Total=1482 [2018-10-26 21:06:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-26 21:06:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2018-10-26 21:06:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-26 21:06:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-10-26 21:06:41,087 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 53 [2018-10-26 21:06:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:06:41,088 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-10-26 21:06:41,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:06:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-10-26 21:06:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 21:06:41,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:06:41,089 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:06:41,089 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:06:41,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:41,090 INFO L82 PathProgramCache]: Analyzing trace with hash 847990952, now seen corresponding path program 1 times [2018-10-26 21:06:41,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:06:41,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:06:41,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:41,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:06:41,095 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:06:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:41,628 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-10-26 21:06:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 21:06:41,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:06:41,796 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:06:41,797 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-10-26 21:06:41,797 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [18], [21], [23], [25], [29], [30], [31], [33], [36], [55], [59], [61], [63], [67], [71], [73], [78], [84], [89], [107], [113], [115], [116], [117], [118], [119], [120], [121], [122], [123], [125], [126], [127], [128] [2018-10-26 21:06:41,801 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:06:41,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:06:45,117 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 21:06:45,117 INFO L272 AbstractInterpreter]: Visited 40 different actions 280 times. Merged at 20 different actions 197 times. Widened at 2 different actions 46 times. Found 8 fixpoints after 4 different actions. Largest state had 51 variables. [2018-10-26 21:06:45,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:45,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 21:06:45,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:06:45,156 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:06:45,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:45,170 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 21:06:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:45,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:06:45,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:06:45,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:06:45,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:45,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:45,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:45,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-10-26 21:06:45,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 21:06:45,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-10-26 21:06:45,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:45,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:45,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 21:06:45,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:14 [2018-10-26 21:06:45,354 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base Int) (|node_create_write~$Pointer$_#value.base| Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) 4 0) 8 |node_create_write~$Pointer$_#value.base|)))) is different from true [2018-10-26 21:06:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2018-10-26 21:06:45,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:06:45,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-10-26 21:06:45,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-10-26 21:06:45,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:45,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:45,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 21:06:45,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:19 [2018-10-26 21:06:45,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-10-26 21:06:45,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-10-26 21:06:45,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:46,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:46,208 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:06:46,209 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:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:264) 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:383) 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:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-26 21:06:46,212 INFO L168 Benchmark]: Toolchain (without parser) took 17767.44 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 723.0 MB). Free memory was 957.0 MB in the beginning and 1.3 GB in the end (delta: -389.7 MB). Peak memory consumption was 333.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:06:46,213 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:06:46,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 459.72 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 932.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-26 21:06:46,214 INFO L168 Benchmark]: Boogie Procedure Inliner took 151.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 932.8 MB in the beginning and 1.2 GB in the end (delta: -235.4 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-10-26 21:06:46,214 INFO L168 Benchmark]: Boogie Preprocessor took 67.56 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:06:46,215 INFO L168 Benchmark]: RCFGBuilder took 742.33 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: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:06:46,215 INFO L168 Benchmark]: TraceAbstraction took 16342.63 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 547.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.3 MB). Peak memory consumption was 333.1 MB. Max. memory is 11.5 GB. [2018-10-26 21:06:46,222 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 459.72 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 932.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 151.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 932.8 MB in the beginning and 1.2 GB in the end (delta: -235.4 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.56 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 742.33 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: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16342.63 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 547.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.3 MB). Peak memory consumption was 333.1 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:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:06:48,376 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:06:48,377 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:06:48,388 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:06:48,388 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:06:48,389 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:06:48,390 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:06:48,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:06:48,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:06:48,395 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:06:48,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:06:48,396 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:06:48,397 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:06:48,398 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:06:48,398 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:06:48,400 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:06:48,401 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:06:48,402 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:06:48,404 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:06:48,406 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:06:48,407 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:06:48,408 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:06:48,419 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:06:48,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:06:48,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:06:48,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:06:48,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:06:48,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:06:48,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:06:48,425 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:06:48,425 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:06:48,425 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:06:48,426 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:06:48,426 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:06:48,427 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:06:48,428 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:06:48,428 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 21:06:48,441 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:06:48,441 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:06:48,442 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:06:48,442 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 21:06:48,443 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 21:06:48,443 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 21:06:48,443 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 21:06:48,444 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 21:06:48,445 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:06:48,445 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:06:48,445 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:06:48,445 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:06:48,445 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:06:48,445 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:06:48,445 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:06:48,446 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 21:06:48,446 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 21:06:48,446 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:06:48,446 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:06:48,446 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:06:48,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:06:48,447 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:06:48,447 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:06:48,449 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:06:48,449 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:06:48,449 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:06:48,449 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:06:48,450 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:06:48,450 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 21:06:48,450 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:06:48,450 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 21:06:48,450 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 21:06:48,450 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_b7fe73fc-227a-403f-9de4-30514aef523c/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 -> 30338be39fffa4ca48f26b164131a7bd561f2b23 [2018-10-26 21:06:48,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:06:48,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:06:48,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:06:48,505 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:06:48,506 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:06:48,506 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:06:48,565 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/data/3f49cd5a1/945015d4ede140d284d99f6e2b3ad07d/FLAGe72d37388 [2018-10-26 21:06:49,035 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:06:49,036 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/sv-benchmarks/c/list-simple/dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:06:49,047 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/data/3f49cd5a1/945015d4ede140d284d99f6e2b3ad07d/FLAGe72d37388 [2018-10-26 21:06:49,060 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/data/3f49cd5a1/945015d4ede140d284d99f6e2b3ad07d [2018-10-26 21:06:49,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:06:49,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:06:49,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:06:49,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:06:49,072 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:06:49,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:06:49" (1/1) ... [2018-10-26 21:06:49,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3275be7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:49, skipping insertion in model container [2018-10-26 21:06:49,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:06:49" (1/1) ... [2018-10-26 21:06:49,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:06:49,131 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:06:49,493 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:06:49,506 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:06:49,587 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:06:49,648 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:06:49,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:49 WrapperNode [2018-10-26 21:06:49,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:06:49,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:06:49,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:06:49,649 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:06:49,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:49" (1/1) ... [2018-10-26 21:06:49,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:49" (1/1) ... [2018-10-26 21:06:49,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:06:49,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:06:49,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:06:49,704 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:06:49,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:49" (1/1) ... [2018-10-26 21:06:49,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:49" (1/1) ... [2018-10-26 21:06:49,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:49" (1/1) ... [2018-10-26 21:06:49,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:49" (1/1) ... [2018-10-26 21:06:49,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:49" (1/1) ... [2018-10-26 21:06:49,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:49" (1/1) ... [2018-10-26 21:06:49,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:49" (1/1) ... [2018-10-26 21:06:49,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:06:49,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:06:49,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:06:49,833 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:06:49,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:06:49,877 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-10-26 21:06:49,878 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-10-26 21:06:49,878 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:06:49,878 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-26 21:06:49,878 INFO L130 BoogieDeclarations]: Found specification of procedure dll_append [2018-10-26 21:06:49,878 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_append [2018-10-26 21:06:49,878 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-10-26 21:06:49,878 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-10-26 21:06:49,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:06:49,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:06:49,879 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:06:49,880 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:06:49,880 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-10-26 21:06:49,881 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-10-26 21:06:49,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:06:49,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:06:50,699 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:06:50,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:06:50 BoogieIcfgContainer [2018-10-26 21:06:50,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:06:50,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:06:50,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:06:50,704 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:06:50,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:06:49" (1/3) ... [2018-10-26 21:06:50,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b57c66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:06:50, skipping insertion in model container [2018-10-26 21:06:50,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:06:49" (2/3) ... [2018-10-26 21:06:50,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b57c66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:06:50, skipping insertion in model container [2018-10-26 21:06:50,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:06:50" (3/3) ... [2018-10-26 21:06:50,707 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:06:50,718 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:06:50,726 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:06:50,742 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:06:50,772 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:06:50,773 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:06:50,773 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:06:50,773 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:06:50,773 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:06:50,774 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:06:50,774 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:06:50,775 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:06:50,775 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:06:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-10-26 21:06:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 21:06:50,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:06:50,799 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:06:50,801 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:06:50,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:50,807 INFO L82 PathProgramCache]: Analyzing trace with hash 305391789, now seen corresponding path program 1 times [2018-10-26 21:06:50,812 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:06:50,813 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 21:06:50,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:50,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:06:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:06:50,955 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:06:50,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:06:50,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 21:06:50,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 21:06:50,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 21:06:50,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 21:06:50,990 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2018-10-26 21:06:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:06:51,021 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2018-10-26 21:06:51,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 21:06:51,023 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-10-26 21:06:51,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:06:51,034 INFO L225 Difference]: With dead ends: 96 [2018-10-26 21:06:51,035 INFO L226 Difference]: Without dead ends: 41 [2018-10-26 21:06:51,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 21:06:51,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-26 21:06:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-26 21:06:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-26 21:06:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-10-26 21:06:51,090 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 29 [2018-10-26 21:06:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:06:51,091 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-10-26 21:06:51,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 21:06:51,091 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-10-26 21:06:51,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 21:06:51,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:06:51,093 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:06:51,094 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:06:51,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:51,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2050074932, now seen corresponding path program 1 times [2018-10-26 21:06:51,095 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:06:51,095 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 21:06:51,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:51,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:06:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:06:51,483 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:06:51,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:06:51,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:06:51,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:06:51,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:06:51,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:06:51,495 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 5 states. [2018-10-26 21:06:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:06:51,625 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-10-26 21:06:51,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:06:51,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-10-26 21:06:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:06:51,628 INFO L225 Difference]: With dead ends: 74 [2018-10-26 21:06:51,628 INFO L226 Difference]: Without dead ends: 47 [2018-10-26 21:06:51,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:06:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-26 21:06:51,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-10-26 21:06:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-26 21:06:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-10-26 21:06:51,640 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 31 [2018-10-26 21:06:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:06:51,641 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-10-26 21:06:51,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:06:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-10-26 21:06:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:06:51,642 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:06:51,643 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:06:51,643 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:06:51,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:51,645 INFO L82 PathProgramCache]: Analyzing trace with hash -770664430, now seen corresponding path program 1 times [2018-10-26 21:06:51,645 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:06:51,645 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 21:06:51,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:51,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:06:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:06:51,796 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:06:51,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:06:51,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:06:51,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:06:51,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:06:51,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:06:51,803 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2018-10-26 21:06:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:06:51,888 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-10-26 21:06:51,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:06:51,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-26 21:06:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:06:51,890 INFO L225 Difference]: With dead ends: 80 [2018-10-26 21:06:51,890 INFO L226 Difference]: Without dead ends: 47 [2018-10-26 21:06:51,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-10-26 21:06:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-26 21:06:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-10-26 21:06:51,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-26 21:06:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-10-26 21:06:51,900 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 42 [2018-10-26 21:06:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:06:51,900 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-10-26 21:06:51,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:06:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-10-26 21:06:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:06:51,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:06:51,902 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:06:51,902 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:06:51,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:51,902 INFO L82 PathProgramCache]: Analyzing trace with hash -630115820, now seen corresponding path program 1 times [2018-10-26 21:06:51,903 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:06:51,903 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 21:06:51,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:52,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:06:52,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:06:52,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:06:52,706 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 21:06:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 21:06:53,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:06:53,011 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/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-10-26 21:06:53,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:53,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:06:53,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:06:53,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:06:53,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:53,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:53,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:53,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-10-26 21:06:53,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-10-26 21:06:53,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-10-26 21:06:53,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:53,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:53,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:53,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-10-26 21:06:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 21:06:53,585 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:06:53,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:06:53,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6, 6] total 17 [2018-10-26 21:06:53,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 21:06:53,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 21:06:53,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-10-26 21:06:53,617 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 17 states. [2018-10-26 21:06:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:06:54,755 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-10-26 21:06:54,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 21:06:54,756 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-10-26 21:06:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:06:54,757 INFO L225 Difference]: With dead ends: 94 [2018-10-26 21:06:54,758 INFO L226 Difference]: Without dead ends: 67 [2018-10-26 21:06:54,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-10-26 21:06:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-26 21:06:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2018-10-26 21:06:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-26 21:06:54,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-10-26 21:06:54,770 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 42 [2018-10-26 21:06:54,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:06:54,770 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-10-26 21:06:54,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 21:06:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-10-26 21:06:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 21:06:54,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:06:54,773 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:06:54,773 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:06:54,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:54,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1069337020, now seen corresponding path program 1 times [2018-10-26 21:06:54,774 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:06:54,775 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/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-10-26 21:06:54,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:55,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:06:55,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:06:55,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:06:55,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-26 21:06:55,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:06:55,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:06:55,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:06:55,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:06:55,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,228 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-10-26 21:06:55,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 21:06:55,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 21:06:55,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 21:06:55,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-10-26 21:06:55,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,367 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:16 [2018-10-26 21:06:55,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 21:06:55,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 21:06:55,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:55,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-10-26 21:06:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 21:06:55,513 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:06:55,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:06:55,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-26 21:06:55,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:06:55,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:06:55,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:06:55,517 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 12 states. [2018-10-26 21:06:56,044 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 21:06:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:06:56,539 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-10-26 21:06:56,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:06:56,540 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-10-26 21:06:56,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:06:56,541 INFO L225 Difference]: With dead ends: 63 [2018-10-26 21:06:56,541 INFO L226 Difference]: Without dead ends: 61 [2018-10-26 21:06:56,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-10-26 21:06:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-26 21:06:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2018-10-26 21:06:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-26 21:06:56,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-10-26 21:06:56,553 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 53 [2018-10-26 21:06:56,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:06:56,553 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-10-26 21:06:56,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:06:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-10-26 21:06:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 21:06:56,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:06:56,556 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:06:56,557 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:06:56,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:06:56,557 INFO L82 PathProgramCache]: Analyzing trace with hash 847990952, now seen corresponding path program 1 times [2018-10-26 21:06:56,558 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:06:56,559 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/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-10-26 21:06:56,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:57,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:06:57,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 21:06:57,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:57,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:57,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 21:06:57,066 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#Ultimate.alloc_#res.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#Ultimate.alloc_#res.base|) (_ bv0 1)) (= (store |c_old(#valid)| |node_create_#Ultimate.alloc_#res.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-10-26 21:06:57,504 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:06:57,505 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:06:57,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-10-26 21:06:57,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-10-26 21:06:57,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:57,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:57,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:06:57,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:27 [2018-10-26 21:06:57,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:06:57,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:06:57,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:57,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:57,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:06:57,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2018-10-26 21:06:58,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:06:58,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:06:58,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:58,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:58,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-26 21:06:58,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:38 [2018-10-26 21:06:58,308 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:58,308 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 6 variables, input treesize:76, output treesize:1 [2018-10-26 21:06:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 16 not checked. [2018-10-26 21:06:58,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:06:58,923 WARN L179 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-10-26 21:06:59,153 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-26 21:06:59,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:06:59,418 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/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-10-26 21:06:59,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:06:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:06:59,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:06:59,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:06:59,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:06:59,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:06:59,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:59,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:06:59,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-10-26 21:07:00,207 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#ptr.base| (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_write~$Pointer$_#ptr.base| (store (store (select |c_old(#memory_$Pointer$.base)| |node_create_write~$Pointer$_#ptr.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) |node_create_write~$Pointer$_#value.base|)))) is different from true [2018-10-26 21:07:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2018-10-26 21:07:00,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:07:00,785 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-26 21:07:01,172 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-26 21:07:01,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:07:01,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-10-26 21:07:01,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-26 21:07:01,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-26 21:07:01,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1141, Unknown=27, NotChecked=138, Total=1406 [2018-10-26 21:07:01,578 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 36 states. [2018-10-26 21:07:02,060 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-10-26 21:07:02,819 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-10-26 21:07:06,289 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-26 21:07:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:07:08,742 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2018-10-26 21:07:08,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-26 21:07:08,742 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 56 [2018-10-26 21:07:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:07:08,745 INFO L225 Difference]: With dead ends: 102 [2018-10-26 21:07:08,745 INFO L226 Difference]: Without dead ends: 61 [2018-10-26 21:07:08,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=200, Invalid=2375, Unknown=85, NotChecked=202, Total=2862 [2018-10-26 21:07:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-26 21:07:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2018-10-26 21:07:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-26 21:07:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-10-26 21:07:08,761 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 56 [2018-10-26 21:07:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:07:08,762 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-10-26 21:07:08,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-26 21:07:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-10-26 21:07:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-26 21:07:08,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:07:08,765 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:07:08,765 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:07:08,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:07:08,765 INFO L82 PathProgramCache]: Analyzing trace with hash 551304392, now seen corresponding path program 1 times [2018-10-26 21:07:08,766 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:07:08,766 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/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-10-26 21:07:08,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:07:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:07:09,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:07:09,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 21:07:09,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:09,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:07:09,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 21:07:09,392 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_write~intINTTYPE4_#ptr.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |dll_create_write~intINTTYPE4_#ptr.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |dll_create_write~intINTTYPE4_#ptr.base| (_ bv1 1))))) is different from true [2018-10-26 21:07:09,888 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:09,889 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:09,891 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:09,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-10-26 21:07:09,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-10-26 21:07:09,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:09,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:07:09,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:07:09,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-10-26 21:07:10,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:07:10,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:07:10,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:10,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:07:10,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:07:10,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:56 [2018-10-26 21:07:11,054 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_append_~last~0.offset (_ BitVec 32)) (node_create_~temp~0.offset (_ BitVec 32)) (|node_create_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|dll_append_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32)) (|dll_append_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (and (= (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (select |c_old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)) |node_create_write~$Pointer$_#ptr.offset| |node_create_write~$Pointer$_#value.base|)))) (let ((.cse2 (select (select .cse1 |c_dll_append_#in~head.base|) |c_dll_append_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd dll_append_~last~0.offset (_ bv4 32)) dll_append_~new_last~0.base)))))) (store .cse0 dll_append_~new_last~0.base (store (select .cse0 dll_append_~new_last~0.base) |dll_append_write~$Pointer$_#ptr.offset| |dll_append_write~$Pointer$_#value.base|))) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| dll_append_~new_last~0.base) (_ bv0 1)))) is different from true [2018-10-26 21:07:12,416 WARN L179 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2018-10-26 21:07:12,460 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:12,472 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:12,482 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:12,490 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:07:12,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-10-26 21:07:12,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:12,687 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:12,693 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:12,781 INFO L303 Elim1Store]: Index analysis took 109 ms [2018-10-26 21:07:12,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 96 [2018-10-26 21:07:12,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-10-26 21:07:12,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 21:07:12,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-26 21:07:12,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:07:13,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 77 [2018-10-26 21:07:13,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-26 21:07:13,116 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:13,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 66 [2018-10-26 21:07:13,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-10-26 21:07:13,242 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-26 21:07:13,306 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:07:13,406 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:07:13,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 81 [2018-10-26 21:07:13,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-26 21:07:13,460 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:13,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 73 [2018-10-26 21:07:13,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 44 [2018-10-26 21:07:13,778 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-10-26 21:07:14,073 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 21:07:14,293 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-26 21:07:14,567 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-10-26 21:07:14,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-26 21:07:14,917 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:210, output treesize:124 [2018-10-26 21:07:15,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2018-10-26 21:07:15,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 11 [2018-10-26 21:07:15,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:15,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-10-26 21:07:15,081 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:15,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:07:15,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:07:15,092 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:56, output treesize:4 [2018-10-26 21:07:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2018-10-26 21:07:15,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:07:16,109 WARN L179 SmtUtils]: Spent 658.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-10-26 21:07:16,231 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-26 21:07:16,691 WARN L179 SmtUtils]: Spent 459.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-26 21:07:16,891 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-26 21:07:23,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:07:23,484 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7fe73fc-227a-403f-9de4-30514aef523c/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:07:23,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:07:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:07:23,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:07:23,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 21:07:23,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:23,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:07:23,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-10-26 21:07:24,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:07:24,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:07:24,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:24,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:07:24,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:07:24,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:07:24,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:24,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:07:24,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:07:24,419 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-10-26 21:07:25,919 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_append_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.offset| (_ BitVec 32)) (dll_append_~new_last~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| dll_append_~new_last~0.base (store (store (select |c_old(#memory_$Pointer$.base)| dll_append_~new_last~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) |node_create_write~$Pointer$_#value.base|)))) (let ((.cse2 (select (select .cse1 |c_dll_append_#in~head.base|) |c_dll_append_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| dll_append_~new_last~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| dll_append_~new_last~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) |node_create_write~$Pointer$_#value.offset|)) |c_dll_append_#in~head.base|) |c_dll_append_#in~head.offset|) (_ bv4 32)) dll_append_~new_last~0.base)))))) (store .cse0 dll_append_~new_last~0.base (store (select .cse0 dll_append_~new_last~0.base) (_ bv8 32) |dll_append_write~$Pointer$_#value.base|)))) (= (select |c_old(#valid)| dll_append_~new_last~0.base) (_ bv0 1)))) is different from true [2018-10-26 21:07:27,461 WARN L179 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 112 DAG size of output: 42 [2018-10-26 21:07:27,492 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:27,503 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:27,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 8 [2018-10-26 21:07:27,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:27,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 101 [2018-10-26 21:07:27,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 95 [2018-10-26 21:07:27,606 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:27,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:07:27,715 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:27,811 INFO L303 Elim1Store]: Index analysis took 110 ms [2018-10-26 21:07:27,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 91 [2018-10-26 21:07:32,235 WARN L179 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-10-26 21:07:32,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 81 [2018-10-26 21:07:32,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-10-26 21:07:32,255 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:32,308 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:07:33,948 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:33,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 62 [2018-10-26 21:07:33,959 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:33,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-10-26 21:07:33,973 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:34,046 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:07:35,714 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-10-26 21:07:35,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 67 [2018-10-26 21:07:35,795 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:35,799 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:35,800 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:07:35,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 74 [2018-10-26 21:07:35,814 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:35,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 21:07:35,819 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:35,856 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:07:36,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-10-26 21:07:36,512 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-26 21:07:37,179 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:37,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 67 [2018-10-26 21:07:37,307 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:07:37,509 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:07:37,509 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_29 term size 33 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-26 21:07:37,513 INFO L168 Benchmark]: Toolchain (without parser) took 48448.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.7 MB). Free memory was 949.2 MB in the beginning and 1.0 GB in the end (delta: -59.9 MB). Peak memory consumption was 256.8 MB. Max. memory is 11.5 GB. [2018-10-26 21:07:37,513 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:07:37,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 580.65 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 922.4 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-26 21:07:37,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.83 ms. Allocated memory is still 1.0 GB. Free memory was 922.4 MB in the beginning and 917.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:07:37,514 INFO L168 Benchmark]: Boogie Preprocessor took 129.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 917.0 MB in the beginning and 1.1 GB in the end (delta: -231.7 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:07:37,515 INFO L168 Benchmark]: RCFGBuilder took 866.88 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-10-26 21:07:37,525 INFO L168 Benchmark]: TraceAbstraction took 46811.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.4 MB). Peak memory consumption was 261.6 MB. Max. memory is 11.5 GB. [2018-10-26 21:07:37,527 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 580.65 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 922.4 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.83 ms. Allocated memory is still 1.0 GB. Free memory was 922.4 MB in the beginning and 917.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 129.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 917.0 MB in the beginning and 1.1 GB in the end (delta: -231.7 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 866.88 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46811.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.4 MB). Peak memory consumption was 261.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_29 term size 33 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_29 term size 33: 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...