./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4aa4ae97046b46e050cb2478dec257c6a324dc09 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:56:57,559 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:56:57,560 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:56:57,567 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:56:57,567 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:56:57,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:56:57,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:56:57,570 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:56:57,571 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:56:57,571 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:56:57,572 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:56:57,572 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:56:57,573 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:56:57,573 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:56:57,574 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:56:57,575 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:56:57,575 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:56:57,577 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:56:57,578 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:56:57,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:56:57,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:56:57,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:56:57,582 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:56:57,582 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:56:57,583 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:56:57,583 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:56:57,584 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:56:57,585 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:56:57,585 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:56:57,586 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:56:57,586 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:56:57,586 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:56:57,587 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:56:57,587 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:56:57,587 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:56:57,588 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:56:57,588 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:56:57,596 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:56:57,596 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:56:57,597 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:56:57,597 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:56:57,597 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:56:57,598 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:56:57,598 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:56:57,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:56:57,598 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:56:57,598 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:56:57,598 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:56:57,598 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:56:57,599 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:56:57,599 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:56:57,599 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:56:57,599 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:56:57,599 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:56:57,599 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:56:57,599 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:56:57,599 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:56:57,599 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:56:57,600 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:56:57,600 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:56:57,600 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:56:57,600 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:56:57,600 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:56:57,600 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:56:57,600 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:56:57,601 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:56:57,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:56:57,601 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_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer 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 -> Automizer 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 -> 4aa4ae97046b46e050cb2478dec257c6a324dc09 [2018-11-28 11:56:57,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:56:57,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:56:57,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:56:57,634 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:56:57,634 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:56:57,635 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-28 11:56:57,672 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/data/c07d2d702/09f16fe84224412ca4f609f3bbea8fe7/FLAG2b15ebe62 [2018-11-28 11:56:58,106 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:56:58,107 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/sv-benchmarks/c/list-simple/dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-28 11:56:58,116 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/data/c07d2d702/09f16fe84224412ca4f609f3bbea8fe7/FLAG2b15ebe62 [2018-11-28 11:56:58,126 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/data/c07d2d702/09f16fe84224412ca4f609f3bbea8fe7 [2018-11-28 11:56:58,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:56:58,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:56:58,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:56:58,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:56:58,131 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:56:58,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:56:58" (1/1) ... [2018-11-28 11:56:58,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372e215b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:58, skipping insertion in model container [2018-11-28 11:56:58,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:56:58" (1/1) ... [2018-11-28 11:56:58,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:56:58,163 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:56:58,356 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:56:58,406 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:56:58,435 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:56:58,468 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:56:58,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:58 WrapperNode [2018-11-28 11:56:58,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:56:58,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:56:58,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:56:58,469 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:56:58,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:58" (1/1) ... [2018-11-28 11:56:58,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:58" (1/1) ... [2018-11-28 11:56:58,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:56:58,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:56:58,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:56:58,496 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:56:58,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:58" (1/1) ... [2018-11-28 11:56:58,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:58" (1/1) ... [2018-11-28 11:56:58,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:58" (1/1) ... [2018-11-28 11:56:58,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:58" (1/1) ... [2018-11-28 11:56:58,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:58" (1/1) ... [2018-11-28 11:56:58,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:58" (1/1) ... [2018-11-28 11:56:58,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:58" (1/1) ... [2018-11-28 11:56:58,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:56:58,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:56:58,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:56:58,525 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:56:58,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/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-28 11:56:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-28 11:56:58,569 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-28 11:56:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 11:56:58,569 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 11:56:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:56:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:56:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:56:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-28 11:56:58,570 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-28 11:56:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:56:58,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:56:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:56:58,570 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:56:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 11:56:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 11:56:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:56:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 11:56:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-28 11:56:58,571 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-28 11:56:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure dll_prepend [2018-11-28 11:56:58,571 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_prepend [2018-11-28 11:56:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:56:58,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:56:58,923 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:56:58,924 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 11:56:58,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:56:58 BoogieIcfgContainer [2018-11-28 11:56:58,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:56:58,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:56:58,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:56:58,928 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:56:58,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:56:58" (1/3) ... [2018-11-28 11:56:58,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e686774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:56:58, skipping insertion in model container [2018-11-28 11:56:58,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:56:58" (2/3) ... [2018-11-28 11:56:58,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e686774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:56:58, skipping insertion in model container [2018-11-28 11:56:58,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:56:58" (3/3) ... [2018-11-28 11:56:58,931 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-28 11:56:58,939 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:56:58,946 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:56:58,959 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:56:58,981 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:56:58,981 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:56:58,982 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:56:58,982 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:56:58,982 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:56:58,982 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:56:58,982 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:56:58,982 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:56:58,982 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:56:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-28 11:56:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:56:58,999 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:59,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:59,002 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:59,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:59,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2094879456, now seen corresponding path program 1 times [2018-11-28 11:56:59,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:59,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:59,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:59,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:59,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:59,140 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-28 11:56:59,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:56:59,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:56:59,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 11:56:59,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 11:56:59,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:56:59,159 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2018-11-28 11:56:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:59,174 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-11-28 11:56:59,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:56:59,175 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-28 11:56:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:59,180 INFO L225 Difference]: With dead ends: 86 [2018-11-28 11:56:59,180 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 11:56:59,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:56:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 11:56:59,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-28 11:56:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 11:56:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-28 11:56:59,210 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 30 [2018-11-28 11:56:59,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:59,211 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-28 11:56:59,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 11:56:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-28 11:56:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:56:59,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:59,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:59,212 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:59,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:59,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2094870807, now seen corresponding path program 1 times [2018-11-28 11:56:59,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:59,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:59,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:59,385 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-28 11:56:59,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:56:59,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 11:56:59,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:56:59,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:56:59,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:56:59,387 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 10 states. [2018-11-28 11:56:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:59,506 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-28 11:56:59,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:56:59,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-28 11:56:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:59,507 INFO L225 Difference]: With dead ends: 43 [2018-11-28 11:56:59,507 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 11:56:59,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:56:59,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 11:56:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-28 11:56:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 11:56:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-28 11:56:59,514 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 30 [2018-11-28 11:56:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:59,514 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-28 11:56:59,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:56:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-28 11:56:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:56:59,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:59,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:59,516 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:59,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:59,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2094872481, now seen corresponding path program 1 times [2018-11-28 11:56:59,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:59,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:59,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:59,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:59,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:59,579 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-28 11:56:59,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:56:59,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:56:59,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:56:59,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:56:59,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:56:59,580 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-11-28 11:56:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:59,602 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-28 11:56:59,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:56:59,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-28 11:56:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:59,603 INFO L225 Difference]: With dead ends: 66 [2018-11-28 11:56:59,603 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 11:56:59,603 INFO L631 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-28 11:56:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 11:56:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-28 11:56:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 11:56:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-28 11:56:59,609 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2018-11-28 11:56:59,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:59,609 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-28 11:56:59,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:56:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-28 11:56:59,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 11:56:59,611 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:59,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:59,611 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:59,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:59,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1504377949, now seen corresponding path program 1 times [2018-11-28 11:56:59,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:59,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:59,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:59,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:59,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:56:59,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:56:59,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:56:59,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:56:59,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:56:59,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:56:59,658 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2018-11-28 11:56:59,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:59,671 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2018-11-28 11:56:59,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:56:59,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-28 11:56:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:59,672 INFO L225 Difference]: With dead ends: 71 [2018-11-28 11:56:59,672 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 11:56:59,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:56:59,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 11:56:59,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-28 11:56:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 11:56:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-28 11:56:59,676 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 35 [2018-11-28 11:56:59,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:59,676 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-28 11:56:59,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:56:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-28 11:56:59,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 11:56:59,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:59,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:59,677 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:59,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:59,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1370364443, now seen corresponding path program 1 times [2018-11-28 11:56:59,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:59,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:59,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:59,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:59,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:56:59,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:56:59,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/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-28 11:56:59,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:56:59,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:56:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:56:59,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:56:59,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 11:56:59,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:56:59,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:56:59,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:56:59,835 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2018-11-28 11:56:59,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:56:59,866 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-11-28 11:56:59,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:56:59,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-11-28 11:56:59,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:56:59,867 INFO L225 Difference]: With dead ends: 71 [2018-11-28 11:56:59,868 INFO L226 Difference]: Without dead ends: 47 [2018-11-28 11:56:59,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:56:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-28 11:56:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-28 11:56:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 11:56:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-28 11:56:59,873 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2018-11-28 11:56:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:56:59,874 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-28 11:56:59,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:56:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-28 11:56:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 11:56:59,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:56:59,875 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:56:59,875 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:56:59,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:56:59,875 INFO L82 PathProgramCache]: Analyzing trace with hash 2118555171, now seen corresponding path program 1 times [2018-11-28 11:56:59,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:56:59,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:56:59,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:59,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:56:59,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:56:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:57:00,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:57:00,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:57:00,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/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-28 11:57:00,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:57:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:57:00,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:57:00,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:57:00,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:00,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:00,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-28 11:57:15,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:57:15,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:57:15,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 11:57:15,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-28 11:57:15,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:15,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:15,737 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-28 11:57:15,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:26 [2018-11-28 11:57:16,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:57:16,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:57:16,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:16,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:16,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:16,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-11-28 11:57:20,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 11:57:20,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:57:20,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 11:57:20,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:20,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:20,580 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:57:20,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:57:20,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:57:20,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:79, output treesize:62 [2018-11-28 11:57:23,784 WARN L180 SmtUtils]: Spent 651.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-28 11:57:23,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 146 [2018-11-28 11:57:23,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 142 [2018-11-28 11:57:23,792 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:57:23,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:57:23,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 203 [2018-11-28 11:57:23,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 53 [2018-11-28 11:57:23,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:23,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 99 [2018-11-28 11:57:23,857 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 11:57:23,866 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:57:23,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:57:23,881 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:172, output treesize:82 [2018-11-28 11:57:26,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-11-28 11:57:26,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:57:26,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:26,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:26,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 82 [2018-11-28 11:57:26,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:57:26,354 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:26,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:26,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 78 [2018-11-28 11:57:26,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:57:26,444 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:26,453 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:26,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-11-28 11:57:26,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:57:26,458 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:26,464 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:26,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 74 [2018-11-28 11:57:26,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-28 11:57:26,490 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:26,496 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:26,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 66 [2018-11-28 11:57:26,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2018-11-28 11:57:26,529 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:26,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 38 [2018-11-28 11:57:26,558 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-28 11:57:26,574 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:57:26,601 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 3 xjuncts. [2018-11-28 11:57:26,601 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:136, output treesize:135 [2018-11-28 11:57:28,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:57:28,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:57:28,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:57:28,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:57:28,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-11-28 11:57:28,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:28,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-28 11:57:28,823 INFO L478 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 10 treesize of output 8 [2018-11-28 11:57:28,823 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:28,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:28,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:28,830 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:166, output treesize:33 [2018-11-28 11:57:28,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-28 11:57:28,866 INFO L478 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-28 11:57:28,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:28,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:28,876 INFO L478 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 15 treesize of output 11 [2018-11-28 11:57:28,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 11:57:28,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:28,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:28,882 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-28 11:57:28,882 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:14 [2018-11-28 11:57:28,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 11:57:28,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 11:57:28,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:57:28,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:57:28,914 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-28 11:57:28,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-28 11:57:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:57:28,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:57:28,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 38 [2018-11-28 11:57:28,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-28 11:57:28,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-28 11:57:28,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1250, Unknown=53, NotChecked=0, Total=1406 [2018-11-28 11:57:28,955 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 38 states. [2018-11-28 11:57:38,685 WARN L180 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 19 [2018-11-28 11:57:42,948 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 45 DAG size of output: 21 [2018-11-28 11:57:58,065 WARN L180 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 54 DAG size of output: 28 [2018-11-28 11:58:05,004 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 11:58:16,081 WARN L180 SmtUtils]: Spent 492.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-28 11:58:22,270 WARN L180 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 11:58:30,234 WARN L180 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 11:58:38,500 WARN L180 SmtUtils]: Spent 897.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-28 11:58:51,878 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 77 [2018-11-28 11:58:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:58:55,892 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-28 11:58:55,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 11:58:55,892 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 40 [2018-11-28 11:58:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:58:55,893 INFO L225 Difference]: With dead ends: 64 [2018-11-28 11:58:55,894 INFO L226 Difference]: Without dead ends: 62 [2018-11-28 11:58:55,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 57.8s TimeCoverageRelationStatistics Valid=214, Invalid=2466, Unknown=76, NotChecked=0, Total=2756 [2018-11-28 11:58:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-28 11:58:55,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-11-28 11:58:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 11:58:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-11-28 11:58:55,902 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 40 [2018-11-28 11:58:55,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:58:55,904 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-11-28 11:58:55,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-28 11:58:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-28 11:58:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 11:58:55,905 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:58:55,905 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-28 11:58:55,905 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:58:55,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:58:55,905 INFO L82 PathProgramCache]: Analyzing trace with hash 390225691, now seen corresponding path program 2 times [2018-11-28 11:58:55,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:58:55,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:58:55,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:58:55,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:58:55,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:58:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:58:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:58:55,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:58:55,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:58:55,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:58:56,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:58:56,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:58:56,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:58:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:58:56,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:58:56,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 11:58:56,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:58:56,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:58:56,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:58:56,078 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 7 states. [2018-11-28 11:58:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:58:56,104 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-11-28 11:58:56,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:58:56,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-28 11:58:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:58:56,105 INFO L225 Difference]: With dead ends: 73 [2018-11-28 11:58:56,105 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 11:58:56,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:58:56,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 11:58:56,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 11:58:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 11:58:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-11-28 11:58:56,110 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 45 [2018-11-28 11:58:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:58:56,110 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-28 11:58:56,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:58:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-28 11:58:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 11:58:56,111 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:58:56,111 INFO L402 BasicCegarLoop]: trace histogram [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-28 11:58:56,112 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:58:56,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:58:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash 117064084, now seen corresponding path program 1 times [2018-11-28 11:58:56,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:58:56,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:58:56,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:58:56,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:58:56,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:58:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:58:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:58:56,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:58:56,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:58:56,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:58:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:58:56,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:58:56,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:58:56,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:56,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:56,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:58:59,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:59,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:59,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:58:59,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-11-28 11:58:59,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-28 11:58:59,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:58:59,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:58:59,261 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-28 11:58:59,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:35 [2018-11-28 11:58:59,482 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:58:59,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:58:59,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:58:59,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:55 [2018-11-28 11:59:00,234 WARN L180 SmtUtils]: Spent 688.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 11:59:00,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 171 [2018-11-28 11:59:00,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 169 [2018-11-28 11:59:00,240 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:00,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:00,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:00,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:188, output treesize:184 [2018-11-28 11:59:03,101 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 11:59:03,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:59:03,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:59:03,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,124 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-28 11:59:03,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:344, output treesize:340 [2018-11-28 11:59:03,320 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 58 [2018-11-28 11:59:03,324 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:03,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:03,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:03,328 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:03,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-11-28 11:59:03,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:03,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:03,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:03,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:03,383 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:59:03,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 174 [2018-11-28 11:59:03,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 69 [2018-11-28 11:59:03,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-11-28 11:59:03,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 62 [2018-11-28 11:59:03,438 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,447 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-11-28 11:59:03,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-28 11:59:03,479 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:03,485 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:03,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 62 [2018-11-28 11:59:03,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 59 [2018-11-28 11:59:03,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-28 11:59:03,513 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,520 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,526 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 88 treesize of output 76 [2018-11-28 11:59:03,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-28 11:59:03,548 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-28 11:59:03,561 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-11-28 11:59:03,571 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,578 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,588 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:03,602 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:390, output treesize:91 [2018-11-28 11:59:03,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 11:59:03,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 11:59:03,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:03,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:91 [2018-11-28 11:59:03,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 51 [2018-11-28 11:59:03,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-28 11:59:03,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 11:59:03,722 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2018-11-28 11:59:03,727 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:03,731 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-28 11:59:03,731 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:4 [2018-11-28 11:59:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:59:03,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:59:03,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 39 [2018-11-28 11:59:03,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-28 11:59:03,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-28 11:59:03,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1369, Unknown=7, NotChecked=0, Total=1482 [2018-11-28 11:59:03,768 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 39 states. [2018-11-28 11:59:10,047 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-28 11:59:10,607 WARN L180 SmtUtils]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 11:59:11,064 WARN L180 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-28 11:59:15,479 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 11:59:20,548 WARN L180 SmtUtils]: Spent 2.30 s on a formula simplification that was a NOOP. DAG size: 47 [2018-11-28 11:59:27,718 WARN L180 SmtUtils]: Spent 2.92 s on a formula simplification that was a NOOP. DAG size: 48 [2018-11-28 11:59:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:59:32,310 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-11-28 11:59:32,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 11:59:32,311 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 42 [2018-11-28 11:59:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:59:32,311 INFO L225 Difference]: With dead ends: 90 [2018-11-28 11:59:32,311 INFO L226 Difference]: Without dead ends: 63 [2018-11-28 11:59:32,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=285, Invalid=3366, Unknown=9, NotChecked=0, Total=3660 [2018-11-28 11:59:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-28 11:59:32,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2018-11-28 11:59:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 11:59:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-11-28 11:59:32,318 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 42 [2018-11-28 11:59:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:59:32,318 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-28 11:59:32,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-28 11:59:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-28 11:59:32,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 11:59:32,319 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:59:32,319 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:59:32,319 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:59:32,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:59:32,320 INFO L82 PathProgramCache]: Analyzing trace with hash 117065758, now seen corresponding path program 1 times [2018-11-28 11:59:32,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:59:32,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:59:32,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:59:32,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:59:32,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:59:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:59:33,522 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2018-11-28 11:59:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:59:33,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:59:33,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/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-28 11:59:33,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:59:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:59:33,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:59:33,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:59:33,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:59:33,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:33,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-28 11:59:34,020 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:34,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:34,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-28 11:59:34,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-11-28 11:59:34,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:34,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-11-28 11:59:34,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:34,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:34,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:34,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-11-28 11:59:34,042 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:59:34,047 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:34,051 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:34,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:34,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:34,062 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:67, output treesize:33 [2018-11-28 11:59:34,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:34,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-28 11:59:34,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-28 11:59:34,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:59:34,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:34,117 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-28 11:59:34,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:33 [2018-11-28 11:59:34,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:34,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:34,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:59:34,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-11-28 11:59:34,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-28 11:59:34,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:59:34,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:59:34,295 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-28 11:59:34,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:44 [2018-11-28 11:59:34,497 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:34,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:34,521 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:34,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:34,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:34,537 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:108, output treesize:80 [2018-11-28 11:59:35,437 WARN L180 SmtUtils]: Spent 811.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-28 11:59:36,431 WARN L180 SmtUtils]: Spent 877.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-28 11:59:36,434 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:36,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:36,473 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:36,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:36,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:36,506 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:119, output treesize:123 [2018-11-28 11:59:39,828 WARN L180 SmtUtils]: Spent 3.21 s on a formula simplification that was a NOOP. DAG size: 60 [2018-11-28 11:59:39,832 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:39,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:39,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:39,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:687, output treesize:697 [2018-11-28 11:59:42,084 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:42,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:42,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-11-28 11:59:42,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:1079, output treesize:1153 [2018-11-28 12:00:05,149 WARN L180 SmtUtils]: Spent 6.69 s on a formula simplification. DAG size of input: 419 DAG size of output: 97 [2018-11-28 12:00:05,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:00:05,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:00:05,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:00:05,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:00:05,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-11-28 12:00:05,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:05,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:00:05,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:00:05,557 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:00:05,581 INFO L303 Elim1Store]: Index analysis took 212 ms [2018-11-28 12:00:05,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 533 treesize of output 391 [2018-11-28 12:00:05,891 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2018-11-28 12:00:05,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 82 [2018-11-28 12:00:05,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-11-28 12:00:05,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2018-11-28 12:00:05,938 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:06,002 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:06,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:06,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 294 treesize of output 330 [2018-11-28 12:00:06,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 320 [2018-11-28 12:00:06,355 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:06,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:00:06,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:00:06,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 279 [2018-11-28 12:00:06,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 268 [2018-11-28 12:00:06,772 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:06,881 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:07,224 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:00:07,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 294 [2018-11-28 12:00:07,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 248 [2018-11-28 12:00:07,250 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:00:07,330 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:00:07,492 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:00:07,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 299 treesize of output 271 [2018-11-28 12:00:07,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 218 [2018-11-28 12:00:07,763 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:00:07,866 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:00:07,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 266 [2018-11-28 12:00:07,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 183 [2018-11-28 12:00:07,886 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:00:07,975 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:00:08,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 247 [2018-11-28 12:00:08,404 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:00:08,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 35 treesize of output 39 [2018-11-28 12:00:08,405 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:08,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 12:00:08,504 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:08,582 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:08,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 236 [2018-11-28 12:00:08,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-28 12:00:08,601 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:00:08,755 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:00:08,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 33 treesize of output 31 [2018-11-28 12:00:08,756 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:08,833 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:09,145 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 12:00:09,527 INFO L478 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 266 treesize of output 253 [2018-11-28 12:00:09,721 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-11-28 12:00:09,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 12:00:09,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2018-11-28 12:00:09,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-11-28 12:00:09,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 49 [2018-11-28 12:00:09,765 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:09,785 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:09,805 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:09,822 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:09,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 236 [2018-11-28 12:00:09,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 229 [2018-11-28 12:00:09,973 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,191 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:00:10,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 200 [2018-11-28 12:00:10,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 184 [2018-11-28 12:00:10,195 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,218 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,328 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:00:10,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 208 [2018-11-28 12:00:10,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 187 [2018-11-28 12:00:10,336 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,365 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,404 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,447 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,498 INFO L478 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 271 treesize of output 258 [2018-11-28 12:00:10,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 12:00:10,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2018-11-28 12:00:10,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-11-28 12:00:10,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 49 [2018-11-28 12:00:10,543 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,562 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,581 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,596 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 216 [2018-11-28 12:00:10,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-28 12:00:10,698 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,752 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:00:10,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 198 [2018-11-28 12:00:10,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 189 [2018-11-28 12:00:10,757 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,779 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,797 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,831 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:10,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 249 [2018-11-28 12:00:11,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-28 12:00:11,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2018-11-28 12:00:11,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-11-28 12:00:11,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2018-11-28 12:00:11,071 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,077 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,083 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,089 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 141 [2018-11-28 12:00:11,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 121 [2018-11-28 12:00:11,158 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,222 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:00:11,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 102 [2018-11-28 12:00:11,223 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 117 [2018-11-28 12:00:11,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-28 12:00:11,279 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,290 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 118 [2018-11-28 12:00:11,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-28 12:00:11,324 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,335 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,369 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:00:11,411 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:00:11,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 243 [2018-11-28 12:00:11,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-28 12:00:11,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2018-11-28 12:00:11,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-11-28 12:00:11,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2018-11-28 12:00:11,444 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,450 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,457 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,463 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 88 [2018-11-28 12:00:11,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:00:11,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 47 [2018-11-28 12:00:11,502 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 106 [2018-11-28 12:00:11,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-28 12:00:11,524 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,533 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,539 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,562 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:11,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:00:11,652 INFO L202 ElimStorePlain]: Needed 63 recursive calls to eliminate 13 variables, input treesize:1216, output treesize:364 [2018-11-28 12:00:28,793 WARN L180 SmtUtils]: Spent 17.05 s on a formula simplification that was a NOOP. DAG size: 64 [2018-11-28 12:00:34,940 WARN L180 SmtUtils]: Spent 6.02 s on a formula simplification that was a NOOP. DAG size: 97 [2018-11-28 12:00:34,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 137 [2018-11-28 12:00:34,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:00:34,961 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:00:34,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-11-28 12:00:34,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:34,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-11-28 12:00:34,982 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:34,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 60 [2018-11-28 12:00:34,994 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:00:35,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 12:00:35,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2018-11-28 12:00:35,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-28 12:00:35,049 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:35,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-28 12:00:35,060 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:35,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:00:35,069 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:00:35,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-11-28 12:00:35,069 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:35,075 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:35,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 174 [2018-11-28 12:00:35,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:00:35,115 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 12:00:35,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2018-11-28 12:00:35,116 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:35,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-11-28 12:00:35,134 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:35,148 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:35,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 82 [2018-11-28 12:00:35,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2018-11-28 12:00:35,178 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:35,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-28 12:00:35,188 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:35,194 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:35,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 12:00:35,207 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:426, output treesize:40 [2018-11-28 12:00:38,083 WARN L180 SmtUtils]: Spent 2.81 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 12:00:42,200 WARN L180 SmtUtils]: Spent 2.76 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 12:00:42,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-28 12:00:42,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 12:00:42,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:42,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:42,227 INFO L478 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 22 treesize of output 18 [2018-11-28 12:00:42,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 12:00:42,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:00:42,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:00:42,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:00:42,237 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:52, output treesize:11 [2018-11-28 12:00:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:00:42,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:00:42,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 49 [2018-11-28 12:00:42,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-28 12:00:42,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-28 12:00:42,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2195, Unknown=11, NotChecked=0, Total=2352 [2018-11-28 12:00:42,314 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 49 states. [2018-11-28 12:01:40,175 WARN L180 SmtUtils]: Spent 13.79 s on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2018-11-28 12:02:05,232 WARN L180 SmtUtils]: Spent 23.52 s on a formula simplification. DAG size of input: 157 DAG size of output: 83 [2018-11-28 12:02:33,040 WARN L180 SmtUtils]: Spent 25.42 s on a formula simplification. DAG size of input: 163 DAG size of output: 89 [2018-11-28 12:02:47,770 WARN L180 SmtUtils]: Spent 13.33 s on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2018-11-28 12:03:00,840 WARN L180 SmtUtils]: Spent 12.96 s on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2018-11-28 12:03:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:03:01,554 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-11-28 12:03:01,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-28 12:03:01,555 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 42 [2018-11-28 12:03:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:03:01,555 INFO L225 Difference]: With dead ends: 59 [2018-11-28 12:03:01,555 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:03:01,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 148.6s TimeCoverageRelationStatistics Valid=257, Invalid=3634, Unknown=15, NotChecked=0, Total=3906 [2018-11-28 12:03:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:03:01,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:03:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:03:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:03:01,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-11-28 12:03:01,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:03:01,557 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:03:01,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-28 12:03:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:03:01,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:03:01,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 12:03:01,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:03:01,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 12:03:03,430 WARN L180 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2018-11-28 12:03:03,669 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 37 [2018-11-28 12:03:03,725 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 12:03:03,725 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-28 12:03:03,726 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:03:03,726 INFO L451 ceAbstractionStarter]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2018-11-28 12:03:03,726 INFO L448 ceAbstractionStarter]: For program point myexitFINAL(lines 561 563) no Hoare annotation was computed. [2018-11-28 12:03:03,726 INFO L448 ceAbstractionStarter]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2018-11-28 12:03:03,726 INFO L451 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2018-11-28 12:03:03,726 INFO L448 ceAbstractionStarter]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2018-11-28 12:03:03,726 INFO L444 ceAbstractionStarter]: At program point dll_createENTRY(lines 574 591) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-28 12:03:03,726 INFO L444 ceAbstractionStarter]: At program point L576-2(lines 576 589) the Hoare annotation is: (let ((.cse0 (= |dll_create_#in~data| dll_create_~data)) (.cse3 (<= (+ dll_create_~len 2) |dll_create_#in~len|)) (.cse2 (not (= 0 dll_create_~head~0.base)))) (or (and (= dll_create_~head~0.base 0) (<= dll_create_~len |dll_create_#in~len|) (<= |dll_create_#in~len| dll_create_~len) (= dll_create_~head~0.offset 0) (= |#valid| |old(#valid)|) .cse0 (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (let ((.cse1 (+ dll_create_~len 1))) (and (<= .cse1 |dll_create_#in~len|) .cse2 (<= |dll_create_#in~len| .cse1) .cse0 (exists ((v_subst_1 Int)) (and (= |#valid| (store (store |old(#valid)| v_subst_1 1) dll_create_~head~0.base 1)) (= (select |old(#valid)| v_subst_1) 0))) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base 1)) (= (select |old(#valid)| dll_create_~head~0.base) 0))) (and (<= 3 |dll_create_#in~len|) .cse3) (and .cse3 (= |dll_create_#in~data| (select (select |#memory_int| dll_create_~head~0.base) dll_create_~head~0.offset)) (exists ((v_subst_3 Int)) (let ((.cse4 (store |old(#valid)| v_subst_3 1))) (and (= |#valid| (store .cse4 dll_create_~head~0.base 1)) (= (select |old(#valid)| v_subst_3) 0) (= (select .cse4 dll_create_~head~0.base) 0)))) (exists ((dll_create_~head~0.base Int)) (let ((.cse5 (store |old(#valid)| dll_create_~head~0.base 1))) (and (= (store .cse5 dll_create_~new_head~0.base 1) |#valid|) (= (select .cse5 dll_create_~new_head~0.base) 0) (= (select |old(#valid)| dll_create_~head~0.base) 0)))) (not (= dll_create_~new_head~0.base 0)) .cse2 (= |dll_create_#in~data| (select (select |#memory_int| dll_create_~new_head~0.base) dll_create_~new_head~0.offset)) (= 0 dll_create_~head~0.offset) (= 0 dll_create_~new_head~0.offset)))) [2018-11-28 12:03:03,726 INFO L448 ceAbstractionStarter]: For program point L576-3(lines 576 589) no Hoare annotation was computed. [2018-11-28 12:03:03,726 INFO L448 ceAbstractionStarter]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2018-11-28 12:03:03,727 INFO L451 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2018-11-28 12:03:03,727 INFO L448 ceAbstractionStarter]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2018-11-28 12:03:03,727 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2018-11-28 12:03:03,727 INFO L448 ceAbstractionStarter]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2018-11-28 12:03:03,727 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 580) no Hoare annotation was computed. [2018-11-28 12:03:03,727 INFO L448 ceAbstractionStarter]: For program point dll_prependEXIT(lines 599 606) no Hoare annotation was computed. [2018-11-28 12:03:03,727 INFO L448 ceAbstractionStarter]: For program point L602(lines 602 604) no Hoare annotation was computed. [2018-11-28 12:03:03,727 INFO L444 ceAbstractionStarter]: At program point L600(line 600) the Hoare annotation is: (and (= dll_prepend_~data |dll_prepend_#in~data|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= dll_prepend_~head.offset |dll_prepend_#in~head.offset|) (= dll_prepend_~head.base |dll_prepend_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-28 12:03:03,727 INFO L448 ceAbstractionStarter]: For program point L602-2(lines 602 604) no Hoare annotation was computed. [2018-11-28 12:03:03,727 INFO L448 ceAbstractionStarter]: For program point L600-1(line 600) no Hoare annotation was computed. [2018-11-28 12:03:03,727 INFO L444 ceAbstractionStarter]: At program point dll_prependENTRY(lines 599 606) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-28 12:03:03,727 INFO L448 ceAbstractionStarter]: For program point dll_prependFINAL(lines 599 606) no Hoare annotation was computed. [2018-11-28 12:03:03,727 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:03:03,727 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 12:03:03,727 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 12:03:03,727 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 12:03:03,728 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 607 629) no Hoare annotation was computed. [2018-11-28 12:03:03,728 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 607 629) no Hoare annotation was computed. [2018-11-28 12:03:03,728 INFO L448 ceAbstractionStarter]: For program point L616(lines 616 618) no Hoare annotation was computed. [2018-11-28 12:03:03,728 INFO L444 ceAbstractionStarter]: At program point L614-2(lines 614 621) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse1) 4))) (and (= 1 main_~data~0) (not (= 0 .cse0)) (= |main_~#s~0.offset| 0) (not (= 0 .cse1)) (= 0 (select (select |#memory_$Pointer$.offset| .cse1) 4)) (= main_~data~0 (select (select |#memory_int| .cse0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (<= main_~len~0 2) (<= 2 main_~len~0) (= (select |#valid| |main_~#s~0.base|) 1)))) [2018-11-28 12:03:03,728 INFO L448 ceAbstractionStarter]: For program point L614-3(lines 607 629) no Hoare annotation was computed. [2018-11-28 12:03:03,728 INFO L444 ceAbstractionStarter]: At program point L610(line 610) the Hoare annotation is: (and (exists ((dll_create_~head~0.base Int)) (and (= |#valid| (store |old(#valid)| dll_create_~head~0.base 1)) (= (select |old(#valid)| dll_create_~head~0.base) 0))) (= |main_~#s~0.offset| 0) (<= main_~len~0 2) (= main_~data~0 1) (<= 2 main_~len~0) (= (select |#valid| |main_~#s~0.base|) 1)) [2018-11-28 12:03:03,728 INFO L448 ceAbstractionStarter]: For program point L610-1(line 610) no Hoare annotation was computed. [2018-11-28 12:03:03,728 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 607 629) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-28 12:03:03,728 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 627) no Hoare annotation was computed. [2018-11-28 12:03:03,728 INFO L451 ceAbstractionStarter]: At program point L625(line 625) the Hoare annotation is: true [2018-11-28 12:03:03,728 INFO L448 ceAbstractionStarter]: For program point L625-1(line 625) no Hoare annotation was computed. [2018-11-28 12:03:03,729 INFO L444 ceAbstractionStarter]: At program point L623(lines 607 629) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse1) 4))) (and (= 1 main_~data~0) (not (= 0 .cse0)) (= |main_~#s~0.offset| 0) (not (= 0 .cse1)) (= 0 (select (select |#memory_$Pointer$.offset| .cse1) 4)) (= main_~data~0 (select (select |#memory_int| .cse0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (<= main_~len~0 2) (<= 2 main_~len~0) (= (select |#valid| |main_~#s~0.base|) 1)))) [2018-11-28 12:03:03,729 INFO L444 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 (= 1 (select |#valid| .cse0)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= .cse0 0)) (= |main_~#s~0.offset| 0) (not (= |main_~#s~0.base| .cse0)) (exists ((v_subst_2 Int)) (and (= 1 (select |#valid| v_subst_2)) (not (= |main_~#s~0.base| v_subst_2)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) v_subst_2)))) (= main_~data~0 (select (select |#memory_int| .cse0) 0)) (<= main_~len~0 2) (= main_~data~0 1) (= (select |#valid| |main_~#s~0.base|) 1) (<= 2 main_~len~0))) [2018-11-28 12:03:03,729 INFO L448 ceAbstractionStarter]: For program point L611-1(line 611) no Hoare annotation was computed. [2018-11-28 12:03:03,729 INFO L448 ceAbstractionStarter]: For program point dll_destroyEXIT(lines 592 598) no Hoare annotation was computed. [2018-11-28 12:03:03,729 INFO L451 ceAbstractionStarter]: At program point dll_destroyENTRY(lines 592 598) the Hoare annotation is: true [2018-11-28 12:03:03,729 INFO L451 ceAbstractionStarter]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2018-11-28 12:03:03,729 INFO L448 ceAbstractionStarter]: For program point L593-3(lines 592 598) no Hoare annotation was computed. [2018-11-28 12:03:03,729 INFO L444 ceAbstractionStarter]: At program point node_createENTRY(lines 564 573) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-28 12:03:03,729 INFO L448 ceAbstractionStarter]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2018-11-28 12:03:03,729 INFO L451 ceAbstractionStarter]: At program point L567(line 567) the Hoare annotation is: true [2018-11-28 12:03:03,729 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-11-28 12:03:03,729 INFO L448 ceAbstractionStarter]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2018-11-28 12:03:03,729 INFO L448 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2018-11-28 12:03:03,740 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,741 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,741 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,741 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,742 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,742 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,742 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,742 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,746 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,746 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,747 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,747 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,747 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,747 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,747 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,747 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,750 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,750 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,750 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,750 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,751 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,751 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,751 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,751 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,751 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,753 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,753 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,754 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,754 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,754 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,754 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,754 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,754 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,759 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,759 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,759 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,759 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_1,QUANTIFIED] [2018-11-28 12:03:03,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_1,QUANTIFIED] [2018-11-28 12:03:03,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] [2018-11-28 12:03:03,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] [2018-11-28 12:03:03,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] [2018-11-28 12:03:03,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] [2018-11-28 12:03:03,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] [2018-11-28 12:03:03,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] [2018-11-28 12:03:03,761 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,763 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,764 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,764 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,764 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_1,QUANTIFIED] [2018-11-28 12:03:03,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_1,QUANTIFIED] [2018-11-28 12:03:03,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] [2018-11-28 12:03:03,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] [2018-11-28 12:03:03,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] [2018-11-28 12:03:03,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] [2018-11-28 12:03:03,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] [2018-11-28 12:03:03,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] [2018-11-28 12:03:03,766 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,766 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,766 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,766 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,766 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,766 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:03:03 BoogieIcfgContainer [2018-11-28 12:03:03,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:03:03,772 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:03:03,772 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:03:03,773 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:03:03,773 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:56:58" (3/4) ... [2018-11-28 12:03:03,776 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:03:03,782 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:03:03,782 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-11-28 12:03:03,782 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2018-11-28 12:03:03,782 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_prepend [2018-11-28 12:03:03,782 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:03:03,783 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_destroy [2018-11-28 12:03:03,783 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-28 12:03:03,787 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-28 12:03:03,787 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 12:03:03,787 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 12:03:03,805 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((head == 0 && len <= \old(len)) && \old(len) <= len) && head == 0) && \valid == \old(\valid)) && \old(data) == data) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || ((((((len + 1 <= \old(len) && !(0 == head)) && \old(len) <= len + 1) && \old(data) == data) && (\exists v_subst_1 : int :: \valid == \old(\valid)[v_subst_1 := 1][head := 1] && \old(\valid)[v_subst_1] == 0)) && \valid == \old(\valid)[new_head := 1]) && \old(\valid)[head] == 0)) || (3 <= \old(len) && len + 2 <= \old(len))) || ((((((((len + 2 <= \old(len) && \old(data) == unknown-#memory_int-unknown[head][head]) && (\exists v_subst_3 : int :: (\valid == \old(\valid)[v_subst_3 := 1][head := 1] && \old(\valid)[v_subst_3] == 0) && \old(\valid)[v_subst_3 := 1][head] == 0)) && (\exists dll_create_~head~0.base : int :: (\old(\valid)[dll_create_~head~0.base := 1][new_head := 1] == \valid && \old(\valid)[dll_create_~head~0.base := 1][new_head] == 0) && \old(\valid)[dll_create_~head~0.base] == 0)) && !(new_head == 0)) && !(0 == head)) && \old(data) == unknown-#memory_int-unknown[new_head][new_head]) && 0 == head) && 0 == new_head) [2018-11-28 12:03:03,819 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ec9ebd38-cabc-4202-b8c1-0ff1b3754421/bin-2019/uautomizer/witness.graphml [2018-11-28 12:03:03,819 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:03:03,819 INFO L168 Benchmark]: Toolchain (without parser) took 365691.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 949.5 MB in the beginning and 930.3 MB in the end (delta: 19.2 MB). Peak memory consumption was 180.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:03:03,820 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:03:03,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:03:03,820 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:03:03,820 INFO L168 Benchmark]: Boogie Preprocessor took 29.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:03:03,820 INFO L168 Benchmark]: RCFGBuilder took 399.48 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:03:03,821 INFO L168 Benchmark]: TraceAbstraction took 364847.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.2 MB). Free memory was 1.1 GB in the beginning and 936.6 MB in the end (delta: 154.4 MB). Peak memory consumption was 180.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:03:03,821 INFO L168 Benchmark]: Witness Printer took 46.50 ms. Allocated memory is still 1.2 GB. Free memory was 936.6 MB in the beginning and 930.3 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:03:03,822 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 399.48 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 364847.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.2 MB). Free memory was 1.1 GB in the beginning and 936.6 MB in the end (delta: 154.4 MB). Peak memory consumption was 180.6 MB. Max. memory is 11.5 GB. * Witness Printer took 46.50 ms. Allocated memory is still 1.2 GB. Free memory was 936.6 MB in the beginning and 930.3 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_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_$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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - 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_$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_$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_$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_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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 627]: 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: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 607]: Loop Invariant [2018-11-28 12:03:03,826 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,826 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,826 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,826 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,827 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,827 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,827 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,827 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,829 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,829 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,829 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,830 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,830 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,830 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,830 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,830 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((1 == data && !(0 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4])) && s == 0) && !(0 == #memory_$Pointer$[s][s])) && 0 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4]) && data == unknown-#memory_int-unknown[#memory_$Pointer$[#memory_$Pointer$[s][s]][4]][0]) && 0 == #memory_$Pointer$[s][s]) && len <= 2) && 2 <= len) && \valid[s] == 1 - InvariantResult [Line: 614]: Loop Invariant [2018-11-28 12:03:03,832 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,832 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,832 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,832 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,832 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,833 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,833 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,833 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,834 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,835 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,835 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,835 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,835 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,835 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,835 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,835 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,837 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,837 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,837 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((1 == data && !(0 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4])) && s == 0) && !(0 == #memory_$Pointer$[s][s])) && 0 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4]) && data == unknown-#memory_int-unknown[#memory_$Pointer$[#memory_$Pointer$[s][s]][4]][0]) && 0 == #memory_$Pointer$[s][s]) && len <= 2) && 2 <= len) && \valid[s] == 1 - InvariantResult [Line: 576]: Loop Invariant [2018-11-28 12:03:03,837 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,837 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,838 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,838 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_1,QUANTIFIED] [2018-11-28 12:03:03,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_1,QUANTIFIED] [2018-11-28 12:03:03,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] [2018-11-28 12:03:03,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] [2018-11-28 12:03:03,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] [2018-11-28 12:03:03,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] [2018-11-28 12:03:03,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] [2018-11-28 12:03:03,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] [2018-11-28 12:03:03,839 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,841 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,841 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-28 12:03:03,841 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,841 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-28 12:03:03,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_1,QUANTIFIED] [2018-11-28 12:03:03,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_1,QUANTIFIED] [2018-11-28 12:03:03,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] [2018-11-28 12:03:03,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] [2018-11-28 12:03:03,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_subst_3,QUANTIFIED] [2018-11-28 12:03:03,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] [2018-11-28 12:03:03,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] [2018-11-28 12:03:03,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[dll_create_~head~0.base,QUANTIFIED] [2018-11-28 12:03:03,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-28 12:03:03,844 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:03:03,844 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((((head == 0 && len <= \old(len)) && \old(len) <= len) && head == 0) && \valid == \old(\valid)) && \old(data) == data) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || ((((((len + 1 <= \old(len) && !(0 == head)) && \old(len) <= len + 1) && \old(data) == data) && (\exists v_subst_1 : int :: \valid == \old(\valid)[v_subst_1 := 1][head := 1] && \old(\valid)[v_subst_1] == 0)) && \valid == \old(\valid)[new_head := 1]) && \old(\valid)[head] == 0)) || (3 <= \old(len) && len + 2 <= \old(len))) || ((((((((len + 2 <= \old(len) && \old(data) == unknown-#memory_int-unknown[head][head]) && (\exists v_subst_3 : int :: (\valid == \old(\valid)[v_subst_3 := 1][head := 1] && \old(\valid)[v_subst_3] == 0) && \old(\valid)[v_subst_3 := 1][head] == 0)) && (\exists dll_create_~head~0.base : int :: (\old(\valid)[dll_create_~head~0.base := 1][new_head := 1] == \valid && \old(\valid)[dll_create_~head~0.base := 1][new_head] == 0) && \old(\valid)[dll_create_~head~0.base] == 0)) && !(new_head == 0)) && !(0 == head)) && \old(data) == unknown-#memory_int-unknown[new_head][new_head]) && 0 == head) && 0 == new_head) - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 52 locations, 1 error locations. SAFE Result, 364.7s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 254.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 297 SDtfs, 314 SDslu, 1485 SDs, 0 SdLazy, 2724 SolverSat, 129 SolverUnsat, 108 SolverUnknown, 0 SolverNotchecked, 121.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2268 ImplicationChecksByTransitivity, 224.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=6, 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, 9 MinimizatonAttempts, 36 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 50 PreInvPairs, 64 NumberOfFragments, 506 HoareAnnotationTreeSize, 50 FomulaSimplifications, 1418 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 2495 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 106.8s InterpolantComputationTime, 533 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 519 ConstructedInterpolants, 50 QuantifiedInterpolants, 553455 SizeOfPredicates, 83 NumberOfNonLiveVariables, 1192 ConjunctsInSsa, 298 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 15/87 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...