./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/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 0f7cafa734d0f20d504408b2e981cc49af978383 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/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 0f7cafa734d0f20d504408b2e981cc49af978383 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:02:20,002 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:02:20,003 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:02:20,010 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:02:20,010 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:02:20,011 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:02:20,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:02:20,013 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:02:20,013 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:02:20,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:02:20,014 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:02:20,014 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:02:20,015 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:02:20,016 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:02:20,017 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:02:20,017 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:02:20,018 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:02:20,019 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:02:20,020 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:02:20,022 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:02:20,022 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:02:20,023 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:02:20,025 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:02:20,025 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:02:20,025 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:02:20,026 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:02:20,027 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:02:20,027 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:02:20,028 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:02:20,028 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:02:20,029 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:02:20,029 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:02:20,029 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:02:20,029 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:02:20,030 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:02:20,031 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:02:20,031 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 11:02:20,041 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:02:20,041 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:02:20,042 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:02:20,042 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 11:02:20,042 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 11:02:20,042 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 11:02:20,042 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 11:02:20,043 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 11:02:20,043 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 11:02:20,043 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 11:02:20,043 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 11:02:20,043 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 11:02:20,043 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 11:02:20,044 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:02:20,044 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:02:20,044 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:02:20,044 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:02:20,044 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:02:20,045 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:02:20,045 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:02:20,045 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:02:20,045 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:02:20,045 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:02:20,045 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:02:20,046 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:02:20,046 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:02:20,046 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:02:20,046 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:02:20,046 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:02:20,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:02:20,046 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:02:20,047 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:02:20,047 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:02:20,047 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 11:02:20,047 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:02:20,047 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:02:20,047 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 11:02:20,047 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_05bf8015-8b60-4b48-9fa7-9e10197d50b3/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 -> 0f7cafa734d0f20d504408b2e981cc49af978383 [2018-11-18 11:02:20,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:02:20,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:02:20,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:02:20,083 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:02:20,083 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:02:20,084 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 11:02:20,123 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/data/9cecc3c5d/b8d3943a75b243ca927e52d1fa2243c7/FLAG8e42938e6 [2018-11-18 11:02:20,470 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:02:20,471 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 11:02:20,480 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/data/9cecc3c5d/b8d3943a75b243ca927e52d1fa2243c7/FLAG8e42938e6 [2018-11-18 11:02:20,491 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/data/9cecc3c5d/b8d3943a75b243ca927e52d1fa2243c7 [2018-11-18 11:02:20,494 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:02:20,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:02:20,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:02:20,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:02:20,497 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:02:20,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:02:20" (1/1) ... [2018-11-18 11:02:20,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@833b3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:20, skipping insertion in model container [2018-11-18 11:02:20,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:02:20" (1/1) ... [2018-11-18 11:02:20,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:02:20,537 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:02:20,734 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:02:20,741 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:02:20,821 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:02:20,856 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:02:20,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:20 WrapperNode [2018-11-18 11:02:20,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:02:20,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:02:20,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:02:20,858 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:02:20,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:20" (1/1) ... [2018-11-18 11:02:20,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:20" (1/1) ... [2018-11-18 11:02:20,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:02:20,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:02:20,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:02:20,876 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:02:20,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:20" (1/1) ... [2018-11-18 11:02:20,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:20" (1/1) ... [2018-11-18 11:02:20,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:20" (1/1) ... [2018-11-18 11:02:20,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:20" (1/1) ... [2018-11-18 11:02:20,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:20" (1/1) ... [2018-11-18 11:02:20,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:20" (1/1) ... [2018-11-18 11:02:20,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:20" (1/1) ... [2018-11-18 11:02:20,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:02:20,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:02:20,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:02:20,902 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:02:20,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:02:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-18 11:02:20,935 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-18 11:02:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 11:02:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 11:02:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 11:02:20,935 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 11:02:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-18 11:02:20,935 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-18 11:02:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 11:02:20,935 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 11:02:20,935 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 11:02:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:02:20,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:02:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:02:20,936 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:02:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 11:02:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 11:02:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 11:02:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-18 11:02:20,936 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-18 11:02:20,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:02:20,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:02:21,179 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:02:21,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:02:21 BoogieIcfgContainer [2018-11-18 11:02:21,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:02:21,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:02:21,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:02:21,182 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:02:21,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:02:20" (1/3) ... [2018-11-18 11:02:21,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfe6da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:02:21, skipping insertion in model container [2018-11-18 11:02:21,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:20" (2/3) ... [2018-11-18 11:02:21,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfe6da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:02:21, skipping insertion in model container [2018-11-18 11:02:21,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:02:21" (3/3) ... [2018-11-18 11:02:21,184 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 11:02:21,191 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:02:21,196 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:02:21,204 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:02:21,222 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:02:21,222 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:02:21,222 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:02:21,222 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:02:21,223 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:02:21,223 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:02:21,223 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:02:21,223 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:02:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-18 11:02:21,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 11:02:21,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:02:21,238 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-11-18 11:02:21,240 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:02:21,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:21,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1865262772, now seen corresponding path program 1 times [2018-11-18 11:02:21,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:02:21,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:21,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:21,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:21,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:02:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:02:21,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:02:21,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:02:21,358 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:02:21,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 11:02:21,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 11:02:21,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:02:21,371 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2018-11-18 11:02:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:02:21,390 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-11-18 11:02:21,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 11:02:21,391 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-11-18 11:02:21,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:02:21,399 INFO L225 Difference]: With dead ends: 93 [2018-11-18 11:02:21,399 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 11:02:21,402 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:02:21,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 11:02:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-18 11:02:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 11:02:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-18 11:02:21,429 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 31 [2018-11-18 11:02:21,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:02:21,429 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 11:02:21,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 11:02:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 11:02:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 11:02:21,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:02:21,431 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:02:21,432 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:02:21,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:21,432 INFO L82 PathProgramCache]: Analyzing trace with hash 127914466, now seen corresponding path program 1 times [2018-11-18 11:02:21,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:02:21,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:21,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:21,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:21,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:02:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:02:21,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:02:21,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:02:21,504 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:02:21,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:02:21,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:02:21,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:02:21,505 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2018-11-18 11:02:21,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:02:21,529 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-18 11:02:21,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:02:21,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 11:02:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:02:21,531 INFO L225 Difference]: With dead ends: 55 [2018-11-18 11:02:21,531 INFO L226 Difference]: Without dead ends: 45 [2018-11-18 11:02:21,531 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:02:21,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-18 11:02:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-18 11:02:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 11:02:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-18 11:02:21,537 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2018-11-18 11:02:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:02:21,539 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-18 11:02:21,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:02:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-18 11:02:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 11:02:21,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:02:21,540 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:02:21,540 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:02:21,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash 807972836, now seen corresponding path program 1 times [2018-11-18 11:02:21,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:02:21,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:21,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:21,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:21,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:02:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:02:21,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:02:21,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:02:21,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:02:21,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:02:21,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:02:21,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:02:21,605 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2018-11-18 11:02:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:02:21,648 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-18 11:02:21,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:02:21,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-18 11:02:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:02:21,649 INFO L225 Difference]: With dead ends: 76 [2018-11-18 11:02:21,649 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 11:02:21,649 INFO L604 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-11-18 11:02:21,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 11:02:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-11-18 11:02:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 11:02:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-18 11:02:21,654 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 34 [2018-11-18 11:02:21,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:02:21,655 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-18 11:02:21,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:02:21,655 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-18 11:02:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 11:02:21,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:02:21,656 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, 1, 1] [2018-11-18 11:02:21,656 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:02:21,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:21,656 INFO L82 PathProgramCache]: Analyzing trace with hash 612056741, now seen corresponding path program 1 times [2018-11-18 11:02:21,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:02:21,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:21,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:21,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:21,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:02:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 11:02:21,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:02:21,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:02:21,743 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:02:21,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:02:21,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:02:21,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:02:21,744 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 5 states. [2018-11-18 11:02:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:02:21,785 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-18 11:02:21,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:02:21,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-18 11:02:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:02:21,787 INFO L225 Difference]: With dead ends: 54 [2018-11-18 11:02:21,787 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 11:02:21,787 INFO L604 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-11-18 11:02:21,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 11:02:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-18 11:02:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 11:02:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-18 11:02:21,792 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 44 [2018-11-18 11:02:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:02:21,792 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-18 11:02:21,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:02:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-18 11:02:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 11:02:21,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:02:21,793 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-11-18 11:02:21,793 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:02:21,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:21,794 INFO L82 PathProgramCache]: Analyzing trace with hash -329483459, now seen corresponding path program 1 times [2018-11-18 11:02:21,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:02:21,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:21,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:21,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:21,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:02:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 11:02:21,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:02:21,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:02:21,872 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-18 11:02:21,874 INFO L202 CegarAbsIntRunner]: [0], [2], [4], [8], [12], [25], [30], [37], [38], [54], [58], [61], [63], [65], [67], [71], [72], [73], [75], [79], [83], [85], [91], [95], [96], [100], [106], [108], [109], [110], [111], [112], [113], [116], [117], [118], [119], [120], [121], [122] [2018-11-18 11:02:21,901 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:02:21,902 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:02:22,115 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 11:02:22,116 INFO L272 AbstractInterpreter]: Visited 40 different actions 69 times. Merged at 7 different actions 12 times. Never widened. Performed 571 root evaluator evaluations with a maximum evaluation depth of 7. Performed 571 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 2 fixpoints after 2 different actions. Largest state had 35 variables. [2018-11-18 11:02:22,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:22,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 11:02:22,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:02:22,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:02:22,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:22,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 11:02:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:22,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 11:02:22,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:02:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 11:02:22,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:02:22,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-11-18 11:02:22,403 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:02:22,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:02:22,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:02:22,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:02:22,404 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 6 states. [2018-11-18 11:02:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:02:22,444 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-11-18 11:02:22,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:02:22,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-18 11:02:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:02:22,446 INFO L225 Difference]: With dead ends: 79 [2018-11-18 11:02:22,446 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 11:02:22,446 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:02:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 11:02:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-18 11:02:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 11:02:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-18 11:02:22,452 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 46 [2018-11-18 11:02:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:02:22,452 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-18 11:02:22,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:02:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-18 11:02:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 11:02:22,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:02:22,453 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-11-18 11:02:22,454 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:02:22,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:22,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1947332734, now seen corresponding path program 2 times [2018-11-18 11:02:22,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:02:22,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:22,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:22,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:22,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:02:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:23,265 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2018-11-18 11:02:23,464 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2018-11-18 11:02:23,695 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2018-11-18 11:02:23,891 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-11-18 11:02:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 11:02:23,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:02:23,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:02:23,948 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:02:23,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:02:23,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:02:23,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/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-11-18 11:02:23,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 11:02:23,955 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 11:02:23,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 11:02:23,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:02:23,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:24,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 11:02:24,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 11:02:24,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 11:02:24,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:24,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 11:02:24,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:24,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2018-11-18 11:02:38,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:38,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:38,936 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 15 treesize of output 8 [2018-11-18 11:02:38,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:38,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 85 [2018-11-18 11:02:38,964 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 84 treesize of output 83 [2018-11-18 11:02:38,965 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,014 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:39,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 71 treesize of output 86 [2018-11-18 11:02:39,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,083 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 82 treesize of output 68 [2018-11-18 11:02:39,087 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 64 treesize of output 63 [2018-11-18 11:02:39,087 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:39,125 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:39,125 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 11:02:39,127 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:39,128 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 84 [2018-11-18 11:02:39,128 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:39,183 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 55 treesize of output 68 [2018-11-18 11:02:39,188 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 50 treesize of output 59 [2018-11-18 11:02:39,189 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,205 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:39,249 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 63 [2018-11-18 11:02:39,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:39,254 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 11:02:39,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2018-11-18 11:02:39,260 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 11:02:39,270 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 11:02:39,294 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 11:02:39,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:39,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-11-18 11:02:39,336 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 11:02:39,337 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 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-18 11:02:39,337 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,344 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,368 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 11:02:39,476 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 79 treesize of output 67 [2018-11-18 11:02:39,482 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 61 treesize of output 60 [2018-11-18 11:02:39,483 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:39,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:39,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 44 treesize of output 65 [2018-11-18 11:02:39,515 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:39,559 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 62 [2018-11-18 11:02:39,563 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 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-18 11:02:39,563 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,590 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:39,591 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 11:02:39,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2018-11-18 11:02:39,596 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 11:02:39,605 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 11:02:39,628 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 11:02:39,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:39,711 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 61 [2018-11-18 11:02:39,716 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 44 treesize of output 51 [2018-11-18 11:02:39,716 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,740 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 0 case distinctions, treesize of input 47 treesize of output 41 [2018-11-18 11:02:39,740 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,751 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,769 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 11:02:39,795 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 11:02:39,820 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 60 treesize of output 54 [2018-11-18 11:02:39,821 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 28 treesize of output 22 [2018-11-18 11:02:39,822 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,829 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,831 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 60 treesize of output 54 [2018-11-18 11:02:39,833 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 28 treesize of output 22 [2018-11-18 11:02:39,833 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,839 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,841 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 48 treesize of output 44 [2018-11-18 11:02:39,842 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 21 treesize of output 17 [2018-11-18 11:02:39,843 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,855 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 11:02:39,881 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 5 variables, input treesize:168, output treesize:109 [2018-11-18 11:02:39,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2018-11-18 11:02:39,965 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 24 treesize of output 22 [2018-11-18 11:02:39,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,973 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 16 treesize of output 9 [2018-11-18 11:02:39,973 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,979 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-11-18 11:02:39,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:39,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2018-11-18 11:02:39,993 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 17 treesize of output 8 [2018-11-18 11:02:39,993 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:40,002 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-18 11:02:40,003 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:40,008 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 10 treesize of output 4 [2018-11-18 11:02:40,008 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:40,010 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:40,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:40,012 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:72, output treesize:1 [2018-11-18 11:02:40,018 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 11:02:40,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:02:45,210 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 11:02:45,213 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 11:02:45,462 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:02:45,463 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_prenex_23 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.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 11:02:45,465 INFO L168 Benchmark]: Toolchain (without parser) took 24971.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.4 MB). Free memory was 951.1 MB in the beginning and 957.9 MB in the end (delta: -6.8 MB). Peak memory consumption was 293.6 MB. Max. memory is 11.5 GB. [2018-11-18 11:02:45,466 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:02:45,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -216.8 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. [2018-11-18 11:02:45,467 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:02:45,467 INFO L168 Benchmark]: Boogie Preprocessor took 25.47 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-11-18 11:02:45,468 INFO L168 Benchmark]: RCFGBuilder took 277.57 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: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-11-18 11:02:45,468 INFO L168 Benchmark]: TraceAbstraction took 24285.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 957.9 MB in the end (delta: 176.4 MB). Peak memory consumption was 293.3 MB. Max. memory is 11.5 GB. [2018-11-18 11:02:45,470 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 362.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -216.8 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.47 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 277.57 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: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24285.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 957.9 MB in the end (delta: 176.4 MB). Peak memory consumption was 293.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_23 term size 33 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_23 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... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 11:02:46,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:02:46,936 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:02:46,944 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:02:46,944 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:02:46,945 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:02:46,945 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:02:46,947 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:02:46,948 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:02:46,948 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:02:46,949 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:02:46,949 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:02:46,950 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:02:46,951 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:02:46,951 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:02:46,952 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:02:46,953 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:02:46,954 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:02:46,955 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:02:46,956 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:02:46,957 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:02:46,958 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:02:46,959 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:02:46,959 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:02:46,959 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:02:46,960 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:02:46,961 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:02:46,961 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:02:46,962 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:02:46,963 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:02:46,963 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:02:46,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:02:46,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:02:46,964 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:02:46,964 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:02:46,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:02:46,965 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-18 11:02:46,975 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:02:46,976 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:02:46,976 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:02:46,977 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 11:02:46,977 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 11:02:46,977 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 11:02:46,977 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 11:02:46,977 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 11:02:46,977 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 11:02:46,977 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 11:02:46,978 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:02:46,978 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:02:46,978 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:02:46,978 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:02:46,978 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:02:46,979 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:02:46,979 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:02:46,979 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 11:02:46,979 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 11:02:46,979 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:02:46,979 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:02:46,979 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:02:46,979 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:02:46,980 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:02:46,980 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:02:46,980 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:02:46,980 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:02:46,980 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:02:46,980 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:02:46,980 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:02:46,980 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:02:46,981 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 11:02:46,981 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:02:46,981 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 11:02:46,981 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 11:02:46,981 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_05bf8015-8b60-4b48-9fa7-9e10197d50b3/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 -> 0f7cafa734d0f20d504408b2e981cc49af978383 [2018-11-18 11:02:47,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:02:47,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:02:47,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:02:47,026 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:02:47,026 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:02:47,027 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 11:02:47,075 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/data/541f4a769/9ee30332dc554314a9554574ad52fcaa/FLAG1f457ed00 [2018-11-18 11:02:47,446 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:02:47,447 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 11:02:47,456 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/data/541f4a769/9ee30332dc554314a9554574ad52fcaa/FLAG1f457ed00 [2018-11-18 11:02:47,838 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/data/541f4a769/9ee30332dc554314a9554574ad52fcaa [2018-11-18 11:02:47,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:02:47,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:02:47,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:02:47,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:02:47,845 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:02:47,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:02:47" (1/1) ... [2018-11-18 11:02:47,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72658611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:47, skipping insertion in model container [2018-11-18 11:02:47,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:02:47" (1/1) ... [2018-11-18 11:02:47,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:02:47,886 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:02:48,126 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:02:48,135 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:02:48,171 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:02:48,249 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:02:48,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:48 WrapperNode [2018-11-18 11:02:48,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:02:48,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:02:48,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:02:48,250 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:02:48,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:48" (1/1) ... [2018-11-18 11:02:48,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:48" (1/1) ... [2018-11-18 11:02:48,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:02:48,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:02:48,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:02:48,275 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:02:48,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:48" (1/1) ... [2018-11-18 11:02:48,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:48" (1/1) ... [2018-11-18 11:02:48,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:48" (1/1) ... [2018-11-18 11:02:48,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:48" (1/1) ... [2018-11-18 11:02:48,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:48" (1/1) ... [2018-11-18 11:02:48,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:48" (1/1) ... [2018-11-18 11:02:48,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:48" (1/1) ... [2018-11-18 11:02:48,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:02:48,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:02:48,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:02:48,300 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:02:48,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:02:48,333 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-18 11:02:48,333 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-18 11:02:48,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 11:02:48,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 11:02:48,333 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 11:02:48,333 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 11:02:48,333 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-18 11:02:48,334 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-18 11:02:48,334 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 11:02:48,334 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 11:02:48,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:02:48,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:02:48,334 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:02:48,334 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:02:48,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 11:02:48,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 11:02:48,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 11:02:48,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 11:02:48,335 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-18 11:02:48,335 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-18 11:02:48,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:02:48,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:02:48,617 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:02:48,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:02:48 BoogieIcfgContainer [2018-11-18 11:02:48,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:02:48,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:02:48,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:02:48,621 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:02:48,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:02:47" (1/3) ... [2018-11-18 11:02:48,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215a82d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:02:48, skipping insertion in model container [2018-11-18 11:02:48,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:48" (2/3) ... [2018-11-18 11:02:48,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215a82d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:02:48, skipping insertion in model container [2018-11-18 11:02:48,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:02:48" (3/3) ... [2018-11-18 11:02:48,623 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 11:02:48,629 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:02:48,635 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:02:48,644 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:02:48,664 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:02:48,664 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:02:48,664 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:02:48,664 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:02:48,664 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:02:48,664 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:02:48,664 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:02:48,664 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:02:48,665 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:02:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-18 11:02:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 11:02:48,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:02:48,681 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-11-18 11:02:48,682 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:02:48,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:48,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1865262772, now seen corresponding path program 1 times [2018-11-18 11:02:48,688 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:02:48,689 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 11:02:48,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:48,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:02:48,786 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 11:02:48,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:02:48,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:02:48,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 11:02:48,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 11:02:48,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:02:48,809 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2018-11-18 11:02:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:02:48,830 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-11-18 11:02:48,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 11:02:48,831 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-11-18 11:02:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:02:48,838 INFO L225 Difference]: With dead ends: 93 [2018-11-18 11:02:48,839 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 11:02:48,842 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:02:48,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 11:02:48,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-18 11:02:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 11:02:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-18 11:02:48,869 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 31 [2018-11-18 11:02:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:02:48,870 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 11:02:48,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 11:02:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 11:02:48,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 11:02:48,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:02:48,871 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:02:48,872 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:02:48,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:48,872 INFO L82 PathProgramCache]: Analyzing trace with hash 127914466, now seen corresponding path program 1 times [2018-11-18 11:02:48,872 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:02:48,872 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 11:02:48,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:48,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:02:48,973 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 11:02:48,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:02:48,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:02:48,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:02:48,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:02:48,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:02:48,977 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2018-11-18 11:02:48,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:02:48,999 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-18 11:02:49,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:02:49,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 11:02:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:02:49,002 INFO L225 Difference]: With dead ends: 55 [2018-11-18 11:02:49,003 INFO L226 Difference]: Without dead ends: 45 [2018-11-18 11:02:49,004 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:02:49,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-18 11:02:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-18 11:02:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 11:02:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-18 11:02:49,011 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2018-11-18 11:02:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:02:49,012 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-18 11:02:49,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:02:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-18 11:02:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 11:02:49,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:02:49,014 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:02:49,014 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:02:49,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:49,014 INFO L82 PathProgramCache]: Analyzing trace with hash 807972836, now seen corresponding path program 1 times [2018-11-18 11:02:49,015 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:02:49,015 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 11:02:49,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:49,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:02:49,126 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 11:02:49,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:02:49,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:02:49,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:02:49,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:02:49,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:02:49,131 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2018-11-18 11:02:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:02:49,184 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-18 11:02:49,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:02:49,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-18 11:02:49,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:02:49,187 INFO L225 Difference]: With dead ends: 76 [2018-11-18 11:02:49,187 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 11:02:49,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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-11-18 11:02:49,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 11:02:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-11-18 11:02:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 11:02:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-18 11:02:49,195 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 34 [2018-11-18 11:02:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:02:49,195 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-18 11:02:49,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:02:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-18 11:02:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 11:02:49,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:02:49,197 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, 1, 1] [2018-11-18 11:02:49,197 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:02:49,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:49,197 INFO L82 PathProgramCache]: Analyzing trace with hash 612056741, now seen corresponding path program 1 times [2018-11-18 11:02:49,197 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:02:49,197 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 11:02:49,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:49,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:02:49,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:02:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 11:02:49,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:02:49,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:02:49,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:49,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:02:49,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:02:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 11:02:49,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 11:02:49,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7, 7] total 16 [2018-11-18 11:02:49,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 11:02:49,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 11:02:49,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-18 11:02:49,886 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 16 states. [2018-11-18 11:02:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:02:50,052 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2018-11-18 11:02:50,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 11:02:50,053 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-11-18 11:02:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:02:50,053 INFO L225 Difference]: With dead ends: 81 [2018-11-18 11:02:50,053 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 11:02:50,054 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-11-18 11:02:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 11:02:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-18 11:02:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 11:02:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-18 11:02:50,059 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 44 [2018-11-18 11:02:50,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:02:50,061 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-18 11:02:50,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 11:02:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-18 11:02:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 11:02:50,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:02:50,062 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] [2018-11-18 11:02:50,062 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:02:50,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:50,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1977552934, now seen corresponding path program 2 times [2018-11-18 11:02:50,063 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:02:50,063 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 11:02:50,084 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 11:02:50,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 11:02:50,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:02:50,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 11:02:50,179 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (7)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 11:02:50,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:02:50,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:02:50,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:02:50,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:02:50,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:02:50,182 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-11-18 11:02:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:02:50,232 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-18 11:02:50,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:02:50,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-18 11:02:50,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:02:50,234 INFO L225 Difference]: With dead ends: 59 [2018-11-18 11:02:50,234 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 11:02:50,234 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 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-11-18 11:02:50,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 11:02:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-18 11:02:50,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 11:02:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-18 11:02:50,238 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 54 [2018-11-18 11:02:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:02:50,238 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-18 11:02:50,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:02:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-18 11:02:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 11:02:50,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:02:50,240 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-11-18 11:02:50,240 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:02:50,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:50,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1947332734, now seen corresponding path program 1 times [2018-11-18 11:02:50,241 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 11:02:50,241 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 11:02:50,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:02:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:50,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:50,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 11:02:50,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:50,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:50,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 11:02:52,433 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-11-18 11:02:54,520 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 11:02:54,614 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:54,615 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:54,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:54,619 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 25 treesize of output 42 [2018-11-18 11:02:54,629 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 34 [2018-11-18 11:02:54,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:54,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:54,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 11:02:54,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:36 [2018-11-18 11:02:54,719 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-11-18 11:02:54,723 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-11-18 11:02:54,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:54,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:54,743 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-11-18 11:02:54,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:52 [2018-11-18 11:02:58,719 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-18 11:03:00,334 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-18 11:03:01,933 WARN L180 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-18 11:03:06,926 WARN L180 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-18 11:03:13,056 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-18 11:03:15,083 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (sll_insert_~snd_to_last~0.offset (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32)) (sll_insert_~new_node~0.offset (_ BitVec 32))) (and (= (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))))) (let ((.cse2 (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd sll_insert_~snd_to_last~0.offset (_ bv4 32)) sll_insert_~new_node~0.base)))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (bvadd sll_insert_~new_node~0.offset (_ bv4 32)) sll_insert_~last~0.base))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)))) is different from true [2018-11-18 11:03:15,674 WARN L180 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-11-18 11:03:15,706 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:03:15,717 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:03:15,727 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:03:15,727 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 11:03:15,728 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 26 treesize of output 37 [2018-11-18 11:03:15,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:15,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 96 [2018-11-18 11:03:15,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 11:03:15,972 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:16,063 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 91 treesize of output 76 [2018-11-18 11:03:16,072 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-11-18 11:03:16,072 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:16,137 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 68 treesize of output 70 [2018-11-18 11:03:16,180 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 18 treesize of output 27 [2018-11-18 11:03:16,181 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 11:03:16,235 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 11:03:16,303 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 11:03:16,385 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 11:03:16,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 11:03:16,485 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:186, output treesize:124 [2018-11-18 11:03:16,596 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-11-18 11:03:16,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 28 treesize of output 17 [2018-11-18 11:03:16,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:16,612 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 17 treesize of output 9 [2018-11-18 11:03:16,613 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:16,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:03:16,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:03:16,620 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:56, output treesize:4 [2018-11-18 11:03:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2018-11-18 11:03:16,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:03:17,126 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-18 11:03:17,233 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 11:03:17,465 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-18 11:03:17,690 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-18 11:03:24,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:03:24,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:03:24,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:03:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:03:24,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:03:26,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-18 11:03:26,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:26,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:03:26,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-11-18 11:03:26,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 11:03:26,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:03:26,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:26,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:03:26,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 11:03:26,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:03:26,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:26,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:03:26,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:03:26,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2018-11-18 11:03:46,123 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_insert_~new_node~0.base (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))))) (let ((.cse2 (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) (_ bv4 32)) sll_insert_~new_node~0.base)))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (_ bv4 32) sll_insert_~last~0.base)))) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)))) is different from true [2018-11-18 11:03:46,439 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2018-11-18 11:03:46,458 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:03:46,464 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:03:46,465 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-11-18 11:03:46,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:46,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 85 [2018-11-18 11:03:46,646 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 84 treesize of output 83 [2018-11-18 11:03:46,647 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:47,337 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:03:47,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 71 treesize of output 86 [2018-11-18 11:03:47,338 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:48,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 59 [2018-11-18 11:03:48,054 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 18 treesize of output 17 [2018-11-18 11:03:48,054 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:48,080 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:03:48,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2018-11-18 11:03:48,098 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 41 treesize of output 48 [2018-11-18 11:03:48,098 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:48,109 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:03:48,121 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:03:48,509 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 79 treesize of output 67 [2018-11-18 11:03:48,514 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 61 treesize of output 60 [2018-11-18 11:03:48,514 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:48,720 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:03:48,721 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:03:48,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 44 treesize of output 65 [2018-11-18 11:03:48,723 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:48,924 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:03:48,961 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 52 treesize of output 67 [2018-11-18 11:03:48,968 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 0 case distinctions, treesize of input 59 treesize of output 53 [2018-11-18 11:03:48,968 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:49,076 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 44 treesize of output 51 [2018-11-18 11:03:49,076 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:49,133 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 11:03:49,261 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:03:49,312 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 62 [2018-11-18 11:03:49,320 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 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-18 11:03:49,320 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:49,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:03:49,411 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 11:03:49,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 73 [2018-11-18 11:03:49,421 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 11:03:49,439 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 11:03:49,514 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 11:03:49,610 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 11:03:49,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 11:03:49,781 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 60 treesize of output 54 [2018-11-18 11:03:49,784 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 28 treesize of output 22 [2018-11-18 11:03:49,784 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:49,806 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:03:49,809 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 48 treesize of output 44 [2018-11-18 11:03:49,812 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 21 treesize of output 17 [2018-11-18 11:03:49,812 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:49,826 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:03:49,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 11:03:49,875 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 5 variables, input treesize:170, output treesize:67 [2018-11-18 11:03:50,054 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:03:50,057 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-11-18 11:03:50,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 11:03:50,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:50,070 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-18 11:03:50,070 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:50,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:03:50,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2018-11-18 11:03:50,094 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 24 treesize of output 22 [2018-11-18 11:03:50,094 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:50,109 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-11-18 11:03:50,109 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 11:03:50,113 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:03:50,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:03:50,116 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:72, output treesize:1 [2018-11-18 11:03:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 11:03:50,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:03:50,808 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-18 11:03:50,945 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-18 11:03:51,223 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-18 11:03:51,498 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-18 11:03:58,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:03:58,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 41 [2018-11-18 11:03:58,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-18 11:03:58,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-18 11:03:58,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1519, Unknown=22, NotChecked=240, Total=1892 [2018-11-18 11:03:58,253 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 41 states. [2018-11-18 11:04:13,369 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-11-18 11:04:19,924 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 11:04:34,730 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 36 [2018-11-18 11:04:47,471 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 36 [2018-11-18 11:05:03,173 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 43 [2018-11-18 11:05:19,533 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((sll_insert_~new_node~0.base (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))))) (let ((.cse2 (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) (_ bv4 32)) sll_insert_~new_node~0.base)))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (_ bv4 32) sll_insert_~last~0.base)))) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)))) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (sll_insert_~snd_to_last~0.offset (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32)) (sll_insert_~new_node~0.offset (_ BitVec 32))) (and (= (let ((.cse3 (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))))) (let ((.cse5 (select (select .cse4 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (store .cse4 .cse5 (store (select .cse4 .cse5) (bvadd sll_insert_~snd_to_last~0.offset (_ bv4 32)) sll_insert_~new_node~0.base)))))) (store .cse3 sll_insert_~new_node~0.base (store (select .cse3 sll_insert_~new_node~0.base) (bvadd sll_insert_~new_node~0.offset (_ bv4 32)) sll_insert_~last~0.base))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base))))) is different from true [2018-11-18 11:05:24,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:05:24,445 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2018-11-18 11:05:24,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 11:05:24,450 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 56 [2018-11-18 11:05:24,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:05:24,450 INFO L225 Difference]: With dead ends: 83 [2018-11-18 11:05:24,450 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 11:05:24,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 95.7s TimeCoverageRelationStatistics Valid=206, Invalid=3082, Unknown=34, NotChecked=460, Total=3782 [2018-11-18 11:05:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 11:05:24,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 11:05:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 11:05:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 11:05:24,452 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2018-11-18 11:05:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:05:24,453 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:05:24,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-18 11:05:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:05:24,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 11:05:24,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 11:05:26,713 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2018-11-18 11:05:26,735 INFO L425 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-11-18 11:05:26,735 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 560 562) no Hoare annotation was computed. [2018-11-18 11:05:26,736 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 560 562) the Hoare annotation is: true [2018-11-18 11:05:26,736 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 560 562) no Hoare annotation was computed. [2018-11-18 11:05:26,736 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 11:05:26,736 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-18 11:05:26,736 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:05:26,736 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 581 587) no Hoare annotation was computed. [2018-11-18 11:05:26,736 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 586) no Hoare annotation was computed. [2018-11-18 11:05:26,736 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 581 587) the Hoare annotation is: true [2018-11-18 11:05:26,736 INFO L428 ceAbstractionStarter]: At program point L582-3(lines 582 586) the Hoare annotation is: true [2018-11-18 11:05:26,736 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 581 587) no Hoare annotation was computed. [2018-11-18 11:05:26,736 INFO L421 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (let ((.cse0 (bvsgt sll_create_~len (_ bv0 32)))) (or (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) .cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (not (= sll_create_~head~0.base (_ bv0 32))) (or (and (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt |sll_create_#in~len| (_ bv0 32))) .cse0) (= (_ bv0 32) sll_create_~head~0.offset)))) [2018-11-18 11:05:26,736 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 572 580) no Hoare annotation was computed. [2018-11-18 11:05:26,736 INFO L425 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-11-18 11:05:26,736 INFO L425 ceAbstractionStarter]: For program point L574-1(lines 574 578) no Hoare annotation was computed. [2018-11-18 11:05:26,736 INFO L425 ceAbstractionStarter]: For program point L574-3(lines 574 578) no Hoare annotation was computed. [2018-11-18 11:05:26,736 INFO L421 ceAbstractionStarter]: At program point L574-4(lines 574 578) the Hoare annotation is: (or (and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (not (= sll_create_~head~0.base (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset)) (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) [2018-11-18 11:05:26,736 INFO L425 ceAbstractionStarter]: For program point L574-5(lines 574 578) no Hoare annotation was computed. [2018-11-18 11:05:26,736 INFO L421 ceAbstractionStarter]: At program point sll_createENTRY(lines 572 580) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-18 11:05:26,737 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 572 580) no Hoare annotation was computed. [2018-11-18 11:05:26,737 INFO L425 ceAbstractionStarter]: For program point L597-1(lines 597 601) no Hoare annotation was computed. [2018-11-18 11:05:26,737 INFO L421 ceAbstractionStarter]: At program point sll_insertENTRY(lines 588 603) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-18 11:05:26,737 INFO L425 ceAbstractionStarter]: For program point L592-1(lines 592 596) no Hoare annotation was computed. [2018-11-18 11:05:26,737 INFO L421 ceAbstractionStarter]: At program point L589(line 589) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_insert_~index |sll_insert_#in~index|) (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-18 11:05:26,737 INFO L428 ceAbstractionStarter]: At program point L592-3(lines 592 596) the Hoare annotation is: true [2018-11-18 11:05:26,737 INFO L425 ceAbstractionStarter]: For program point sll_insertEXIT(lines 588 603) no Hoare annotation was computed. [2018-11-18 11:05:26,737 INFO L425 ceAbstractionStarter]: For program point L589-1(line 589) no Hoare annotation was computed. [2018-11-18 11:05:26,737 INFO L425 ceAbstractionStarter]: For program point L592-4(lines 588 603) no Hoare annotation was computed. [2018-11-18 11:05:26,737 INFO L425 ceAbstractionStarter]: For program point sll_insertFINAL(lines 588 603) no Hoare annotation was computed. [2018-11-18 11:05:26,737 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:05:26,737 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 11:05:26,737 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 11:05:26,737 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 11:05:26,737 INFO L421 ceAbstractionStarter]: At program point L611-3(lines 611 618) the Hoare annotation is: (and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) [2018-11-18 11:05:26,738 INFO L421 ceAbstractionStarter]: At program point L607(line 607) the Hoare annotation is: (and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) [2018-11-18 11:05:26,738 INFO L425 ceAbstractionStarter]: For program point L611-4(lines 604 626) no Hoare annotation was computed. [2018-11-18 11:05:26,738 INFO L425 ceAbstractionStarter]: For program point L607-1(line 607) no Hoare annotation was computed. [2018-11-18 11:05:26,738 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 604 626) no Hoare annotation was computed. [2018-11-18 11:05:26,738 INFO L428 ceAbstractionStarter]: At program point L622(line 622) the Hoare annotation is: true [2018-11-18 11:05:26,738 INFO L425 ceAbstractionStarter]: For program point L622-1(line 622) no Hoare annotation was computed. [2018-11-18 11:05:26,738 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 604 626) no Hoare annotation was computed. [2018-11-18 11:05:26,738 INFO L421 ceAbstractionStarter]: At program point L620(lines 604 626) the Hoare annotation is: (and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) [2018-11-18 11:05:26,738 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2018-11-18 11:05:26,738 INFO L421 ceAbstractionStarter]: At program point L608(line 608) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (_ bv0 32) .cse0)) (= (_ bv1 1) (select |#valid| .cse0)))) [2018-11-18 11:05:26,738 INFO L425 ceAbstractionStarter]: For program point L608-1(line 608) no Hoare annotation was computed. [2018-11-18 11:05:26,738 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 604 626) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-18 11:05:26,738 INFO L425 ceAbstractionStarter]: For program point L613(lines 613 615) no Hoare annotation was computed. [2018-11-18 11:05:26,738 INFO L425 ceAbstractionStarter]: For program point L611-1(lines 611 618) no Hoare annotation was computed. [2018-11-18 11:05:26,738 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-18 11:05:26,738 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-11-18 11:05:26,738 INFO L428 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-11-18 11:05:26,738 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-11-18 11:05:26,739 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-11-18 11:05:26,739 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-11-18 11:05:26,748 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 11:05:26,748 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 11:05:26,749 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 11:05:26,749 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 11:05:26,749 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 11:05:26,749 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 11:05:26,750 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 11:05:26,750 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 11:05:26,750 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 11:05:26,750 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 11:05:26,750 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 11:05:26,751 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 11:05:26,751 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 11:05:26,751 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 11:05:26,751 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 11:05:26,751 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 11:05:26,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:05:26 BoogieIcfgContainer [2018-11-18 11:05:26,753 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 11:05:26,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:05:26,754 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:05:26,754 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:05:26,754 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:02:48" (3/4) ... [2018-11-18 11:05:26,757 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 11:05:26,760 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-11-18 11:05:26,761 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 11:05:26,761 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-11-18 11:05:26,761 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-11-18 11:05:26,761 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_insert [2018-11-18 11:05:26,761 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 11:05:26,761 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-18 11:05:26,764 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-11-18 11:05:26,764 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-18 11:05:26,764 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 11:05:26,780 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1bv1 == \valid[head] && !(head == 0bv32)) && 0bv32 == head) || (((\valid == \old(\valid) && \old(len) == len) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) [2018-11-18 11:05:26,796 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_05bf8015-8b60-4b48-9fa7-9e10197d50b3/bin-2019/utaipan/witness.graphml [2018-11-18 11:05:26,796 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:05:26,797 INFO L168 Benchmark]: Toolchain (without parser) took 158956.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.8 MB). Free memory was 938.5 MB in the beginning and 907.4 MB in the end (delta: 31.1 MB). Peak memory consumption was 328.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:05:26,797 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-11-18 11:05:26,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 938.5 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2018-11-18 11:05:26,798 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:05:26,798 INFO L168 Benchmark]: Boogie Preprocessor took 24.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:05:26,798 INFO L168 Benchmark]: RCFGBuilder took 318.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:05:26,798 INFO L168 Benchmark]: TraceAbstraction took 158134.58 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 907.4 MB in the end (delta: 162.3 MB). Peak memory consumption was 344.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:05:26,799 INFO L168 Benchmark]: Witness Printer took 42.74 ms. Allocated memory is still 1.3 GB. Free memory is still 907.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:05:26,800 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 408.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 938.5 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 318.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 158134.58 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 907.4 MB in the end (delta: 162.3 MB). Peak memory consumption was 344.7 MB. Max. memory is 11.5 GB. * Witness Printer took 42.74 ms. Allocated memory is still 1.3 GB. Free memory is still 907.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 624]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32 - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 574]: Loop Invariant [2018-11-18 11:05:26,803 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 11:05:26,803 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 11:05:26,803 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 11:05:26,804 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 11:05:26,804 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 11:05:26,804 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 11:05:26,804 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 11:05:26,804 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 11:05:26,804 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 11:05:26,804 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 11:05:26,804 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 11:05:26,804 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 11:05:26,804 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 11:05:26,804 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 11:05:26,805 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 11:05:26,805 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((1bv1 == \valid[head] && !(head == 0bv32)) && 0bv32 == head) || (((\valid == \old(\valid) && \old(len) == len) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32 - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 55 locations, 1 error locations. SAFE Result, 158.0s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 86.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 264 SDtfs, 121 SDslu, 1290 SDs, 0 SdLazy, 948 SolverSat, 35 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 50.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 470 GetRequests, 385 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 96.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 49 PreInvPairs, 70 NumberOfFragments, 208 HoareAnnotationTreeSize, 49 FomulaSimplifications, 729 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 152 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 68.4s InterpolantComputationTime, 353 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 431 ConstructedInterpolants, 33 QuantifiedInterpolants, 151333 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1260 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 67/104 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...