./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/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 6054e98f999cfedecdcceeeadabf7a119475d890 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/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 6054e98f999cfedecdcceeeadabf7a119475d890 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 02:55:05,956 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:55:05,957 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:55:05,963 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:55:05,963 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:55:05,964 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:55:05,965 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:55:05,965 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:55:05,966 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:55:05,967 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:55:05,967 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:55:05,968 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:55:05,968 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:55:05,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:55:05,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:55:05,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:55:05,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:55:05,972 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:55:05,973 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:55:05,974 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:55:05,975 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:55:05,975 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:55:05,977 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:55:05,977 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:55:05,977 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:55:05,977 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:55:05,978 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:55:05,978 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:55:05,979 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:55:05,980 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:55:05,980 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:55:05,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:55:05,980 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:55:05,981 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:55:05,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:55:05,982 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:55:05,982 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 02:55:05,989 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:55:05,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:55:05,990 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 02:55:05,990 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 02:55:05,990 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 02:55:05,990 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 02:55:05,991 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 02:55:05,991 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 02:55:05,991 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 02:55:05,991 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 02:55:05,991 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 02:55:05,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:55:05,992 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 02:55:05,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:55:05,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 02:55:05,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:55:05,992 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 02:55:05,992 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 02:55:05,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 02:55:05,993 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 02:55:05,993 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:55:05,993 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 02:55:05,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:55:05,993 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:55:05,993 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 02:55:05,993 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 02:55:05,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 02:55:05,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:55:05,994 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 02:55:05,994 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 02:55:05,994 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 02:55:05,994 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 02:55:05,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 02:55:05,995 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 02:55:05,995 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_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/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 -> 6054e98f999cfedecdcceeeadabf7a119475d890 [2018-11-10 02:55:06,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:55:06,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:55:06,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:55:06,031 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:55:06,031 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:55:06,032 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-10 02:55:06,077 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/data/ee80ca6de/ec2d7aef7b99437eba7f61ef137da603/FLAGe8b3994bf [2018-11-10 02:55:06,537 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:55:06,538 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-10 02:55:06,548 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/data/ee80ca6de/ec2d7aef7b99437eba7f61ef137da603/FLAGe8b3994bf [2018-11-10 02:55:06,557 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/data/ee80ca6de/ec2d7aef7b99437eba7f61ef137da603 [2018-11-10 02:55:06,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:55:06,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:55:06,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:55:06,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:55:06,563 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:55:06,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:55:06" (1/1) ... [2018-11-10 02:55:06,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba810fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:06, skipping insertion in model container [2018-11-10 02:55:06,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:55:06" (1/1) ... [2018-11-10 02:55:06,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:55:06,599 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:55:06,794 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:55:06,801 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:55:06,835 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:55:06,860 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:55:06,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:06 WrapperNode [2018-11-10 02:55:06,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:55:06,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:55:06,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:55:06,861 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:55:06,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:06" (1/1) ... [2018-11-10 02:55:06,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:06" (1/1) ... [2018-11-10 02:55:06,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:55:06,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:55:06,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:55:06,933 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:55:06,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:06" (1/1) ... [2018-11-10 02:55:06,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:06" (1/1) ... [2018-11-10 02:55:06,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:06" (1/1) ... [2018-11-10 02:55:06,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:06" (1/1) ... [2018-11-10 02:55:06,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:06" (1/1) ... [2018-11-10 02:55:06,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:06" (1/1) ... [2018-11-10 02:55:06,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:06" (1/1) ... [2018-11-10 02:55:06,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:55:06,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:55:06,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:55:06,954 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:55:06,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 02:55:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-10 02:55:06,989 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-10 02:55:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 02:55:06,989 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 02:55:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-10 02:55:06,990 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-10 02:55:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-10 02:55:06,990 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-10 02:55:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 02:55:06,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 02:55:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 02:55:06,990 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 02:55:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:55:06,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:55:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-10 02:55:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-10 02:55:07,278 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:55:07,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:55:07 BoogieIcfgContainer [2018-11-10 02:55:07,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:55:07,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 02:55:07,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 02:55:07,281 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 02:55:07,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:55:06" (1/3) ... [2018-11-10 02:55:07,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df6672f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:55:07, skipping insertion in model container [2018-11-10 02:55:07,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:06" (2/3) ... [2018-11-10 02:55:07,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df6672f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:55:07, skipping insertion in model container [2018-11-10 02:55:07,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:55:07" (3/3) ... [2018-11-10 02:55:07,284 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-10 02:55:07,290 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 02:55:07,295 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 02:55:07,304 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 02:55:07,325 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 02:55:07,325 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 02:55:07,325 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 02:55:07,325 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:55:07,325 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:55:07,325 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 02:55:07,325 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:55:07,325 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 02:55:07,337 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-11-10 02:55:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 02:55:07,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:55:07,342 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] [2018-11-10 02:55:07,344 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:55:07,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:55:07,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1708855369, now seen corresponding path program 1 times [2018-11-10 02:55:07,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:55:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:55:07,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:55:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:55:07,385 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:55:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:55:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:55:07,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:55:07,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 02:55:07,471 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:55:07,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 02:55:07,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 02:55:07,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 02:55:07,484 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 2 states. [2018-11-10 02:55:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:55:07,502 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2018-11-10 02:55:07,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 02:55:07,503 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-10 02:55:07,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:55:07,509 INFO L225 Difference]: With dead ends: 103 [2018-11-10 02:55:07,509 INFO L226 Difference]: Without dead ends: 44 [2018-11-10 02:55:07,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 02:55:07,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-10 02:55:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-10 02:55:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 02:55:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-10 02:55:07,539 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 32 [2018-11-10 02:55:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:55:07,539 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-10 02:55:07,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 02:55:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-10 02:55:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 02:55:07,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:55:07,541 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:55:07,541 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:55:07,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:55:07,542 INFO L82 PathProgramCache]: Analyzing trace with hash -918557474, now seen corresponding path program 1 times [2018-11-10 02:55:07,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:55:07,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:55:07,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:55:07,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:55:07,544 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:55:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:55:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:55:07,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:55:07,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:55:07,648 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:55:07,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:55:07,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:55:07,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:55:07,650 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2018-11-10 02:55:07,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:55:07,663 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-11-10 02:55:07,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:55:07,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 02:55:07,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:55:07,665 INFO L225 Difference]: With dead ends: 65 [2018-11-10 02:55:07,665 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 02:55:07,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:55:07,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 02:55:07,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-10 02:55:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 02:55:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2018-11-10 02:55:07,671 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 34 [2018-11-10 02:55:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:55:07,672 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2018-11-10 02:55:07,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:55:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2018-11-10 02:55:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 02:55:07,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:55:07,673 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:55:07,674 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:55:07,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:55:07,674 INFO L82 PathProgramCache]: Analyzing trace with hash -238499104, now seen corresponding path program 1 times [2018-11-10 02:55:07,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:55:07,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:55:07,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:55:07,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:55:07,675 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:55:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:55:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:55:07,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:55:07,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:55:07,737 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:55:07,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:55:07,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:55:07,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:55:07,737 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 5 states. [2018-11-10 02:55:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:55:07,769 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-11-10 02:55:07,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:55:07,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-10 02:55:07,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:55:07,770 INFO L225 Difference]: With dead ends: 86 [2018-11-10 02:55:07,770 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 02:55:07,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:55:07,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 02:55:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-10 02:55:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 02:55:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-11-10 02:55:07,776 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 34 [2018-11-10 02:55:07,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:55:07,776 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-11-10 02:55:07,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:55:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-10 02:55:07,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 02:55:07,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:55:07,778 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-10 02:55:07,778 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:55:07,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:55:07,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1064843297, now seen corresponding path program 1 times [2018-11-10 02:55:07,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:55:07,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:55:07,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:55:07,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:55:07,779 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:55:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:55:07,871 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-10 02:55:07,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:55:07,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 02:55:07,871 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 02:55:07,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 02:55:07,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:55:07,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:55:07,872 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 6 states. [2018-11-10 02:55:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:55:07,934 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-11-10 02:55:07,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:55:07,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-10 02:55:07,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:55:07,935 INFO L225 Difference]: With dead ends: 64 [2018-11-10 02:55:07,936 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 02:55:07,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:55:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 02:55:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-10 02:55:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 02:55:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-10 02:55:07,940 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 44 [2018-11-10 02:55:07,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:55:07,940 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-10 02:55:07,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 02:55:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-10 02:55:07,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 02:55:07,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:55:07,942 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-10 02:55:07,942 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:55:07,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:55:07,942 INFO L82 PathProgramCache]: Analyzing trace with hash -865517767, now seen corresponding path program 1 times [2018-11-10 02:55:07,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:55:07,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:55:07,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:55:07,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:55:07,943 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:55:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:55:08,026 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-10 02:55:08,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:55:08,026 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:55:08,030 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-10 02:55:08,032 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [28], [30], [32], [34], [38], [39], [43], [45], [49], [53], [55], [61], [65], [66], [67], [69], [71], [75], [81], [84], [121], [124], [130], [132], [133], [134], [135], [136], [137], [138], [140], [141], [142], [143], [144], [145] [2018-11-10 02:55:08,075 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 02:55:08,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 02:55:08,420 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 02:55:08,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 02:55:08,765 INFO L272 AbstractInterpreter]: Visited 40 different actions 83 times. Merged at 10 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 54 variables. [2018-11-10 02:55:08,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:55:08,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 02:55:08,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:55:08,784 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:55:08,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:55:08,808 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 02:55:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:55:08,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:55:08,897 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-10 02:55:08,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:55:09,012 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-10 02:55:09,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 02:55:09,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-11-10 02:55:09,040 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 02:55:09,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 02:55:09,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:55:09,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:55:09,041 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 6 states. [2018-11-10 02:55:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:55:09,131 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2018-11-10 02:55:09,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:55:09,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-10 02:55:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:55:09,132 INFO L225 Difference]: With dead ends: 89 [2018-11-10 02:55:09,133 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 02:55:09,133 INFO L605 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-10 02:55:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 02:55:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-11-10 02:55:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 02:55:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-11-10 02:55:09,137 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 46 [2018-11-10 02:55:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:55:09,138 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-11-10 02:55:09,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 02:55:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2018-11-10 02:55:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 02:55:09,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:55:09,140 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-10 02:55:09,145 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:55:09,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:55:09,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1688326906, now seen corresponding path program 2 times [2018-11-10 02:55:09,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 02:55:09,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:55:09,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:55:09,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:55:09,147 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 02:55:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:55:09,900 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2018-11-10 02:55:10,171 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2018-11-10 02:55:10,337 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2018-11-10 02:55:10,501 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2018-11-10 02:55:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:55:10,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:55:10,865 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 02:55:10,865 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 02:55:10,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 02:55:10,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:55:10,865 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/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-10 02:55:10,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 02:55:10,875 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 02:55:10,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 02:55:10,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:55:10,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:55:10,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 02:55:10,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:11,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:11,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 02:55:11,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 02:55:11,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:55:11,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:11,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:11,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:11,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-11-10 02:55:11,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 02:55:11,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:55:11,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:11,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:11,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 02:55:11,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:55:11,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:11,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:11,243 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-10 02:55:11,243 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-11-10 02:55:11,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-10 02:55:11,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 12 treesize of output 1 [2018-11-10 02:55:11,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:11,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:11,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 02:55:11,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:46 [2018-11-10 02:55:12,009 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 60 [2018-11-10 02:55:12,015 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:12,017 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:12,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-10 02:55:12,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:12,098 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 205 treesize of output 176 [2018-11-10 02:55:12,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:12,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 187 [2018-11-10 02:55:12,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:12,497 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 185 treesize of output 184 [2018-11-10 02:55:12,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:12,838 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 3 case distinctions, treesize of input 184 treesize of output 162 [2018-11-10 02:55:12,846 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 166 treesize of output 165 [2018-11-10 02:55:12,847 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:13,077 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:13,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 162 [2018-11-10 02:55:13,079 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:13,291 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 152 treesize of output 147 [2018-11-10 02:55:13,295 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 14 treesize of output 7 [2018-11-10 02:55:13,295 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:13,309 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:13,470 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 155 [2018-11-10 02:55:13,474 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 14 treesize of output 7 [2018-11-10 02:55:13,474 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:13,488 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:13,550 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:13,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 183 treesize of output 159 [2018-11-10 02:55:13,802 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:13,803 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:13,804 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 02:55:13,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 185 [2018-11-10 02:55:13,809 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:14,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 165 treesize of output 164 [2018-11-10 02:55:14,030 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:14,260 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:14,264 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 162 treesize of output 145 [2018-11-10 02:55:14,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:14,268 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 02:55:14,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 157 [2018-11-10 02:55:14,273 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:14,290 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:14,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 159 treesize of output 154 [2018-11-10 02:55:14,484 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:14,485 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:14,485 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 02:55:14,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 177 [2018-11-10 02:55:14,493 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:14,556 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:55:14,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 156 treesize of output 153 [2018-11-10 02:55:14,770 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:14,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 149 [2018-11-10 02:55:14,776 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:14,829 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:55:14,902 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:55:15,039 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:55:15,104 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 150 [2018-11-10 02:55:15,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:55:15,106 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,125 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 70 [2018-11-10 02:55:15,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:15,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 84 [2018-11-10 02:55:15,129 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,145 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 85 treesize of output 88 [2018-11-10 02:55:15,147 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 14 treesize of output 7 [2018-11-10 02:55:15,148 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,156 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,162 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,174 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,190 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 149 treesize of output 134 [2018-11-10 02:55:15,194 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 129 treesize of output 128 [2018-11-10 02:55:15,194 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:15,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 131 [2018-11-10 02:55:15,351 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,524 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 3 case distinctions, treesize of input 128 treesize of output 121 [2018-11-10 02:55:15,527 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 110 treesize of output 109 [2018-11-10 02:55:15,528 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:15,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 129 [2018-11-10 02:55:15,620 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,691 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 112 treesize of output 115 [2018-11-10 02:55:15,695 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 14 treesize of output 7 [2018-11-10 02:55:15,695 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,716 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,806 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 96 [2018-11-10 02:55:15,810 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 14 treesize of output 7 [2018-11-10 02:55:15,810 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,824 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,864 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,944 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 101 [2018-11-10 02:55:15,947 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-10 02:55:15,947 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 60 [2018-11-10 02:55:15,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:15,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2018-11-10 02:55:15,973 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,980 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:15,990 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,023 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,053 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 118 treesize of output 123 [2018-11-10 02:55:16,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:55:16,055 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,067 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,071 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 97 treesize of output 94 [2018-11-10 02:55:16,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:55:16,073 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,083 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 02:55:16,111 INFO L202 ElimStorePlain]: Needed 45 recursive calls to eliminate 11 variables, input treesize:328, output treesize:120 [2018-11-10 02:55:16,178 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 61 treesize of output 53 [2018-11-10 02:55:16,180 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 39 treesize of output 28 [2018-11-10 02:55:16,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,204 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2018-11-10 02:55:16,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:16,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-11-10 02:55:16,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,238 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 77 treesize of output 72 [2018-11-10 02:55:16,240 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 59 treesize of output 42 [2018-11-10 02:55:16,240 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,256 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 65 treesize of output 60 [2018-11-10 02:55:16,256 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,271 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 60 treesize of output 46 [2018-11-10 02:55:16,272 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 02:55:16,285 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 02:55:16,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-11-10 02:55:16,303 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:55:16,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-11-10 02:55:16,304 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,310 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 02:55:16,327 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:147, output treesize:37 [2018-11-10 02:55:16,386 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2018-11-10 02:55:16,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 02:55:16,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,396 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-10 02:55:16,396 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,407 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 16 treesize of output 7 [2018-11-10 02:55:16,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:16,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:55:16,418 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-10 02:55:16,418 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:1 [2018-11-10 02:55:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:55:16,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:55:16,941 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-11-10 02:55:17,113 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-10 02:55:17,201 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 27 treesize of output 24 [2018-11-10 02:55:17,204 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 24 treesize of output 23 [2018-11-10 02:55:17,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:55:17,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:55:17,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-11-10 02:55:17,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:321, output treesize:294 [2018-11-10 02:55:45,762 WARN L179 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-11-10 02:56:43,218 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-10 02:56:43,409 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 27 treesize of output 24 [2018-11-10 02:56:43,414 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 24 treesize of output 23 [2018-11-10 02:56:43,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:43,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:43,641 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:56:43,641 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 02:56:43,643 INFO L168 Benchmark]: Toolchain (without parser) took 97084.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 263.2 MB). Free memory was 956.5 MB in the beginning and 931.8 MB in the end (delta: 24.7 MB). Peak memory consumption was 287.9 MB. Max. memory is 11.5 GB. [2018-11-10 02:56:43,644 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:56:43,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.35 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 929.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 02:56:43,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 929.7 MB in the beginning and 1.1 GB in the end (delta: -204.3 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 02:56:43,644 INFO L168 Benchmark]: Boogie Preprocessor took 20.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:56:43,645 INFO L168 Benchmark]: RCFGBuilder took 324.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2018-11-10 02:56:43,645 INFO L168 Benchmark]: TraceAbstraction took 96363.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.8 MB). Free memory was 1.1 GB in the beginning and 931.8 MB in the end (delta: 163.6 MB). Peak memory consumption was 289.5 MB. Max. memory is 11.5 GB. [2018-11-10 02:56:43,647 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 300.35 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 929.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 929.7 MB in the beginning and 1.1 GB in the end (delta: -204.3 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 324.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 96363.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.8 MB). Free memory was 1.1 GB in the beginning and 931.8 MB in the end (delta: 163.6 MB). Peak memory consumption was 289.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 02:56:45,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:56:45,009 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:56:45,019 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:56:45,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:56:45,020 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:56:45,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:56:45,022 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:56:45,023 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:56:45,024 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:56:45,025 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:56:45,025 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:56:45,026 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:56:45,027 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:56:45,028 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:56:45,028 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:56:45,029 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:56:45,031 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:56:45,032 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:56:45,034 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:56:45,035 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:56:45,036 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:56:45,037 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:56:45,037 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:56:45,038 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:56:45,038 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:56:45,039 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:56:45,040 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:56:45,040 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:56:45,041 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:56:45,041 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:56:45,042 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:56:45,042 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:56:45,042 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:56:45,043 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:56:45,043 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:56:45,043 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 02:56:45,055 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:56:45,055 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:56:45,056 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 02:56:45,056 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 02:56:45,056 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 02:56:45,056 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 02:56:45,056 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 02:56:45,057 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 02:56:45,057 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:56:45,057 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 02:56:45,057 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 02:56:45,058 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:56:45,058 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 02:56:45,058 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 02:56:45,058 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 02:56:45,059 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 02:56:45,059 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 02:56:45,059 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 02:56:45,059 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:56:45,059 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 02:56:45,059 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:56:45,060 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:56:45,060 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 02:56:45,060 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 02:56:45,060 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 02:56:45,060 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:56:45,060 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 02:56:45,060 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 02:56:45,061 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 02:56:45,061 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 02:56:45,061 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 02:56:45,061 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 02:56:45,061 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_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/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 -> 6054e98f999cfedecdcceeeadabf7a119475d890 [2018-11-10 02:56:45,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:56:45,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:56:45,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:56:45,110 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:56:45,110 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:56:45,110 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-10 02:56:45,155 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/data/df625920e/53e35ccbdf86473e8e0674dabda4d23e/FLAGd78bab663 [2018-11-10 02:56:45,520 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:56:45,520 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-10 02:56:45,528 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/data/df625920e/53e35ccbdf86473e8e0674dabda4d23e/FLAGd78bab663 [2018-11-10 02:56:45,538 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/data/df625920e/53e35ccbdf86473e8e0674dabda4d23e [2018-11-10 02:56:45,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:56:45,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:56:45,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:56:45,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:56:45,545 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:56:45,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:56:45" (1/1) ... [2018-11-10 02:56:45,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f487037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45, skipping insertion in model container [2018-11-10 02:56:45,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:56:45" (1/1) ... [2018-11-10 02:56:45,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:56:45,582 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:56:45,793 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:56:45,802 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:56:45,840 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:56:45,868 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:56:45,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45 WrapperNode [2018-11-10 02:56:45,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:56:45,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:56:45,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:56:45,869 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:56:45,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2018-11-10 02:56:45,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2018-11-10 02:56:45,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:56:45,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:56:45,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:56:45,956 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:56:45,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2018-11-10 02:56:45,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2018-11-10 02:56:45,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2018-11-10 02:56:45,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2018-11-10 02:56:45,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2018-11-10 02:56:45,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2018-11-10 02:56:45,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... [2018-11-10 02:56:45,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:56:45,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:56:45,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:56:45,990 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:56:45,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 02:56:46,024 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-10 02:56:46,024 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-10 02:56:46,024 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 02:56:46,024 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 02:56:46,024 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-10 02:56:46,024 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-10 02:56:46,025 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-10 02:56:46,025 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-10 02:56:46,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 02:56:46,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 02:56:46,025 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 02:56:46,025 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 02:56:46,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:56:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:56:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-10 02:56:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-10 02:56:46,353 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:56:46,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:56:46 BoogieIcfgContainer [2018-11-10 02:56:46,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:56:46,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 02:56:46,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 02:56:46,356 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 02:56:46,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:56:45" (1/3) ... [2018-11-10 02:56:46,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287df40d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:56:46, skipping insertion in model container [2018-11-10 02:56:46,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:45" (2/3) ... [2018-11-10 02:56:46,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287df40d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:56:46, skipping insertion in model container [2018-11-10 02:56:46,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:56:46" (3/3) ... [2018-11-10 02:56:46,358 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-10 02:56:46,364 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 02:56:46,371 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 02:56:46,382 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 02:56:46,400 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:56:46,401 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 02:56:46,401 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 02:56:46,401 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 02:56:46,401 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:56:46,401 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:56:46,401 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 02:56:46,401 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:56:46,401 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 02:56:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-11-10 02:56:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 02:56:46,418 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:56:46,418 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] [2018-11-10 02:56:46,420 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:56:46,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:46,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1708855369, now seen corresponding path program 1 times [2018-11-10 02:56:46,427 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:56:46,427 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:56:46,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:56:46,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:56:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:56:46,542 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 02:56:46,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:56:46,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 02:56:46,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 02:56:46,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 02:56:46,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 02:56:46,563 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 2 states. [2018-11-10 02:56:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:56:46,584 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2018-11-10 02:56:46,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 02:56:46,586 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-10 02:56:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:56:46,593 INFO L225 Difference]: With dead ends: 103 [2018-11-10 02:56:46,593 INFO L226 Difference]: Without dead ends: 44 [2018-11-10 02:56:46,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 02:56:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-10 02:56:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-10 02:56:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 02:56:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-10 02:56:46,627 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 32 [2018-11-10 02:56:46,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:56:46,628 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-10 02:56:46,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 02:56:46,628 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-10 02:56:46,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 02:56:46,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:56:46,630 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:56:46,630 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:56:46,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:46,631 INFO L82 PathProgramCache]: Analyzing trace with hash -918557474, now seen corresponding path program 1 times [2018-11-10 02:56:46,631 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:56:46,631 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:56:46,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:56:46,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:56:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:56:46,752 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-10 02:56:46,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:56:46,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:56:46,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:56:46,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:56:46,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:56:46,756 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2018-11-10 02:56:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:56:46,783 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-11-10 02:56:46,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:56:46,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 02:56:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:56:46,786 INFO L225 Difference]: With dead ends: 65 [2018-11-10 02:56:46,786 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 02:56:46,787 INFO L605 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-10 02:56:46,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 02:56:46,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-10 02:56:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 02:56:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2018-11-10 02:56:46,795 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 34 [2018-11-10 02:56:46,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:56:46,797 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2018-11-10 02:56:46,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:56:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2018-11-10 02:56:46,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 02:56:46,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:56:46,799 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:56:46,799 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:56:46,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:46,799 INFO L82 PathProgramCache]: Analyzing trace with hash -238499104, now seen corresponding path program 1 times [2018-11-10 02:56:46,799 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:56:46,800 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:56:46,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:56:46,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:56:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:56:46,960 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 02:56:46,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:56:46,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:56:46,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:56:46,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:56:46,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:56:46,963 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 5 states. [2018-11-10 02:56:47,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:56:47,045 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-11-10 02:56:47,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 02:56:47,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-10 02:56:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:56:47,047 INFO L225 Difference]: With dead ends: 86 [2018-11-10 02:56:47,047 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 02:56:47,047 INFO L605 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-10 02:56:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 02:56:47,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-10 02:56:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 02:56:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-11-10 02:56:47,052 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 34 [2018-11-10 02:56:47,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:56:47,053 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-11-10 02:56:47,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:56:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-10 02:56:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 02:56:47,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:56:47,054 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-10 02:56:47,054 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:56:47,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:47,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1064843297, now seen corresponding path program 1 times [2018-11-10 02:56:47,055 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:56:47,055 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 02:56:47,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:56:47,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:56:47,254 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-10 02:56:47,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:56:47,397 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-10 02:56:47,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:56:47,402 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/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-10 02:56:47,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:56:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:56:47,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:56:47,560 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-10 02:56:47,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:56:47,796 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-10 02:56:47,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 02:56:47,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7, 7] total 16 [2018-11-10 02:56:47,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 02:56:47,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 02:56:47,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-10 02:56:47,814 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 16 states. [2018-11-10 02:56:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:56:48,044 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2018-11-10 02:56:48,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 02:56:48,045 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-11-10 02:56:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:56:48,046 INFO L225 Difference]: With dead ends: 91 [2018-11-10 02:56:48,047 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 02:56:48,047 INFO L605 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-10 02:56:48,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 02:56:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-11-10 02:56:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 02:56:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-11-10 02:56:48,054 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 44 [2018-11-10 02:56:48,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:56:48,054 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-11-10 02:56:48,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 02:56:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-11-10 02:56:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 02:56:48,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:56:48,056 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-10 02:56:48,057 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:56:48,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:48,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1399535582, now seen corresponding path program 2 times [2018-11-10 02:56:48,058 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:56:48,058 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/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-10 02:56:48,070 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 02:56:48,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 02:56:48,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 02:56:48,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:56:48,204 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-10 02:56:48,204 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 02:56:48,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:56:48,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 02:56:48,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 02:56:48,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:56:48,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:56:48,207 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 6 states. [2018-11-10 02:56:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:56:48,273 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2018-11-10 02:56:48,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:56:48,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-10 02:56:48,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:56:48,275 INFO L225 Difference]: With dead ends: 69 [2018-11-10 02:56:48,275 INFO L226 Difference]: Without dead ends: 53 [2018-11-10 02:56:48,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:56:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-10 02:56:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-10 02:56:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 02:56:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-11-10 02:56:48,282 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 54 [2018-11-10 02:56:48,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:56:48,283 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-11-10 02:56:48,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 02:56:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2018-11-10 02:56:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 02:56:48,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:56:48,284 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-10 02:56:48,285 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:56:48,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:56:48,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1688326906, now seen corresponding path program 1 times [2018-11-10 02:56:48,285 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 02:56:48,286 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/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-10 02:56:48,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:56:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:56:48,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:56:48,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 02:56:48,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:48,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:48,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 02:56:48,711 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_write~intINTTYPE4_#ptr.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_write~intINTTYPE4_#ptr.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_write~intINTTYPE4_#ptr.base| (_ bv1 1))))) is different from true [2018-11-10 02:56:48,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 02:56:48,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:56:48,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:48,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:48,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:48,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 02:56:48,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-10 02:56:48,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-10 02:56:48,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:48,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:48,896 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-10 02:56:48,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:33 [2018-11-10 02:56:49,015 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:56:49,016 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:56:49,018 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:56:49,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-11-10 02:56:49,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2018-11-10 02:56:49,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:49,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:49,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 02:56:49,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:47 [2018-11-10 02:56:49,135 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-10 02:56:49,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:56:49,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:49,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:49,177 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-10 02:56:49,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:56:49,180 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:49,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:49,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 02:56:49,220 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:70, output treesize:71 [2018-11-10 02:56:50,211 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|node_create_write~intINTTYPE4_#value| (_ BitVec 32)) (|sll_insert_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|node_create_write~intINTTYPE4_#ptr.offset| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.offset| (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.offset| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.base| (_ BitVec 32))) (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) |node_create_write~$Pointer$_#ptr.offset| |node_create_write~$Pointer$_#value.base|)))) (let ((.cse2 (select (select .cse4 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (and (= (let ((.cse0 (let ((.cse1 (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) |node_create_write~$Pointer$_#ptr.offset| |node_create_write~$Pointer$_#value.offset|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_prenex_1 v_prenex_2))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) |sll_insert_write~$Pointer$_#ptr.offset| |sll_insert_write~$Pointer$_#value.offset|))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_int)| sll_insert_~new_node~0.base (store (select |c_old(#memory_int)| sll_insert_~new_node~0.base) |node_create_write~intINTTYPE4_#ptr.offset| |node_create_write~intINTTYPE4_#value|)) |c_#memory_int|) (= (let ((.cse3 (store .cse4 .cse2 (store (select .cse4 .cse2) v_prenex_1 v_prenex_3)))) (store .cse3 sll_insert_~new_node~0.base (store (select .cse3 sll_insert_~new_node~0.base) |sll_insert_write~$Pointer$_#ptr.offset| |sll_insert_write~$Pointer$_#value.base|))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)))))) is different from true [2018-11-10 02:56:52,956 WARN L179 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2018-11-10 02:56:53,036 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:56:53,066 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:56:53,118 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:56:53,119 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 02:56:53,119 INFO L303 Elim1Store]: Index analysis took 161 ms [2018-11-10 02:56:53,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-10 02:56:53,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:54,077 INFO L303 Elim1Store]: Index analysis took 225 ms [2018-11-10 02:56:54,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-11-10 02:56:54,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:56:54,104 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:54,245 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:54,925 INFO L303 Elim1Store]: Index analysis took 162 ms [2018-11-10 02:56:54,926 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 186 treesize of output 166 [2018-11-10 02:56:54,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:56:54,952 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:55,344 INFO L303 Elim1Store]: Index analysis took 161 ms [2018-11-10 02:56:55,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 148 [2018-11-10 02:56:55,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 02:56:55,359 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:55,614 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-11-10 02:56:55,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 142 [2018-11-10 02:56:55,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-11-10 02:56:55,687 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-10 02:56:55,855 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:56:56,141 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:56:56,416 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-10 02:56:56,883 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 139 treesize of output 119 [2018-11-10 02:56:56,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:56:56,892 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:57,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 58 [2018-11-10 02:56:57,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 02:56:57,016 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:57,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-11-10 02:56:57,088 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 14 treesize of output 11 [2018-11-10 02:56:57,089 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:57,112 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:57,128 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:57,166 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:57,231 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 143 treesize of output 123 [2018-11-10 02:56:57,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:56:57,239 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:57,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 58 [2018-11-10 02:56:57,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 02:56:57,375 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:57,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-11-10 02:56:57,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-11-10 02:56:57,477 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-11-10 02:56:57,532 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:56:57,589 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:56:57,676 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:56:57,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:57,858 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 17 variables, input treesize:299, output treesize:35 [2018-11-10 02:56:57,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 02:56:57,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 02:56:57,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:57,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:57,966 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 27 treesize of output 21 [2018-11-10 02:56:57,968 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 21 treesize of output 12 [2018-11-10 02:56:57,969 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:57,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:57,983 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-10 02:56:57,983 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:16 [2018-11-10 02:56:58,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 02:56:58,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 02:56:58,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:56:58,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:58,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:56:58,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-10 02:56:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2018-11-10 02:56:58,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:56:58,474 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-10 02:56:58,606 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-10 02:56:58,820 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-10 02:56:58,998 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-10 02:57:00,783 WARN L179 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 117 [2018-11-10 02:57:01,538 WARN L179 SmtUtils]: Spent 753.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-10 02:57:03,521 WARN L179 SmtUtils]: Spent 1.98 s on a formula simplification that was a NOOP. DAG size: 83 [2018-11-10 02:57:04,327 WARN L179 SmtUtils]: Spent 805.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-10 02:57:22,263 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 55 [2018-11-10 02:57:22,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:57:22,266 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/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-10 02:57:22,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:57:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:57:22,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:57:24,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 02:57:24,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 02:57:24,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:57:24,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 02:57:24,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 02:57:24,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:57:24,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:57:24,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:57:24,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:57:24,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-10 02:57:25,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 02:57:25,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:57:25,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:57:25,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:57:25,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 02:57:25,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:57:25,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 02:57:25,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:57:25,279 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-10 02:57:25,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2018-11-10 02:57:27,623 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-10 02:57:27,705 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_write~intINTTYPE4_#value| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.offset| (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.offset| (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.base| (_ BitVec 32))) (let ((.cse5 (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) |node_create_write~$Pointer$_#value.offset|))) (.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) |node_create_write~$Pointer$_#value.base|)))) (let ((.cse2 (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (.cse3 (bvadd (select (select .cse5 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) (_ bv4 32)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_5)))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (_ bv4 32) |sll_insert_write~$Pointer$_#value.base|)))) (= (store |c_old(#memory_int)| sll_insert_~new_node~0.base (store (select |c_old(#memory_int)| sll_insert_~new_node~0.base) (_ bv0 32) |node_create_write~intINTTYPE4_#value|)) |c_#memory_int|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)) (= (let ((.cse4 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_prenex_4)))) (store .cse4 sll_insert_~new_node~0.base (store (select .cse4 sll_insert_~new_node~0.base) (_ bv4 32) |sll_insert_write~$Pointer$_#value.offset|))) |c_#memory_$Pointer$.offset|))))) is different from true [2018-11-10 02:57:31,984 WARN L179 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 125 DAG size of output: 62 [2018-11-10 02:57:32,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:57:32,090 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:57:32,090 INFO L303 Elim1Store]: Index analysis took 105 ms [2018-11-10 02:57:32,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 02:57:32,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 02:57:32,847 INFO L303 Elim1Store]: Index analysis took 300 ms [2018-11-10 02:57:32,981 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 182 treesize of output 165 [2018-11-10 02:57:33,023 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 162 treesize of output 161 [2018-11-10 02:57:33,023 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 02:57:47,654 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:57:47,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 164 [2018-11-10 02:57:47,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 02:57:57,536 INFO L303 Elim1Store]: Index analysis took 530 ms [2018-11-10 02:57:57,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 160 treesize of output 157 [2018-11-10 02:57:57,722 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 150 treesize of output 149 [2018-11-10 02:57:57,723 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:01,532 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:01,541 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:01,542 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 02:58:01,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 154 [2018-11-10 02:58:01,610 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:08,672 INFO L303 Elim1Store]: Index analysis took 296 ms [2018-11-10 02:58:08,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 144 [2018-11-10 02:58:08,816 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:08,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:08,826 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 02:58:08,923 INFO L303 Elim1Store]: Index analysis took 127 ms [2018-11-10 02:58:08,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 147 [2018-11-10 02:58:08,924 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:09,546 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:58:15,742 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 131 treesize of output 128 [2018-11-10 02:58:15,759 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:15,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 106 [2018-11-10 02:58:15,807 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:15,942 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:58:18,408 INFO L303 Elim1Store]: Index analysis took 238 ms [2018-11-10 02:58:18,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 143 [2018-11-10 02:58:18,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:18,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 134 [2018-11-10 02:58:18,613 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:19,082 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:58:19,683 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:58:27,124 INFO L303 Elim1Store]: Index analysis took 527 ms [2018-11-10 02:58:27,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 157 treesize of output 156 [2018-11-10 02:58:27,298 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:27,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 178 [2018-11-10 02:58:27,320 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:31,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 139 treesize of output 138 [2018-11-10 02:58:31,647 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:36,314 INFO L303 Elim1Store]: Index analysis took 208 ms [2018-11-10 02:58:36,431 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 150 [2018-11-10 02:58:36,461 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 145 treesize of output 139 [2018-11-10 02:58:36,462 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:37,392 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:37,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 126 [2018-11-10 02:58:37,437 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:37,820 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:58:40,933 INFO L303 Elim1Store]: Index analysis took 256 ms [2018-11-10 02:58:41,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 143 [2018-11-10 02:58:41,092 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:41,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:41,104 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 02:58:41,222 INFO L303 Elim1Store]: Index analysis took 172 ms [2018-11-10 02:58:41,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 147 [2018-11-10 02:58:41,223 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:42,095 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 128 treesize of output 122 [2018-11-10 02:58:42,095 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:42,545 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:58:43,525 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:58:44,063 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:58:44,707 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 23 treesize of output 28 [2018-11-10 02:58:44,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:58:44,721 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:44,792 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:58:45,355 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:45,410 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 139 treesize of output 119 [2018-11-10 02:58:45,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:58:45,416 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:45,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 62 [2018-11-10 02:58:45,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:45,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 61 [2018-11-10 02:58:45,558 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:45,604 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 61 treesize of output 60 [2018-11-10 02:58:45,612 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 14 treesize of output 7 [2018-11-10 02:58:45,613 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:45,646 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:58:45,671 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:58:45,713 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:58:45,849 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 138 treesize of output 117 [2018-11-10 02:58:45,856 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 118 treesize of output 117 [2018-11-10 02:58:45,856 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:47,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:47,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 120 [2018-11-10 02:58:47,865 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:49,660 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 0 case distinctions, treesize of input 116 treesize of output 93 [2018-11-10 02:58:49,665 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-10 02:58:49,665 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:49,730 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2018-11-10 02:58:49,737 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:49,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 65 [2018-11-10 02:58:49,748 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:49,780 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:58:49,820 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:58:50,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 113 treesize of output 99 [2018-11-10 02:58:50,484 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 95 treesize of output 94 [2018-11-10 02:58:50,484 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:50,880 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:50,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 99 [2018-11-10 02:58:50,885 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:51,395 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:51,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 88 [2018-11-10 02:58:51,419 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 14 treesize of output 7 [2018-11-10 02:58:51,419 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:51,455 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:58:51,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 93 [2018-11-10 02:58:51,759 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 85 treesize of output 79 [2018-11-10 02:58:51,759 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:51,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:58:51,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 82 [2018-11-10 02:58:51,950 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:52,068 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:58:52,163 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:58:52,297 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:58:52,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 02:58:52,387 INFO L202 ElimStorePlain]: Needed 46 recursive calls to eliminate 12 variables, input treesize:319, output treesize:56 [2018-11-10 02:58:52,635 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 33 treesize of output 29 [2018-11-10 02:58:52,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 02:58:52,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:52,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:58:52,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-11-10 02:58:52,680 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 20 treesize of output 11 [2018-11-10 02:58:52,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:52,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:58:52,731 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 22 treesize of output 18 [2018-11-10 02:58:52,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-10 02:58:52,732 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:52,737 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:58:52,767 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2018-11-10 02:58:52,770 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 20 treesize of output 15 [2018-11-10 02:58:52,771 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:52,794 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 14 [2018-11-10 02:58:52,794 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 02:58:52,811 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:58:52,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:58:52,832 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:78, output treesize:19 [2018-11-10 02:58:52,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 02:58:52,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 02:58:52,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 02:58:52,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 02:58:52,977 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-10 02:58:52,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2018-11-10 02:58:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:58:52,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 02:58:53,145 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-10 02:58:53,306 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-10 02:58:53,565 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-10 02:58:53,800 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-11-10 02:58:57,140 WARN L179 SmtUtils]: Spent 3.34 s on a formula simplification that was a NOOP. DAG size: 146 [2018-11-10 02:58:58,281 WARN L179 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 73 [2018-11-10 02:59:00,239 WARN L179 SmtUtils]: Spent 1.96 s on a formula simplification that was a NOOP. DAG size: 93 [2018-11-10 02:59:01,618 WARN L179 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 85 [2018-11-10 02:59:08,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:59:08,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 45 [2018-11-10 02:59:08,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-10 02:59:08,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-10 02:59:08,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2014, Unknown=22, NotChecked=276, Total=2450 [2018-11-10 02:59:08,760 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 45 states. [2018-11-10 02:59:09,698 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-11-10 02:59:16,230 WARN L179 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2018-11-10 02:59:19,261 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_write~intINTTYPE4_#value| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.offset| (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.offset| (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.base| (_ BitVec 32))) (let ((.cse5 (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) |node_create_write~$Pointer$_#value.offset|))) (.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) |node_create_write~$Pointer$_#value.base|)))) (let ((.cse2 (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (.cse3 (bvadd (select (select .cse5 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) (_ bv4 32)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_5)))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (_ bv4 32) |sll_insert_write~$Pointer$_#value.base|)))) (= (store |c_old(#memory_int)| sll_insert_~new_node~0.base (store (select |c_old(#memory_int)| sll_insert_~new_node~0.base) (_ bv0 32) |node_create_write~intINTTYPE4_#value|)) |c_#memory_int|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)) (= (let ((.cse4 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_prenex_4)))) (store .cse4 sll_insert_~new_node~0.base (store (select .cse4 sll_insert_~new_node~0.base) (_ bv4 32) |sll_insert_write~$Pointer$_#value.offset|))) |c_#memory_$Pointer$.offset|))))) (exists ((|node_create_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|node_create_write~intINTTYPE4_#value| (_ BitVec 32)) (|sll_insert_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|node_create_write~intINTTYPE4_#ptr.offset| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.offset| (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.offset| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.base| (_ BitVec 32))) (let ((.cse10 (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) |node_create_write~$Pointer$_#ptr.offset| |node_create_write~$Pointer$_#value.base|)))) (let ((.cse8 (select (select .cse10 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (and (= (let ((.cse6 (let ((.cse7 (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) |node_create_write~$Pointer$_#ptr.offset| |node_create_write~$Pointer$_#value.offset|)))) (store .cse7 .cse8 (store (select .cse7 .cse8) v_prenex_1 v_prenex_2))))) (store .cse6 sll_insert_~new_node~0.base (store (select .cse6 sll_insert_~new_node~0.base) |sll_insert_write~$Pointer$_#ptr.offset| |sll_insert_write~$Pointer$_#value.offset|))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_int)| sll_insert_~new_node~0.base (store (select |c_old(#memory_int)| sll_insert_~new_node~0.base) |node_create_write~intINTTYPE4_#ptr.offset| |node_create_write~intINTTYPE4_#value|)) |c_#memory_int|) (= (let ((.cse9 (store .cse10 .cse8 (store (select .cse10 .cse8) v_prenex_1 v_prenex_3)))) (store .cse9 sll_insert_~new_node~0.base (store (select .cse9 sll_insert_~new_node~0.base) |sll_insert_write~$Pointer$_#ptr.offset| |sll_insert_write~$Pointer$_#value.base|))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base))))))) is different from true [2018-11-10 02:59:20,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:59:20,493 INFO L93 Difference]: Finished difference Result 105 states and 137 transitions. [2018-11-10 02:59:20,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 02:59:20,493 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 56 [2018-11-10 02:59:20,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:59:20,494 INFO L225 Difference]: With dead ends: 105 [2018-11-10 02:59:20,494 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 02:59:20,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=245, Invalid=3521, Unknown=32, NotChecked=492, Total=4290 [2018-11-10 02:59:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 02:59:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 02:59:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 02:59:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 02:59:20,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2018-11-10 02:59:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:59:20,496 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:59:20,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-10 02:59:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 02:59:20,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 02:59:20,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 02:59:20,870 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2018-11-10 02:59:20,872 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 561 563) no Hoare annotation was computed. [2018-11-10 02:59:20,872 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 561 563) the Hoare annotation is: true [2018-11-10 02:59:20,872 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 561 563) no Hoare annotation was computed. [2018-11-10 02:59:20,872 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-10 02:59:20,872 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 02:59:20,872 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-10 02:59:20,872 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 02:59:20,872 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 587) no Hoare annotation was computed. [2018-11-10 02:59:20,872 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 582 588) no Hoare annotation was computed. [2018-11-10 02:59:20,872 INFO L428 ceAbstractionStarter]: At program point L583-3(lines 583 587) the Hoare annotation is: true [2018-11-10 02:59:20,872 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 582 588) the Hoare annotation is: true [2018-11-10 02:59:20,872 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 582 588) no Hoare annotation was computed. [2018-11-10 02:59:20,873 INFO L421 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (let ((.cse1 (= |sll_create_#in~data| sll_create_~data)) (.cse0 (bvsgt sll_create_~len (_ bv0 32)))) (or (and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (or (and (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt |sll_create_#in~len| (_ bv0 32))) .cse0) .cse1 (= (_ bv0 32) sll_create_~head~0.offset) (= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) (_ bv0 32)))) (and .cse1 (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |old(#memory_int)| |#memory_int|) .cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) [2018-11-10 02:59:20,873 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-11-10 02:59:20,873 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 573 581) no Hoare annotation was computed. [2018-11-10 02:59:20,873 INFO L425 ceAbstractionStarter]: For program point L575-1(lines 575 579) no Hoare annotation was computed. [2018-11-10 02:59:20,873 INFO L425 ceAbstractionStarter]: For program point L575-3(lines 575 579) no Hoare annotation was computed. [2018-11-10 02:59:20,873 INFO L421 ceAbstractionStarter]: At program point L575-4(lines 575 579) the Hoare annotation is: (let ((.cse0 (= |sll_create_#in~data| sll_create_~data))) (or (and .cse0 (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) .cse0 (= (_ bv0 32) sll_create_~head~0.offset) (= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) (_ bv0 32)))))) [2018-11-10 02:59:20,873 INFO L425 ceAbstractionStarter]: For program point L575-5(lines 575 579) no Hoare annotation was computed. [2018-11-10 02:59:20,873 INFO L421 ceAbstractionStarter]: At program point sll_createENTRY(lines 573 581) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-10 02:59:20,873 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 573 581) no Hoare annotation was computed. [2018-11-10 02:59:20,873 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 02:59:20,873 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 02:59:20,873 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 02:59:20,873 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 02:59:20,873 INFO L425 ceAbstractionStarter]: For program point L598-1(lines 598 602) no Hoare annotation was computed. [2018-11-10 02:59:20,873 INFO L421 ceAbstractionStarter]: At program point sll_insertENTRY(lines 589 604) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-10 02:59:20,873 INFO L425 ceAbstractionStarter]: For program point L593-1(lines 593 597) no Hoare annotation was computed. [2018-11-10 02:59:20,873 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= 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-10 02:59:20,873 INFO L428 ceAbstractionStarter]: At program point L593-3(lines 593 597) the Hoare annotation is: true [2018-11-10 02:59:20,873 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-10 02:59:20,873 INFO L425 ceAbstractionStarter]: For program point L593-4(lines 589 604) no Hoare annotation was computed. [2018-11-10 02:59:20,874 INFO L425 ceAbstractionStarter]: For program point sll_insertEXIT(lines 589 604) no Hoare annotation was computed. [2018-11-10 02:59:20,874 INFO L425 ceAbstractionStarter]: For program point sll_insertFINAL(lines 589 604) no Hoare annotation was computed. [2018-11-10 02:59:20,874 INFO L428 ceAbstractionStarter]: At program point L638(line 638) the Hoare annotation is: true [2018-11-10 02:59:20,874 INFO L425 ceAbstractionStarter]: For program point L638-1(line 638) no Hoare annotation was computed. [2018-11-10 02:59:20,874 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 605 642) no Hoare annotation was computed. [2018-11-10 02:59:20,874 INFO L425 ceAbstractionStarter]: For program point L622(lines 622 624) no Hoare annotation was computed. [2018-11-10 02:59:20,874 INFO L425 ceAbstractionStarter]: For program point L614-1(lines 614 621) no Hoare annotation was computed. [2018-11-10 02:59:20,874 INFO L421 ceAbstractionStarter]: At program point L614-3(lines 614 621) the Hoare annotation is: (and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~mid_index~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-10 02:59:20,874 INFO L425 ceAbstractionStarter]: For program point L614-4(lines 614 621) no Hoare annotation was computed. [2018-11-10 02:59:20,874 INFO L425 ceAbstractionStarter]: For program point L627-1(lines 627 634) no Hoare annotation was computed. [2018-11-10 02:59:20,874 INFO L421 ceAbstractionStarter]: At program point L627-3(lines 627 634) the Hoare annotation is: (and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~mid_index~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-10 02:59:20,874 INFO L425 ceAbstractionStarter]: For program point L627-4(lines 605 642) no Hoare annotation was computed. [2018-11-10 02:59:20,874 INFO L421 ceAbstractionStarter]: At program point L611(line 611) 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 (select |#valid| .cse0) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_int| .cse0) (_ bv0 32)) main_~data~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~mid_index~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-10 02:59:20,874 INFO L425 ceAbstractionStarter]: For program point L611-1(line 611) no Hoare annotation was computed. [2018-11-10 02:59:20,874 INFO L421 ceAbstractionStarter]: At program point L636(lines 605 642) the Hoare annotation is: (and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~mid_index~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-10 02:59:20,874 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 605 642) no Hoare annotation was computed. [2018-11-10 02:59:20,874 INFO L425 ceAbstractionStarter]: For program point L616(lines 616 618) no Hoare annotation was computed. [2018-11-10 02:59:20,874 INFO L421 ceAbstractionStarter]: At program point L608(line 608) 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)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-10 02:59:20,874 INFO L425 ceAbstractionStarter]: For program point L608-1(line 608) no Hoare annotation was computed. [2018-11-10 02:59:20,874 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 605 642) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-10 02:59:20,875 INFO L425 ceAbstractionStarter]: For program point L629(lines 629 631) no Hoare annotation was computed. [2018-11-10 02:59:20,875 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 640) no Hoare annotation was computed. [2018-11-10 02:59:20,875 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 564 572) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-10 02:59:20,875 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 564 572) no Hoare annotation was computed. [2018-11-10 02:59:20,875 INFO L428 ceAbstractionStarter]: At program point L567(line 567) the Hoare annotation is: true [2018-11-10 02:59:20,875 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-11-10 02:59:20,875 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 564 572) no Hoare annotation was computed. [2018-11-10 02:59:20,875 INFO L425 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2018-11-10 02:59:20,892 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 02:59:20,893 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 02:59:20,893 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 02:59:20,893 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 02:59:20,893 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 02:59:20,894 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 02:59:20,894 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,894 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,894 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,894 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,894 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 02:59:20,895 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 02:59:20,895 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 02:59:20,895 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 02:59:20,895 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 02:59:20,895 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 02:59:20,895 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 02:59:20,895 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,896 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,896 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,896 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,896 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 02:59:20,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:59:20 BoogieIcfgContainer [2018-11-10 02:59:20,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 02:59:20,897 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:59:20,897 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:59:20,898 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:59:20,898 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:56:46" (3/4) ... [2018-11-10 02:59:20,900 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 02:59:20,904 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-11-10 02:59:20,905 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 02:59:20,905 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-11-10 02:59:20,905 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-11-10 02:59:20,905 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_insert [2018-11-10 02:59:20,905 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 02:59:20,905 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-10 02:59:20,910 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2018-11-10 02:59:20,910 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-11-10 02:59:20,910 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 02:59:20,928 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(data) == data && \valid == \old(\valid)) && \old(len) == len) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) || (((1bv1 == \valid[head] && \old(data) == data) && 0bv32 == head) && \old(data) == unknown-#memory_int-unknown[head][0bv32]) [2018-11-10 02:59:20,951 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0e40fe6a-aa7c-49ff-a2aa-8459ed6ddadc/bin-2019/utaipan/witness.graphml [2018-11-10 02:59:20,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:59:20,952 INFO L168 Benchmark]: Toolchain (without parser) took 155411.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 253.2 MB). Free memory was 945.5 MB in the beginning and 1.0 GB in the end (delta: -103.9 MB). Peak memory consumption was 149.3 MB. Max. memory is 11.5 GB. [2018-11-10 02:59:20,952 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:59:20,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.85 ms. Allocated memory is still 1.0 GB. Free memory was 945.5 MB in the beginning and 917.5 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2018-11-10 02:59:20,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 917.5 MB in the beginning and 1.1 GB in the end (delta: -212.5 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:59:20,953 INFO L168 Benchmark]: Boogie Preprocessor took 33.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:59:20,953 INFO L168 Benchmark]: RCFGBuilder took 363.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:59:20,953 INFO L168 Benchmark]: TraceAbstraction took 154543.21 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 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 142.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:59:20,956 INFO L168 Benchmark]: Witness Printer took 53.91 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2018-11-10 02:59:20,958 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.85 ms. Allocated memory is still 1.0 GB. Free memory was 945.5 MB in the beginning and 917.5 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 917.5 MB in the beginning and 1.1 GB in the end (delta: -212.5 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 363.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 154543.21 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 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 142.7 MB. Max. memory is 11.5 GB. * Witness Printer took 53.91 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. 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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 640]: 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: 627]: Loop Invariant Derived loop invariant: (s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(mid_index, 4294967295bv32) == 0bv32 - InvariantResult [Line: 614]: Loop Invariant Derived loop invariant: (s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(mid_index, 4294967295bv32) == 0bv32 - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(mid_index, 4294967295bv32) == 0bv32 - InvariantResult [Line: 575]: Loop Invariant [2018-11-10 02:59:20,961 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 02:59:20,961 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 02:59:20,962 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 02:59:20,962 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 02:59:20,962 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 02:59:20,962 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 02:59:20,962 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,962 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,962 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,963 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,963 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 02:59:20,963 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 02:59:20,963 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 02:59:20,963 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 02:59:20,963 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 02:59:20,964 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 02:59:20,964 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 02:59:20,964 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,964 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,964 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,964 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 02:59:20,964 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((\old(data) == data && \valid == \old(\valid)) && \old(len) == len) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) || (((1bv1 == \valid[head] && \old(data) == data) && 0bv32 == head) && \old(data) == unknown-#memory_int-unknown[head][0bv32]) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 60 locations, 1 error locations. SAFE Result, 154.4s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 12.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 298 SDtfs, 212 SDslu, 1341 SDs, 0 SdLazy, 1215 SolverSat, 51 SolverUnsat, 57 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 376 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 38.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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, 21 LocationsWithAnnotation, 50 PreInvPairs, 76 NumberOfFragments, 286 HoareAnnotationTreeSize, 50 FomulaSimplifications, 731 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 173 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 140.7s InterpolantComputationTime, 354 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 432 ConstructedInterpolants, 39 QuantifiedInterpolants, 217229 SizeOfPredicates, 176 NumberOfNonLiveVariables, 2071 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 63/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...