./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 63ea7ed840682b4e196bd141458679e7836ad115 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 15:35:53,312 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:35:53,313 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:35:53,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:35:53,326 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:35:53,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:35:53,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:35:53,330 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:35:53,332 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:35:53,333 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:35:53,334 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:35:53,334 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:35:53,335 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:35:53,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:35:53,338 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:35:53,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:35:53,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:35:53,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:35:53,344 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:35:53,345 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:35:53,346 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:35:53,347 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:35:53,350 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:35:53,350 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:35:53,351 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:35:53,352 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:35:53,353 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:35:53,354 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:35:53,355 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:35:53,356 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:35:53,356 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:35:53,357 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:35:53,357 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:35:53,358 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:35:53,358 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:35:53,360 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:35:53,360 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:35:53,375 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:35:53,375 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:35:53,376 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:35:53,377 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:35:53,377 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:35:53,377 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:35:53,378 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:35:53,378 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:35:53,378 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:35:53,378 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:35:53,378 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:35:53,378 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:35:53,380 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:35:53,380 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:35:53,380 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:35:53,380 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:35:53,380 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:35:53,381 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:35:53,381 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:35:53,381 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:35:53,381 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:35:53,381 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:35:53,381 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:35:53,382 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:35:53,383 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:35:53,383 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:35:53,383 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:35:53,384 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 63ea7ed840682b4e196bd141458679e7836ad115 [2019-01-14 15:35:53,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:35:53,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:35:53,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:35:53,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:35:53,437 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:35:53,437 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i [2019-01-14 15:35:53,487 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebd13ccb/216f535bc6824f7695d050d476df5cc0/FLAGf0b1bec1e [2019-01-14 15:35:53,954 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:35:53,955 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i [2019-01-14 15:35:53,970 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebd13ccb/216f535bc6824f7695d050d476df5cc0/FLAGf0b1bec1e [2019-01-14 15:35:54,270 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebd13ccb/216f535bc6824f7695d050d476df5cc0 [2019-01-14 15:35:54,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:35:54,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:35:54,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:35:54,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:35:54,279 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:35:54,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:35:54" (1/1) ... [2019-01-14 15:35:54,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@138808c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:54, skipping insertion in model container [2019-01-14 15:35:54,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:35:54" (1/1) ... [2019-01-14 15:35:54,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:35:54,347 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:35:54,671 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:35:54,685 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:35:54,814 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:35:54,875 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:35:54,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:54 WrapperNode [2019-01-14 15:35:54,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:35:54,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:35:54,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:35:54,877 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:35:54,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:54" (1/1) ... [2019-01-14 15:35:54,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:54" (1/1) ... [2019-01-14 15:35:54,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:35:54,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:35:54,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:35:54,936 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:35:54,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:54" (1/1) ... [2019-01-14 15:35:54,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:54" (1/1) ... [2019-01-14 15:35:54,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:54" (1/1) ... [2019-01-14 15:35:54,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:54" (1/1) ... [2019-01-14 15:35:54,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:54" (1/1) ... [2019-01-14 15:35:54,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:54" (1/1) ... [2019-01-14 15:35:54,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:54" (1/1) ... [2019-01-14 15:35:54,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:35:54,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:35:54,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:35:54,977 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:35:54,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 15:35:55,034 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2019-01-14 15:35:55,034 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2019-01-14 15:35:55,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 15:35:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:35:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 15:35:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 15:35:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 15:35:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:35:55,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:35:55,573 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:35:55,574 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-14 15:35:55,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:35:55 BoogieIcfgContainer [2019-01-14 15:35:55,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:35:55,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:35:55,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:35:55,581 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:35:55,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:35:54" (1/3) ... [2019-01-14 15:35:55,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc7c41b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:35:55, skipping insertion in model container [2019-01-14 15:35:55,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:35:54" (2/3) ... [2019-01-14 15:35:55,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc7c41b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:35:55, skipping insertion in model container [2019-01-14 15:35:55,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:35:55" (3/3) ... [2019-01-14 15:35:55,585 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing_true-unreach-call_false-valid-memtrack.i [2019-01-14 15:35:55,596 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:35:55,604 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-14 15:35:55,621 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-14 15:35:55,649 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:35:55,650 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:35:55,650 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:35:55,650 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:35:55,650 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:35:55,651 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:35:55,651 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:35:55,651 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:35:55,651 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:35:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-01-14 15:35:55,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 15:35:55,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:55,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:55,675 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:55,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:55,680 INFO L82 PathProgramCache]: Analyzing trace with hash -390992366, now seen corresponding path program 1 times [2019-01-14 15:35:55,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:55,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:55,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:55,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:55,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:55,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:35:55,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 15:35:55,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 15:35:55,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 15:35:55,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 15:35:55,834 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2019-01-14 15:35:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:55,855 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2019-01-14 15:35:55,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 15:35:55,857 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-01-14 15:35:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:55,864 INFO L225 Difference]: With dead ends: 71 [2019-01-14 15:35:55,864 INFO L226 Difference]: Without dead ends: 34 [2019-01-14 15:35:55,867 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 [2019-01-14 15:35:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-14 15:35:55,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-14 15:35:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 15:35:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2019-01-14 15:35:55,913 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 17 [2019-01-14 15:35:55,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:55,914 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2019-01-14 15:35:55,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 15:35:55,914 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2019-01-14 15:35:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 15:35:55,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:55,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:55,918 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:55,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:55,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1529433021, now seen corresponding path program 1 times [2019-01-14 15:35:55,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:55,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:55,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:55,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:55,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:56,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:35:56,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:35:56,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:35:56,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:35:56,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:35:56,080 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand 4 states. [2019-01-14 15:35:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:56,260 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2019-01-14 15:35:56,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 15:35:56,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-01-14 15:35:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:56,263 INFO L225 Difference]: With dead ends: 44 [2019-01-14 15:35:56,263 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 15:35:56,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:35:56,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 15:35:56,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2019-01-14 15:35:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 15:35:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2019-01-14 15:35:56,274 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 17 [2019-01-14 15:35:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:56,275 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2019-01-14 15:35:56,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:35:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2019-01-14 15:35:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 15:35:56,278 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:56,278 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:56,278 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:56,279 INFO L82 PathProgramCache]: Analyzing trace with hash -670941087, now seen corresponding path program 1 times [2019-01-14 15:35:56,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:56,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:56,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:56,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:56,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 15:35:56,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:35:56,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 15:35:56,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 15:35:56,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 15:35:56,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 15:35:56,434 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand 4 states. [2019-01-14 15:35:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:56,589 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2019-01-14 15:35:56,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 15:35:56,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-01-14 15:35:56,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:56,591 INFO L225 Difference]: With dead ends: 80 [2019-01-14 15:35:56,592 INFO L226 Difference]: Without dead ends: 58 [2019-01-14 15:35:56,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:35:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-14 15:35:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2019-01-14 15:35:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 15:35:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2019-01-14 15:35:56,601 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 23 [2019-01-14 15:35:56,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:56,602 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2019-01-14 15:35:56,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 15:35:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2019-01-14 15:35:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 15:35:56,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:56,604 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:35:56,604 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:56,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:56,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2084669319, now seen corresponding path program 1 times [2019-01-14 15:35:56,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:56,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:56,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:56,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:56,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 15:35:56,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:35:56,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 15:35:56,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:56,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:35:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:57,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:35:57,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-01-14 15:35:57,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 15:35:57,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 15:35:57,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-01-14 15:35:57,054 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand 12 states. [2019-01-14 15:35:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:58,256 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2019-01-14 15:35:58,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 15:35:58,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-01-14 15:35:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:58,260 INFO L225 Difference]: With dead ends: 108 [2019-01-14 15:35:58,260 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 15:35:58,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-01-14 15:35:58,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 15:35:58,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 55. [2019-01-14 15:35:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-14 15:35:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2019-01-14 15:35:58,276 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 26 [2019-01-14 15:35:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:58,277 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2019-01-14 15:35:58,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 15:35:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2019-01-14 15:35:58,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 15:35:58,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:58,279 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 15:35:58,280 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:58,281 INFO L82 PathProgramCache]: Analyzing trace with hash -155348295, now seen corresponding path program 1 times [2019-01-14 15:35:58,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:58,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:58,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:58,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:58,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:58,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 15:35:58,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:35:58,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:35:58,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:35:58,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:35:58,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:35:58,401 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 5 states. [2019-01-14 15:35:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:35:58,476 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2019-01-14 15:35:58,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 15:35:58,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-01-14 15:35:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:35:58,482 INFO L225 Difference]: With dead ends: 59 [2019-01-14 15:35:58,482 INFO L226 Difference]: Without dead ends: 55 [2019-01-14 15:35:58,482 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 [2019-01-14 15:35:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-14 15:35:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2019-01-14 15:35:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 15:35:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2019-01-14 15:35:58,496 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 28 [2019-01-14 15:35:58,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:35:58,497 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2019-01-14 15:35:58,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:35:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2019-01-14 15:35:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 15:35:58,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:35:58,500 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] [2019-01-14 15:35:58,500 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:35:58,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:35:58,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1907184921, now seen corresponding path program 1 times [2019-01-14 15:35:58,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:35:58,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:35:58,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:58,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:58,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:35:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 15:35:58,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:35:58,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 15:35:58,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:35:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:35:58,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:35:58,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:58,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-14 15:35:58,867 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 13 treesize of output 16 [2019-01-14 15:35:58,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:58,875 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 16 treesize of output 23 [2019-01-14 15:35:58,876 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:58,890 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:58,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:58,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 15:35:58,952 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 10 treesize of output 9 [2019-01-14 15:35:58,955 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:58,968 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:58,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:59,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:59,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-14 15:35:59,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 22 [2019-01-14 15:35:59,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:59,057 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 35 [2019-01-14 15:35:59,058 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:59,095 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:59,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:59,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:35:59,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 48 [2019-01-14 15:35:59,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-14 15:35:59,147 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:59,165 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:59,175 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:59,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:59,205 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:94, output treesize:72 [2019-01-14 15:35:59,638 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 15:35:59,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:35:59,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:35:59,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:138, output treesize:1 [2019-01-14 15:35:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:35:59,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:35:59,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10] total 12 [2019-01-14 15:35:59,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 15:35:59,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 15:35:59,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-01-14 15:35:59,673 INFO L87 Difference]: Start difference. First operand 48 states and 67 transitions. Second operand 12 states. [2019-01-14 15:36:00,034 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-01-14 15:36:00,380 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 15:36:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:36:01,455 INFO L93 Difference]: Finished difference Result 232 states and 326 transitions. [2019-01-14 15:36:01,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 15:36:01,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-01-14 15:36:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:36:01,464 INFO L225 Difference]: With dead ends: 232 [2019-01-14 15:36:01,467 INFO L226 Difference]: Without dead ends: 190 [2019-01-14 15:36:01,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-01-14 15:36:01,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-14 15:36:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 112. [2019-01-14 15:36:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-14 15:36:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 165 transitions. [2019-01-14 15:36:01,499 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 165 transitions. Word has length 28 [2019-01-14 15:36:01,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:36:01,499 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 165 transitions. [2019-01-14 15:36:01,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 15:36:01,499 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 165 transitions. [2019-01-14 15:36:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 15:36:01,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:36:01,503 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 15:36:01,503 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:36:01,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:36:01,504 INFO L82 PathProgramCache]: Analyzing trace with hash 333454003, now seen corresponding path program 1 times [2019-01-14 15:36:01,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:36:01,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:36:01,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:36:01,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:36:01,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:36:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:36:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 15:36:01,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:36:01,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:36:01,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:36:01,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:36:01,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:36:01,618 INFO L87 Difference]: Start difference. First operand 112 states and 165 transitions. Second operand 5 states. [2019-01-14 15:36:01,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:36:01,796 INFO L93 Difference]: Finished difference Result 198 states and 282 transitions. [2019-01-14 15:36:01,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 15:36:01,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-14 15:36:01,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:36:01,799 INFO L225 Difference]: With dead ends: 198 [2019-01-14 15:36:01,799 INFO L226 Difference]: Without dead ends: 91 [2019-01-14 15:36:01,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:36:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-14 15:36:01,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-01-14 15:36:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-14 15:36:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 122 transitions. [2019-01-14 15:36:01,819 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 122 transitions. Word has length 29 [2019-01-14 15:36:01,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:36:01,820 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 122 transitions. [2019-01-14 15:36:01,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:36:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 122 transitions. [2019-01-14 15:36:01,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 15:36:01,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:36:01,822 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 15:36:01,822 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:36:01,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:36:01,822 INFO L82 PathProgramCache]: Analyzing trace with hash 637156592, now seen corresponding path program 1 times [2019-01-14 15:36:01,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:36:01,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:36:01,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:36:01,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:36:01,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:36:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:36:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-14 15:36:02,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:36:02,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 15:36:02,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 15:36:02,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 15:36:02,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:36:02,040 INFO L87 Difference]: Start difference. First operand 87 states and 122 transitions. Second operand 6 states. [2019-01-14 15:36:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:36:02,205 INFO L93 Difference]: Finished difference Result 115 states and 164 transitions. [2019-01-14 15:36:02,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 15:36:02,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-01-14 15:36:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:36:02,209 INFO L225 Difference]: With dead ends: 115 [2019-01-14 15:36:02,209 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 15:36:02,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-14 15:36:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 15:36:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2019-01-14 15:36:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-14 15:36:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2019-01-14 15:36:02,227 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 34 [2019-01-14 15:36:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:36:02,227 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2019-01-14 15:36:02,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 15:36:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2019-01-14 15:36:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 15:36:02,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:36:02,230 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:36:02,230 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:36:02,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:36:02,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1092905979, now seen corresponding path program 1 times [2019-01-14 15:36:02,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:36:02,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:36:02,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:36:02,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:36:02,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:36:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:36:02,690 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 15:36:02,768 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 15:36:02,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:36:02,769 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 15:36:02,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:36:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:36:02,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:36:03,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:03,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-14 15:36:03,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 15:36:03,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:03,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:03,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2019-01-14 15:36:03,376 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:36:03,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:03,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:03,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 15:36:03,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:36:03,412 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:36:03,428 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:03,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:03,456 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. [2019-01-14 15:36:03,457 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:52, output treesize:43 [2019-01-14 15:36:03,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:03,753 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 45 treesize of output 37 [2019-01-14 15:36:03,769 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 7 treesize of output 1 [2019-01-14 15:36:03,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:36:03,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-01-14 15:36:03,784 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:36:03,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:03,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:03,792 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:4 [2019-01-14 15:36:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 15:36:03,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:36:03,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-01-14 15:36:03,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 15:36:03,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 15:36:03,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-01-14 15:36:03,849 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand 18 states. [2019-01-14 15:36:04,230 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-01-14 15:36:05,421 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-01-14 15:36:05,733 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-01-14 15:36:05,853 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-01-14 15:36:07,448 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-14 15:36:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:36:07,606 INFO L93 Difference]: Finished difference Result 235 states and 323 transitions. [2019-01-14 15:36:07,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 15:36:07,607 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-01-14 15:36:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:36:07,609 INFO L225 Difference]: With dead ends: 235 [2019-01-14 15:36:07,609 INFO L226 Difference]: Without dead ends: 166 [2019-01-14 15:36:07,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=491, Invalid=1579, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 15:36:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-14 15:36:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 58. [2019-01-14 15:36:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 15:36:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2019-01-14 15:36:07,625 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 40 [2019-01-14 15:36:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:36:07,626 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2019-01-14 15:36:07,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 15:36:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2019-01-14 15:36:07,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 15:36:07,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:36:07,627 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-01-14 15:36:07,627 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:36:07,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:36:07,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1745772944, now seen corresponding path program 1 times [2019-01-14 15:36:07,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:36:07,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:36:07,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:36:07,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:36:07,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:36:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:36:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 15:36:07,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:36:07,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 15:36:07,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:36:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:36:07,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:36:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 15:36:08,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:36:08,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2019-01-14 15:36:08,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 15:36:08,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 15:36:08,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-01-14 15:36:08,003 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand 12 states. [2019-01-14 15:36:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:36:08,293 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2019-01-14 15:36:08,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 15:36:08,295 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-01-14 15:36:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:36:08,296 INFO L225 Difference]: With dead ends: 89 [2019-01-14 15:36:08,296 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 15:36:08,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-01-14 15:36:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 15:36:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-01-14 15:36:08,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 15:36:08,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2019-01-14 15:36:08,309 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 42 [2019-01-14 15:36:08,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:36:08,311 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2019-01-14 15:36:08,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 15:36:08,311 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2019-01-14 15:36:08,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 15:36:08,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:36:08,313 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:36:08,313 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:36:08,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:36:08,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1513117575, now seen corresponding path program 1 times [2019-01-14 15:36:08,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:36:08,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:36:08,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:36:08,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:36:08,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:36:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:36:08,952 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2019-01-14 15:36:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 15:36:09,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:36:09,214 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 15:36:09,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:36:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:36:09,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:36:09,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:09,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-14 15:36:09,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 15:36:09,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:09,470 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 16 treesize of output 23 [2019-01-14 15:36:09,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:36:09,478 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:09,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:09,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:09,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 42 [2019-01-14 15:36:09,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-14 15:36:09,513 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:36:09,523 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:09,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:09,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:09,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 15:36:09,568 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 19 treesize of output 22 [2019-01-14 15:36:09,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:09,573 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 35 [2019-01-14 15:36:09,574 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:36:09,580 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:09,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:09,600 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 46 treesize of output 64 [2019-01-14 15:36:09,604 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 14 treesize of output 13 [2019-01-14 15:36:09,604 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 15:36:09,613 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:09,620 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:09,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:09,646 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:94, output treesize:82 [2019-01-14 15:36:10,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:10,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:10,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:10,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 92 treesize of output 105 [2019-01-14 15:36:10,274 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:36:10,307 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 90 [2019-01-14 15:36:10,310 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 15:36:10,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:10,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:10,374 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 49 treesize of output 45 [2019-01-14 15:36:10,378 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 7 treesize of output 1 [2019-01-14 15:36:10,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:36:10,388 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:36:10,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2019-01-14 15:36:10,389 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:36:10,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:10,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:10,406 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:104, output treesize:40 [2019-01-14 15:36:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 15:36:10,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:36:10,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-01-14 15:36:10,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-14 15:36:10,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-14 15:36:10,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2019-01-14 15:36:10,916 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand 31 states. [2019-01-14 15:36:12,809 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-01-14 15:36:12,951 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-01-14 15:36:13,216 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-01-14 15:36:14,899 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-01-14 15:36:15,254 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-01-14 15:36:15,516 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-01-14 15:36:15,677 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-01-14 15:36:16,294 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-01-14 15:36:16,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:36:16,735 INFO L93 Difference]: Finished difference Result 217 states and 283 transitions. [2019-01-14 15:36:16,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-14 15:36:16,737 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2019-01-14 15:36:16,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:36:16,740 INFO L225 Difference]: With dead ends: 217 [2019-01-14 15:36:16,740 INFO L226 Difference]: Without dead ends: 188 [2019-01-14 15:36:16,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=653, Invalid=4603, Unknown=0, NotChecked=0, Total=5256 [2019-01-14 15:36:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-14 15:36:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 123. [2019-01-14 15:36:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-14 15:36:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 167 transitions. [2019-01-14 15:36:16,769 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 167 transitions. Word has length 40 [2019-01-14 15:36:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:36:16,769 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 167 transitions. [2019-01-14 15:36:16,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-14 15:36:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 167 transitions. [2019-01-14 15:36:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 15:36:16,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:36:16,770 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-01-14 15:36:16,771 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:36:16,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:36:16,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1275496661, now seen corresponding path program 2 times [2019-01-14 15:36:16,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:36:16,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:36:16,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:36:16,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:36:16,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:36:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:36:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 15:36:17,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:36:17,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 15:36:17,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 15:36:17,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 15:36:17,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:36:17,280 INFO L87 Difference]: Start difference. First operand 123 states and 167 transitions. Second operand 7 states. [2019-01-14 15:36:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:36:17,457 INFO L93 Difference]: Finished difference Result 162 states and 233 transitions. [2019-01-14 15:36:17,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 15:36:17,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-14 15:36:17,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:36:17,460 INFO L225 Difference]: With dead ends: 162 [2019-01-14 15:36:17,460 INFO L226 Difference]: Without dead ends: 160 [2019-01-14 15:36:17,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 15:36:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-14 15:36:17,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 131. [2019-01-14 15:36:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-14 15:36:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 178 transitions. [2019-01-14 15:36:17,503 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 178 transitions. Word has length 41 [2019-01-14 15:36:17,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:36:17,504 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 178 transitions. [2019-01-14 15:36:17,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 15:36:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 178 transitions. [2019-01-14 15:36:17,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 15:36:17,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:36:17,508 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 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] [2019-01-14 15:36:17,508 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:36:17,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:36:17,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1523797054, now seen corresponding path program 2 times [2019-01-14 15:36:17,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:36:17,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:36:17,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:36:17,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:36:17,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:36:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:36:17,789 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-14 15:36:18,081 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-01-14 15:36:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 15:36:18,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:36:18,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:36:18,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 15:36:18,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 15:36:18,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:36:18,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:36:18,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:18,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-14 15:36:18,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 15:36:18,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:18,711 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 16 treesize of output 23 [2019-01-14 15:36:18,711 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:36:18,725 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:18,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:18,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 15:36:18,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:36:18,760 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:36:18,774 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:18,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:18,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:18,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 15:36:18,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2019-01-14 15:36:18,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:18,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2019-01-14 15:36:18,838 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:36:18,851 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:18,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:18,882 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 46 treesize of output 64 [2019-01-14 15:36:18,885 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 14 treesize of output 13 [2019-01-14 15:36:18,886 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 15:36:18,901 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:18,912 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:18,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:18,935 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:90, output treesize:78 [2019-01-14 15:36:19,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:19,531 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:36:19,532 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 152 treesize of output 174 [2019-01-14 15:36:19,536 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:36:19,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2019-01-14 15:36:19,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:36:19,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:36:19,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:36:19,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 112 [2019-01-14 15:36:19,594 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:36:19,596 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 121 treesize of output 83 [2019-01-14 15:36:19,598 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:36:19,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:36:19,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:36:19,638 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:192, output treesize:75 [2019-01-14 15:36:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 15:36:20,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:36:20,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-01-14 15:36:20,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 15:36:20,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 15:36:20,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2019-01-14 15:36:20,758 INFO L87 Difference]: Start difference. First operand 131 states and 178 transitions. Second operand 28 states. [2019-01-14 15:36:22,188 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-01-14 15:36:22,504 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2019-01-14 15:36:22,719 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2019-01-14 15:36:26,936 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-01-14 15:36:39,766 WARN L181 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-01-14 15:36:42,037 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2019-01-14 15:36:44,275 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-01-14 15:36:48,583 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-01-14 15:36:48,753 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-01-14 15:36:59,808 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-01-14 15:37:08,420 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2019-01-14 15:37:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:37:08,657 INFO L93 Difference]: Finished difference Result 253 states and 335 transitions. [2019-01-14 15:37:08,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 15:37:08,658 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2019-01-14 15:37:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:37:08,660 INFO L225 Difference]: With dead ends: 253 [2019-01-14 15:37:08,660 INFO L226 Difference]: Without dead ends: 169 [2019-01-14 15:37:08,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=485, Invalid=3296, Unknown=1, NotChecked=0, Total=3782 [2019-01-14 15:37:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-14 15:37:08,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2019-01-14 15:37:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-14 15:37:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 189 transitions. [2019-01-14 15:37:08,688 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 189 transitions. Word has length 47 [2019-01-14 15:37:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:37:08,688 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 189 transitions. [2019-01-14 15:37:08,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 15:37:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2019-01-14 15:37:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 15:37:08,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:37:08,692 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:37:08,692 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:37:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:37:08,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1310398175, now seen corresponding path program 1 times [2019-01-14 15:37:08,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:37:08,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:37:08,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:37:08,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:37:08,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:37:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:37:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-01-14 15:37:08,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:37:08,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:37:08,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:37:08,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:37:08,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:37:08,764 INFO L87 Difference]: Start difference. First operand 145 states and 189 transitions. Second operand 3 states. [2019-01-14 15:37:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:37:08,800 INFO L93 Difference]: Finished difference Result 244 states and 312 transitions. [2019-01-14 15:37:08,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:37:08,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-14 15:37:08,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:37:08,805 INFO L225 Difference]: With dead ends: 244 [2019-01-14 15:37:08,805 INFO L226 Difference]: Without dead ends: 145 [2019-01-14 15:37:08,806 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 [2019-01-14 15:37:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-14 15:37:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-01-14 15:37:08,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-14 15:37:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2019-01-14 15:37:08,832 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 44 [2019-01-14 15:37:08,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:37:08,833 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2019-01-14 15:37:08,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:37:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2019-01-14 15:37:08,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 15:37:08,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:37:08,836 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:37:08,836 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:37:08,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:37:08,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1376186339, now seen corresponding path program 1 times [2019-01-14 15:37:08,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:37:08,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:37:08,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:37:08,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:37:08,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:37:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:37:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 15:37:08,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:37:08,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:37:08,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:37:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:37:08,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:37:09,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:09,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-14 15:37:09,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 15:37:09,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:09,126 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 16 treesize of output 23 [2019-01-14 15:37:09,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,135 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:09,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 15:37:09,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:37:09,167 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,176 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:09,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 15:37:09,240 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 19 treesize of output 22 [2019-01-14 15:37:09,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:09,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2019-01-14 15:37:09,275 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,281 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:09,301 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 46 treesize of output 74 [2019-01-14 15:37:09,305 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 14 treesize of output 13 [2019-01-14 15:37:09,306 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,318 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,326 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,350 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:93, output treesize:81 [2019-01-14 15:37:09,591 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-14 15:37:09,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:09,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 110 [2019-01-14 15:37:09,662 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 111 treesize of output 113 [2019-01-14 15:37:09,668 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 14 treesize of output 15 [2019-01-14 15:37:09,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:09,806 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:09,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 105 [2019-01-14 15:37:09,820 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 22 treesize of output 13 [2019-01-14 15:37:09,820 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,858 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:09,951 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:09,958 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:09,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 113 [2019-01-14 15:37:09,968 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 22 treesize of output 13 [2019-01-14 15:37:09,968 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:09,999 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:10,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:10,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:10,223 INFO L303 Elim1Store]: Index analysis took 174 ms [2019-01-14 15:37:10,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2019-01-14 15:37:10,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 45 [2019-01-14 15:37:10,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:10,507 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 39 treesize of output 59 [2019-01-14 15:37:10,508 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:10,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:10,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 57 [2019-01-14 15:37:10,557 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:10,595 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:37:10,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:10,673 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:10,674 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 79 treesize of output 79 [2019-01-14 15:37:10,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:10,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-01-14 15:37:10,706 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:10,730 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:10,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:10,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:10,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:10,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 102 [2019-01-14 15:37:10,765 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:10,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2019-01-14 15:37:10,766 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:10,783 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:10,838 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:37:10,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:10,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:10,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:10,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 124 [2019-01-14 15:37:10,980 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:11,024 INFO L478 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 74 treesize of output 108 [2019-01-14 15:37:21,427 WARN L181 SmtUtils]: Spent 10.39 s on a formula simplification. DAG size of input: 215 DAG size of output: 191 [2019-01-14 15:37:21,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:21,535 INFO L303 Elim1Store]: Index analysis took 106 ms [2019-01-14 15:37:21,662 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 2 case distinctions, treesize of input 70 treesize of output 90 [2019-01-14 15:37:21,663 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2019-01-14 15:37:24,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:24,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:24,599 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 58 treesize of output 67 [2019-01-14 15:37:24,599 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:26,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:26,722 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 44 treesize of output 50 [2019-01-14 15:37:26,725 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:26,975 INFO L267 ElimStorePlain]: Start of recursive call 18: 12 dim-0 vars, 9 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:27,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,157 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:27,158 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 68 treesize of output 72 [2019-01-14 15:37:27,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-01-14 15:37:27,167 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:27,185 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:27,227 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:27,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 114 [2019-01-14 15:37:27,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 63 [2019-01-14 15:37:27,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,267 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 2 case distinctions, treesize of input 57 treesize of output 71 [2019-01-14 15:37:27,268 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2019-01-14 15:37:27,340 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:37:27,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,411 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 96 treesize of output 93 [2019-01-14 15:37:27,414 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:27,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 15:37:27,418 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:27,441 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:27,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 103 [2019-01-14 15:37:27,483 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 3 case distinctions, treesize of input 36 treesize of output 50 [2019-01-14 15:37:27,485 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 3 xjuncts. [2019-01-14 15:37:27,544 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:37:27,616 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:37:27,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2019-01-14 15:37:27,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 63 [2019-01-14 15:37:27,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,657 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 2 case distinctions, treesize of input 57 treesize of output 71 [2019-01-14 15:37:27,658 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2019-01-14 15:37:27,713 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:37:27,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 81 [2019-01-14 15:37:27,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 50 [2019-01-14 15:37:27,801 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 3 xjuncts. [2019-01-14 15:37:27,857 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:37:27,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,868 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 74 treesize of output 71 [2019-01-14 15:37:27,871 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:27,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-14 15:37:27,875 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:27,892 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:27,955 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:37:27,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:27,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 116 [2019-01-14 15:37:28,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 115 [2019-01-14 15:37:28,007 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 14 treesize of output 15 [2019-01-14 15:37:28,007 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:28,042 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:28,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:28,130 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:28,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 109 [2019-01-14 15:37:28,155 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 40 treesize of output 24 [2019-01-14 15:37:28,156 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:28,183 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:28,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:28,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 103 [2019-01-14 15:37:28,272 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 40 treesize of output 24 [2019-01-14 15:37:28,272 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:28,299 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:28,341 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:28,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:37:28,480 INFO L202 ElimStorePlain]: Needed 44 recursive calls to eliminate 3 variables, input treesize:141, output treesize:364 [2019-01-14 15:37:28,700 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-01-14 15:37:28,870 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-14 15:37:29,794 WARN L181 SmtUtils]: Spent 670.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-14 15:37:30,031 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-14 15:37:30,425 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-14 15:37:31,364 WARN L181 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 661 DAG size of output: 181 [2019-01-14 15:37:31,968 WARN L181 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 54 [2019-01-14 15:37:31,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:32,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 148 [2019-01-14 15:37:32,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:32,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 108 [2019-01-14 15:37:32,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:32,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 85 [2019-01-14 15:37:32,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:37:32,154 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 133 treesize of output 124 [2019-01-14 15:37:32,154 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:32,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 112 [2019-01-14 15:37:32,212 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:32,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 97 [2019-01-14 15:37:32,279 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:37:32,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 15:37:32,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:32,476 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 97 treesize of output 69 [2019-01-14 15:37:32,493 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 19 treesize of output 11 [2019-01-14 15:37:32,494 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:32,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2019-01-14 15:37:32,559 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:32,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2019-01-14 15:37:32,572 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:32,575 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:32,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:32,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 73 [2019-01-14 15:37:32,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:32,603 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 47 [2019-01-14 15:37:32,604 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2019-01-14 15:37:32,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2019-01-14 15:37:32,668 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:32,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2019-01-14 15:37:32,671 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:32,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2019-01-14 15:37:32,714 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:32,750 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 45 treesize of output 37 [2019-01-14 15:37:32,751 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:32,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2019-01-14 15:37:32,790 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:32,803 INFO L267 ElimStorePlain]: Start of recursive call 12: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:32,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:32,836 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:388, output treesize:7 [2019-01-14 15:37:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 15:37:32,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:37:32,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15] total 18 [2019-01-14 15:37:32,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 15:37:32,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 15:37:32,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-01-14 15:37:32,915 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand 18 states. [2019-01-14 15:37:33,549 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-01-14 15:37:33,897 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 108 [2019-01-14 15:37:34,093 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-01-14 15:37:34,571 WARN L181 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 115 [2019-01-14 15:37:34,991 WARN L181 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 110 [2019-01-14 15:37:36,073 WARN L181 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 122 [2019-01-14 15:37:36,550 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 198 [2019-01-14 15:37:36,797 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 64 [2019-01-14 15:37:37,537 WARN L181 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 120 [2019-01-14 15:37:37,720 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-01-14 15:37:38,252 WARN L181 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 196 [2019-01-14 15:37:38,478 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 62 [2019-01-14 15:37:38,737 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 66 [2019-01-14 15:37:38,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:37:38,813 INFO L93 Difference]: Finished difference Result 226 states and 288 transitions. [2019-01-14 15:37:38,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-14 15:37:38,815 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2019-01-14 15:37:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:37:38,816 INFO L225 Difference]: With dead ends: 226 [2019-01-14 15:37:38,817 INFO L226 Difference]: Without dead ends: 131 [2019-01-14 15:37:38,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2019-01-14 15:37:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-14 15:37:38,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-01-14 15:37:38,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-14 15:37:38,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 160 transitions. [2019-01-14 15:37:38,841 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 160 transitions. Word has length 44 [2019-01-14 15:37:38,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:37:38,841 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 160 transitions. [2019-01-14 15:37:38,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 15:37:38,841 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2019-01-14 15:37:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 15:37:38,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:37:38,845 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1] [2019-01-14 15:37:38,845 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:37:38,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:37:38,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1031600160, now seen corresponding path program 1 times [2019-01-14 15:37:38,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:37:38,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:37:38,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:37:38,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:37:38,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:37:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:37:39,090 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-14 15:37:39,621 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 15:37:39,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:37:39,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:37:39,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:37:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:37:39,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:37:39,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:39,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-14 15:37:39,828 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 13 treesize of output 16 [2019-01-14 15:37:39,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:39,833 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 16 treesize of output 23 [2019-01-14 15:37:39,834 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:39,844 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:39,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:39,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 15:37:39,871 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 10 treesize of output 9 [2019-01-14 15:37:39,872 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:39,882 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:39,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:39,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:39,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-14 15:37:39,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 22 [2019-01-14 15:37:39,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:39,932 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 35 [2019-01-14 15:37:39,932 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:39,940 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:39,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:39,959 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 36 treesize of output 37 [2019-01-14 15:37:39,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:37:39,964 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:39,973 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:39,982 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:40,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:37:40,002 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:87, output treesize:70 [2019-01-14 15:37:40,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:40,232 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:40,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 98 [2019-01-14 15:37:40,246 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:40,248 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 32 treesize of output 35 [2019-01-14 15:37:40,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:40,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:40,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:40,297 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:40,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 90 [2019-01-14 15:37:40,304 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:40,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2019-01-14 15:37:40,305 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:40,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:40,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:40,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:128, output treesize:73 [2019-01-14 15:37:40,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:40,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2019-01-14 15:37:40,496 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 13 treesize of output 1 [2019-01-14 15:37:40,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:40,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2019-01-14 15:37:40,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:37:40,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:37:40,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:40,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-01-14 15:37:40,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2019-01-14 15:37:40,552 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:37:40,568 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 7 treesize of output 1 [2019-01-14 15:37:40,568 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:40,571 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:40,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:40,582 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:80, output treesize:7 [2019-01-14 15:37:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 15:37:40,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:37:40,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 26 [2019-01-14 15:37:40,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-14 15:37:40,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-14 15:37:40,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2019-01-14 15:37:40,647 INFO L87 Difference]: Start difference. First operand 128 states and 160 transitions. Second operand 26 states. [2019-01-14 15:37:41,156 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-01-14 15:37:42,245 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 84 [2019-01-14 15:37:42,469 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2019-01-14 15:37:42,676 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-01-14 15:37:43,128 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-01-14 15:37:43,814 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-01-14 15:37:44,039 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-01-14 15:37:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:37:44,446 INFO L93 Difference]: Finished difference Result 187 states and 236 transitions. [2019-01-14 15:37:44,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 15:37:44,447 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-01-14 15:37:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:37:44,449 INFO L225 Difference]: With dead ends: 187 [2019-01-14 15:37:44,450 INFO L226 Difference]: Without dead ends: 163 [2019-01-14 15:37:44,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=422, Invalid=2334, Unknown=0, NotChecked=0, Total=2756 [2019-01-14 15:37:44,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-14 15:37:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 142. [2019-01-14 15:37:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-14 15:37:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2019-01-14 15:37:44,478 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 46 [2019-01-14 15:37:44,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:37:44,478 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2019-01-14 15:37:44,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-14 15:37:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2019-01-14 15:37:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 15:37:44,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:37:44,481 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1] [2019-01-14 15:37:44,482 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:37:44,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:37:44,482 INFO L82 PathProgramCache]: Analyzing trace with hash -773434722, now seen corresponding path program 1 times [2019-01-14 15:37:44,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:37:44,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:37:44,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:37:44,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:37:44,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:37:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:37:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 15:37:45,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:37:45,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:37:45,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:37:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:37:45,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:37:45,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:45,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-14 15:37:45,472 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 13 treesize of output 16 [2019-01-14 15:37:45,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:45,476 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 16 treesize of output 23 [2019-01-14 15:37:45,476 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:45,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:45,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:45,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 15:37:45,510 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 10 treesize of output 9 [2019-01-14 15:37:45,510 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:45,518 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:45,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:45,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:45,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-14 15:37:45,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 22 [2019-01-14 15:37:45,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:45,566 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 35 [2019-01-14 15:37:45,567 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:45,574 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:45,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:45,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:45,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 48 [2019-01-14 15:37:45,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-14 15:37:45,597 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:45,607 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:45,614 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:45,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:45,644 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:94, output treesize:72 [2019-01-14 15:37:46,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:46,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:46,037 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:46,044 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:46,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 166 [2019-01-14 15:37:46,051 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:46,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 87 [2019-01-14 15:37:46,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:46,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:46,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:46,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:46,115 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:46,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:46,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:46,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 134 treesize of output 156 [2019-01-14 15:37:46,132 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:46,155 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 118 [2019-01-14 15:37:46,158 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 15:37:46,318 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:46,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:46,345 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:130, output treesize:82 [2019-01-14 15:37:46,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:46,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:46,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:46,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 74 treesize of output 96 [2019-01-14 15:37:46,582 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:46,583 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 53 treesize of output 41 [2019-01-14 15:37:46,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:46,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:46,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:46,628 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 49 treesize of output 41 [2019-01-14 15:37:46,631 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 1 [2019-01-14 15:37:46,632 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:46,645 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 22 treesize of output 17 [2019-01-14 15:37:46,645 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:46,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:46,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:46,666 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:100, output treesize:51 [2019-01-14 15:37:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 15:37:46,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:37:46,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2019-01-14 15:37:46,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 15:37:46,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 15:37:46,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2019-01-14 15:37:46,903 INFO L87 Difference]: Start difference. First operand 142 states and 178 transitions. Second operand 32 states. [2019-01-14 15:37:48,560 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-01-14 15:37:48,731 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-01-14 15:37:49,173 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-01-14 15:37:49,420 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2019-01-14 15:37:49,879 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-01-14 15:37:50,029 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-01-14 15:37:50,453 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-01-14 15:37:50,615 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-01-14 15:37:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:37:50,820 INFO L93 Difference]: Finished difference Result 188 states and 229 transitions. [2019-01-14 15:37:50,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-14 15:37:50,821 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 46 [2019-01-14 15:37:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:37:50,823 INFO L225 Difference]: With dead ends: 188 [2019-01-14 15:37:50,823 INFO L226 Difference]: Without dead ends: 184 [2019-01-14 15:37:50,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=575, Invalid=3207, Unknown=0, NotChecked=0, Total=3782 [2019-01-14 15:37:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-14 15:37:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 155. [2019-01-14 15:37:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-14 15:37:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 197 transitions. [2019-01-14 15:37:50,856 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 197 transitions. Word has length 46 [2019-01-14 15:37:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:37:50,856 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 197 transitions. [2019-01-14 15:37:50,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 15:37:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 197 transitions. [2019-01-14 15:37:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 15:37:50,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:37:50,862 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1] [2019-01-14 15:37:50,862 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:37:50,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:37:50,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1166461732, now seen corresponding path program 1 times [2019-01-14 15:37:50,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:37:50,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:37:50,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:37:50,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:37:50,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:37:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:37:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 15:37:51,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:37:51,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:37:51,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:37:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:37:51,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:37:51,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:51,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-14 15:37:51,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 15:37:51,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:51,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:51,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2019-01-14 15:37:51,711 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:51,720 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:51,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:51,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 15:37:51,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:37:51,742 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:51,750 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:51,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:51,772 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. [2019-01-14 15:37:51,772 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:52, output treesize:43 [2019-01-14 15:37:52,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:52,021 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:37:52,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 78 [2019-01-14 15:37:52,047 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 32 treesize of output 49 [2019-01-14 15:37:52,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 15:37:52,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:37:52,113 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 59 treesize of output 55 [2019-01-14 15:37:52,116 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 31 treesize of output 19 [2019-01-14 15:37:52,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:52,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:52,127 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 61 treesize of output 59 [2019-01-14 15:37:52,130 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 21 treesize of output 19 [2019-01-14 15:37:52,131 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:37:52,143 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:37:52,175 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 2 xjuncts. [2019-01-14 15:37:52,176 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:72, output treesize:108 [2019-01-14 15:37:52,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:52,414 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 49 treesize of output 39 [2019-01-14 15:37:52,416 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 39 treesize of output 21 [2019-01-14 15:37:52,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:52,425 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 7 treesize of output 1 [2019-01-14 15:37:52,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:52,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:52,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:52,437 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:4 [2019-01-14 15:37:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 15:37:52,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:37:52,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 28 [2019-01-14 15:37:52,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 15:37:52,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 15:37:52,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2019-01-14 15:37:52,492 INFO L87 Difference]: Start difference. First operand 155 states and 197 transitions. Second operand 28 states. [2019-01-14 15:37:52,874 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-01-14 15:37:53,548 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-01-14 15:37:54,090 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 55 [2019-01-14 15:37:54,277 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-01-14 15:37:54,845 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2019-01-14 15:37:55,132 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 97 [2019-01-14 15:37:55,565 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-01-14 15:37:56,028 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-01-14 15:37:56,230 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-01-14 15:37:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:37:56,662 INFO L93 Difference]: Finished difference Result 181 states and 218 transitions. [2019-01-14 15:37:56,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-14 15:37:56,663 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2019-01-14 15:37:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:37:56,665 INFO L225 Difference]: With dead ends: 181 [2019-01-14 15:37:56,666 INFO L226 Difference]: Without dead ends: 171 [2019-01-14 15:37:56,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=497, Invalid=2925, Unknown=0, NotChecked=0, Total=3422 [2019-01-14 15:37:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-14 15:37:56,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2019-01-14 15:37:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-14 15:37:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 192 transitions. [2019-01-14 15:37:56,696 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 192 transitions. Word has length 46 [2019-01-14 15:37:56,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:37:56,697 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 192 transitions. [2019-01-14 15:37:56,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 15:37:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 192 transitions. [2019-01-14 15:37:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 15:37:56,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:37:56,702 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:37:56,703 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:37:56,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:37:56,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1664417444, now seen corresponding path program 1 times [2019-01-14 15:37:56,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:37:56,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:37:56,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:37:56,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:37:56,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:37:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:37:56,968 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-14 15:37:57,246 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-01-14 15:37:57,538 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-01-14 15:37:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 15:37:57,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:37:57,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:37:57,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:37:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:37:57,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:37:57,830 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 [2019-01-14 15:37:57,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:57,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:57,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-14 15:37:57,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:57,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:57,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 15:37:57,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:57,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:57,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-01-14 15:37:57,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2019-01-14 15:37:57,930 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 33 treesize of output 32 [2019-01-14 15:37:57,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:57,936 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 32 treesize of output 36 [2019-01-14 15:37:57,936 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:57,945 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:57,959 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 30 treesize of output 23 [2019-01-14 15:37:57,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:57,974 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 2 case distinctions, treesize of input 23 treesize of output 40 [2019-01-14 15:37:57,975 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 15:37:57,995 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:37:58,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:37:58,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2019-01-14 15:37:58,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 15:37:58,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:37:58,061 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 16 treesize of output 23 [2019-01-14 15:37:58,062 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:58,069 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:58,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 15:37:58,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:37:58,088 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 15:37:58,098 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:58,107 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:37:58,143 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 3 xjuncts. [2019-01-14 15:37:58,144 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:44, output treesize:115 [2019-01-14 15:37:58,508 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 15:37:58,893 WARN L181 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 15:37:59,226 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 15:37:59,480 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 15:37:59,677 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 15:38:00,583 WARN L181 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 37 [2019-01-14 15:38:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 15:38:00,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:38:00,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-01-14 15:38:00,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-14 15:38:00,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 15:38:00,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-01-14 15:38:00,618 INFO L87 Difference]: Start difference. First operand 154 states and 192 transitions. Second operand 23 states. [2019-01-14 15:38:05,029 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 15:38:05,263 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-14 15:38:07,474 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-01-14 15:38:07,844 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-14 15:38:09,691 WARN L181 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-01-14 15:38:12,587 WARN L181 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-01-14 15:38:20,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:38:20,072 INFO L93 Difference]: Finished difference Result 195 states and 241 transitions. [2019-01-14 15:38:20,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 15:38:20,074 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-01-14 15:38:20,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:38:20,076 INFO L225 Difference]: With dead ends: 195 [2019-01-14 15:38:20,076 INFO L226 Difference]: Without dead ends: 124 [2019-01-14 15:38:20,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=234, Invalid=1248, Unknown=0, NotChecked=0, Total=1482 [2019-01-14 15:38:20,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-14 15:38:20,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2019-01-14 15:38:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-14 15:38:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2019-01-14 15:38:20,105 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 50 [2019-01-14 15:38:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:38:20,106 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2019-01-14 15:38:20,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-14 15:38:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2019-01-14 15:38:20,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 15:38:20,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:38:20,110 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:38:20,110 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:38:20,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:38:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash -866692449, now seen corresponding path program 2 times [2019-01-14 15:38:20,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:38:20,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:38:20,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:38:20,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:38:20,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:38:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:38:20,720 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 15:38:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 54 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-14 15:38:20,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:38:20,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:38:20,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 15:38:20,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 15:38:20,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:38:20,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:38:21,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:21,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 29 [2019-01-14 15:38:21,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-14 15:38:21,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2019-01-14 15:38:21,195 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:21,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:21,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:21,225 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 28 treesize of output 29 [2019-01-14 15:38:21,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:38:21,229 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:21,239 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:21,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:21,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:21,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2019-01-14 15:38:21,278 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 17 treesize of output 20 [2019-01-14 15:38:21,283 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 20 treesize of output 27 [2019-01-14 15:38:21,283 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:21,288 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:21,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:21,306 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 44 treesize of output 62 [2019-01-14 15:38:21,309 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 14 treesize of output 13 [2019-01-14 15:38:21,310 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:21,321 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:21,330 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:21,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:21,348 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:80, output treesize:87 [2019-01-14 15:38:21,812 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 15:38:21,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:21,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:21,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:190, output treesize:1 [2019-01-14 15:38:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 49 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-14 15:38:21,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:38:21,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-01-14 15:38:21,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-14 15:38:21,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-14 15:38:21,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2019-01-14 15:38:21,864 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand 31 states. [2019-01-14 15:38:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:38:23,225 INFO L93 Difference]: Finished difference Result 180 states and 230 transitions. [2019-01-14 15:38:23,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 15:38:23,226 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 57 [2019-01-14 15:38:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:38:23,228 INFO L225 Difference]: With dead ends: 180 [2019-01-14 15:38:23,228 INFO L226 Difference]: Without dead ends: 128 [2019-01-14 15:38:23,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=269, Invalid=1893, Unknown=0, NotChecked=0, Total=2162 [2019-01-14 15:38:23,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-14 15:38:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2019-01-14 15:38:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-14 15:38:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 142 transitions. [2019-01-14 15:38:23,251 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 142 transitions. Word has length 57 [2019-01-14 15:38:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:38:23,252 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 142 transitions. [2019-01-14 15:38:23,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-14 15:38:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 142 transitions. [2019-01-14 15:38:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-14 15:38:23,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:38:23,253 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:38:23,253 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:38:23,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:38:23,253 INFO L82 PathProgramCache]: Analyzing trace with hash -447177867, now seen corresponding path program 2 times [2019-01-14 15:38:23,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:38:23,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:38:23,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:38:23,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:38:23,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:38:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:38:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-01-14 15:38:23,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:38:23,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 15:38:23,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 15:38:23,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 15:38:23,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:38:23,601 INFO L87 Difference]: Start difference. First operand 115 states and 142 transitions. Second operand 6 states. [2019-01-14 15:38:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:38:23,693 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2019-01-14 15:38:23,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 15:38:23,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-01-14 15:38:23,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:38:23,696 INFO L225 Difference]: With dead ends: 124 [2019-01-14 15:38:23,696 INFO L226 Difference]: Without dead ends: 115 [2019-01-14 15:38:23,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 15:38:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-14 15:38:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2019-01-14 15:38:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-14 15:38:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2019-01-14 15:38:23,726 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 52 [2019-01-14 15:38:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:38:23,729 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2019-01-14 15:38:23,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 15:38:23,730 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2019-01-14 15:38:23,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-14 15:38:23,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:38:23,733 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 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] [2019-01-14 15:38:23,733 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:38:23,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:38:23,734 INFO L82 PathProgramCache]: Analyzing trace with hash -200998585, now seen corresponding path program 3 times [2019-01-14 15:38:23,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:38:23,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:38:23,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:38:23,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:38:23,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:38:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:38:24,063 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-14 15:38:24,367 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-01-14 15:38:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-14 15:38:24,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:38:24,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:38:24,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 15:38:25,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 15:38:25,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:38:25,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:38:25,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:25,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-14 15:38:25,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 15:38:25,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:25,236 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 16 treesize of output 23 [2019-01-14 15:38:25,236 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,244 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:25,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 15:38:25,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:38:25,272 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,281 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:25,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-14 15:38:25,321 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 19 treesize of output 22 [2019-01-14 15:38:25,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:25,325 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 35 [2019-01-14 15:38:25,326 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,332 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:25,352 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 46 treesize of output 64 [2019-01-14 15:38:25,356 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 14 treesize of output 13 [2019-01-14 15:38:25,356 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,367 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,375 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,397 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:90, output treesize:78 [2019-01-14 15:38:25,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:25,721 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:25,726 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:25,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 164 [2019-01-14 15:38:25,737 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:25,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2019-01-14 15:38:25,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:25,787 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:25,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 118 [2019-01-14 15:38:25,820 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:25,822 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 89 treesize of output 57 [2019-01-14 15:38:25,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:25,862 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:136, output treesize:82 [2019-01-14 15:38:26,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:26,216 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:26,218 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 88 treesize of output 94 [2019-01-14 15:38:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2019-01-14 15:38:26,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:26,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:26,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:26,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2019-01-14 15:38:26,283 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:26,286 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 25 [2019-01-14 15:38:26,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:26,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:26,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:26,323 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:70 [2019-01-14 15:38:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 15:38:27,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:38:27,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2019-01-14 15:38:27,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-14 15:38:27,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-14 15:38:27,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 15:38:27,467 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand 34 states. [2019-01-14 15:38:27,837 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-01-14 15:38:28,018 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-01-14 15:38:28,335 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-01-14 15:38:28,529 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-01-14 15:38:29,316 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-01-14 15:38:29,513 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-01-14 15:38:29,985 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-01-14 15:38:30,763 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-01-14 15:38:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:38:31,813 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2019-01-14 15:38:31,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-14 15:38:31,815 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 53 [2019-01-14 15:38:31,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:38:31,816 INFO L225 Difference]: With dead ends: 134 [2019-01-14 15:38:31,816 INFO L226 Difference]: Without dead ends: 93 [2019-01-14 15:38:31,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=555, Invalid=3867, Unknown=0, NotChecked=0, Total=4422 [2019-01-14 15:38:31,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-14 15:38:31,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2019-01-14 15:38:31,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 15:38:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2019-01-14 15:38:31,835 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 53 [2019-01-14 15:38:31,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:38:31,836 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2019-01-14 15:38:31,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-14 15:38:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2019-01-14 15:38:31,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-14 15:38:31,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:38:31,843 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:38:31,844 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:38:31,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:38:31,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1261044102, now seen corresponding path program 3 times [2019-01-14 15:38:31,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:38:31,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:38:31,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:38:31,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:38:31,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:38:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:38:32,245 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-14 15:38:32,542 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2019-01-14 15:38:33,300 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-01-14 15:38:33,474 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2019-01-14 15:38:34,066 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 30 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 15:38:34,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:38:34,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:38:34,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 15:38:34,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 15:38:34,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:38:34,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:38:34,276 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 [2019-01-14 15:38:34,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:34,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:34,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2019-01-14 15:38:34,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:34,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-14 15:38:34,533 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 13 treesize of output 16 [2019-01-14 15:38:34,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:34,539 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:34,540 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 16 treesize of output 30 [2019-01-14 15:38:34,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:34,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:34,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:34,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 15:38:34,584 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 10 treesize of output 9 [2019-01-14 15:38:34,585 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:34,597 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:34,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:34,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:34,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-14 15:38:34,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 22 [2019-01-14 15:38:34,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:34,657 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 35 [2019-01-14 15:38:34,657 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:34,666 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:34,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:34,686 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 36 treesize of output 37 [2019-01-14 15:38:34,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:38:34,689 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:34,700 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:34,708 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:34,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:34,738 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:101, output treesize:79 [2019-01-14 15:38:34,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:34,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:34,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 15:38:34,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:34,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:34,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:74 [2019-01-14 15:38:35,134 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 15:38:35,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 84 [2019-01-14 15:38:35,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-01-14 15:38:35,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:35,167 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:35,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2019-01-14 15:38:35,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:35,188 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:35,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:35,233 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 65 treesize of output 70 [2019-01-14 15:38:35,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:35,247 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:35,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 53 [2019-01-14 15:38:35,271 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 15:38:35,310 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:38:35,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:38:35,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:35,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 87 [2019-01-14 15:38:35,397 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 13 treesize of output 16 [2019-01-14 15:38:35,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:35,402 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:35,403 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 16 treesize of output 30 [2019-01-14 15:38:35,404 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:35,417 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:35,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:35,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 95 [2019-01-14 15:38:35,481 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 29 treesize of output 17 [2019-01-14 15:38:35,482 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:35,508 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:35,536 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:35,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:35,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 113 [2019-01-14 15:38:35,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 22 [2019-01-14 15:38:35,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:35,693 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 35 [2019-01-14 15:38:35,693 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:35,702 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:35,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:35,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:35,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 85 treesize of output 96 [2019-01-14 15:38:35,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2019-01-14 15:38:35,761 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:35,782 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:35,810 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:35,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 120 [2019-01-14 15:38:35,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:35,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2019-01-14 15:38:35,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:35,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:35,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:35,864 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 2 case distinctions, treesize of input 71 treesize of output 121 [2019-01-14 15:38:35,865 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2019-01-14 15:38:35,931 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:38:36,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:36,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 117 [2019-01-14 15:38:36,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:36,029 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 3 case distinctions, treesize of input 48 treesize of output 92 [2019-01-14 15:38:36,030 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 3 xjuncts. [2019-01-14 15:38:36,103 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:38:36,111 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 112 treesize of output 109 [2019-01-14 15:38:36,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:36,116 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:36,119 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 33 treesize of output 50 [2019-01-14 15:38:36,120 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:36,147 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:36,226 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:38:36,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:36,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 126 [2019-01-14 15:38:36,291 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 109 [2019-01-14 15:38:36,682 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-01-14 15:38:36,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:36,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:36,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:36,696 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 75 treesize of output 116 [2019-01-14 15:38:36,696 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:36,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:36,807 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 56 treesize of output 70 [2019-01-14 15:38:36,808 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:36,865 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:36,920 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:36,921 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 80 treesize of output 84 [2019-01-14 15:38:36,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:36,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:36,934 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:36,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 69 [2019-01-14 15:38:36,942 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:36,974 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:37,003 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:37,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 108 [2019-01-14 15:38:37,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:37,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 73 [2019-01-14 15:38:37,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:37,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:37,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:37,065 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 2 case distinctions, treesize of input 67 treesize of output 105 [2019-01-14 15:38:37,066 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2019-01-14 15:38:37,150 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:38:37,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:37,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 76 [2019-01-14 15:38:37,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:37,283 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 3 case distinctions, treesize of input 44 treesize of output 80 [2019-01-14 15:38:37,284 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 3 xjuncts. [2019-01-14 15:38:37,342 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:38:37,364 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 71 treesize of output 68 [2019-01-14 15:38:37,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:37,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:37,372 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:37,375 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 29 treesize of output 54 [2019-01-14 15:38:37,375 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:37,396 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:37,460 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:38:37,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 15:38:37,616 INFO L202 ElimStorePlain]: Needed 36 recursive calls to eliminate 4 variables, input treesize:146, output treesize:343 [2019-01-14 15:38:37,905 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-01-14 15:38:38,455 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-14 15:38:38,756 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-01-14 15:38:38,764 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:38,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:38,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:38,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:38,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 165 [2019-01-14 15:38:38,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:38,783 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:38,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:38,798 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:38,819 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 171 [2019-01-14 15:38:38,822 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 15:38:38,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:39,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:39,103 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:39,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 126 [2019-01-14 15:38:39,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:39,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2019-01-14 15:38:39,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:39,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:39,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:39,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 185 treesize of output 201 [2019-01-14 15:38:39,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:39,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:39,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:39,387 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:39,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 209 [2019-01-14 15:38:39,398 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:38:39,576 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:39,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 178 [2019-01-14 15:38:39,581 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:38:39,737 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 15:38:40,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:40,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 142 [2019-01-14 15:38:40,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:40,055 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:40,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 107 [2019-01-14 15:38:40,083 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2019-01-14 15:38:40,184 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 15:38:40,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:40,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 210 treesize of output 191 [2019-01-14 15:38:40,233 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:40,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 157 [2019-01-14 15:38:40,237 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:38:40,339 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 15:38:40,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:40,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 159 [2019-01-14 15:38:40,364 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:40,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 77 [2019-01-14 15:38:40,368 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:38:40,406 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:38:40,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:40,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 134 [2019-01-14 15:38:40,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:40,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:40,790 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:40,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 86 [2019-01-14 15:38:40,793 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:40,833 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:41,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:41,213 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:41,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 122 [2019-01-14 15:38:41,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:38:41,224 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:38:41,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 76 [2019-01-14 15:38:41,225 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 15:38:41,254 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:38:41,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2019-01-14 15:38:41,537 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 6 variables, input treesize:480, output treesize:787 [2019-01-14 15:38:42,331 WARN L181 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 74 [2019-01-14 15:38:43,268 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-14 15:38:43,582 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-01-14 15:38:44,337 WARN L181 SmtUtils]: Spent 524.00 ms on a formula simplification that was a NOOP. DAG size: 217 [2019-01-14 15:39:35,486 WARN L181 SmtUtils]: Spent 43.09 s on a formula simplification. DAG size of input: 249 DAG size of output: 215 [2019-01-14 15:39:41,584 WARN L181 SmtUtils]: Spent 5.51 s on a formula simplification. DAG size of input: 439 DAG size of output: 187 [2019-01-14 15:39:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 7 proven. 75 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-01-14 15:39:42,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:39:42,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18] total 43 [2019-01-14 15:39:42,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-14 15:39:42,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-14 15:39:42,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1682, Unknown=2, NotChecked=0, Total=1806 [2019-01-14 15:39:42,476 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand 43 states. [2019-01-14 15:39:43,116 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-01-14 15:39:43,335 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2019-01-14 15:39:43,641 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-01-14 15:39:44,204 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 69 [2019-01-14 15:39:44,540 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 136 [2019-01-14 15:39:44,865 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 140 [2019-01-14 15:39:45,145 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 65 [2019-01-14 15:39:46,992 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 134 [2019-01-14 15:39:47,295 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 147 [2019-01-14 15:39:47,604 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 143 [2019-01-14 15:39:48,229 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 121 [2019-01-14 15:39:48,573 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 127 [2019-01-14 15:39:48,918 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 124 [2019-01-14 15:39:49,126 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 118 [2019-01-14 15:39:49,527 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-01-14 15:39:49,889 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 133 [2019-01-14 15:39:50,075 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2019-01-14 15:39:50,397 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 140 [2019-01-14 15:39:50,719 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 144 [2019-01-14 15:39:50,954 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 134 [2019-01-14 15:39:51,199 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2019-01-14 15:39:51,809 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 85 [2019-01-14 15:39:52,178 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 75 [2019-01-14 15:39:56,874 WARN L181 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 134 [2019-01-14 15:40:09,571 WARN L181 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 142 DAG size of output: 139 [2019-01-14 15:40:13,998 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 148 [2019-01-14 15:40:14,772 WARN L181 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 156 [2019-01-14 15:40:38,668 WARN L181 SmtUtils]: Spent 15.58 s on a formula simplification. DAG size of input: 258 DAG size of output: 134 [2019-01-14 15:40:59,922 WARN L181 SmtUtils]: Spent 18.98 s on a formula simplification. DAG size of input: 260 DAG size of output: 136 [2019-01-14 15:41:44,805 WARN L181 SmtUtils]: Spent 42.71 s on a formula simplification. DAG size of input: 282 DAG size of output: 245 [2019-01-14 15:41:47,386 WARN L181 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 146 [2019-01-14 15:42:04,807 WARN L181 SmtUtils]: Spent 13.11 s on a formula simplification. DAG size of input: 267 DAG size of output: 141 [2019-01-14 15:42:08,123 WARN L181 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 281 DAG size of output: 243 [2019-01-14 15:42:10,809 WARN L181 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 213 [2019-01-14 15:42:13,511 WARN L181 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 147 [2019-01-14 15:42:22,121 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-01-14 15:42:22,431 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-01-14 15:42:22,605 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-14 15:42:22,760 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-01-14 15:42:22,963 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-01-14 15:42:23,565 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2019-01-14 15:42:23,872 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 88 [2019-01-14 15:42:25,452 WARN L181 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 153 [2019-01-14 15:42:25,975 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 144 [2019-01-14 15:42:26,619 WARN L181 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 166 [2019-01-14 15:42:27,846 WARN L181 SmtUtils]: Spent 968.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 159 [2019-01-14 15:42:28,938 WARN L181 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 165 [2019-01-14 15:42:31,728 WARN L181 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 299 DAG size of output: 158 [2019-01-14 15:42:32,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:42:32,049 INFO L93 Difference]: Finished difference Result 219 states and 269 transitions. [2019-01-14 15:42:32,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-14 15:42:32,051 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 64 [2019-01-14 15:42:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:42:32,053 INFO L225 Difference]: With dead ends: 219 [2019-01-14 15:42:32,053 INFO L226 Difference]: Without dead ends: 101 [2019-01-14 15:42:32,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3873 ImplicationChecksByTransitivity, 196.1s TimeCoverageRelationStatistics Valid=1385, Invalid=11260, Unknown=11, NotChecked=0, Total=12656 [2019-01-14 15:42:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-14 15:42:32,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 88. [2019-01-14 15:42:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-14 15:42:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2019-01-14 15:42:32,071 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 64 [2019-01-14 15:42:32,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:42:32,071 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2019-01-14 15:42:32,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-14 15:42:32,071 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2019-01-14 15:42:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-14 15:42:32,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:42:32,072 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:42:32,073 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:42:32,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:42:32,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2134174205, now seen corresponding path program 4 times [2019-01-14 15:42:32,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:42:32,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:42:32,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:42:32,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:42:32,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:42:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:42:32,741 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-01-14 15:42:32,946 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2019-01-14 15:42:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 57 proven. 16 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-14 15:42:33,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:42:33,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:42:33,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 15:42:33,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 15:42:33,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:42:33,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:42:33,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2019-01-14 15:42:33,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 15:42:33,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:42:33,522 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 16 treesize of output 23 [2019-01-14 15:42:33,522 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:42:33,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:42:33,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 15:42:33,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 15:42:33,569 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:42:33,581 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:42:33,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:42:33,604 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2019-01-14 15:42:33,608 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 33 treesize of output 32 [2019-01-14 15:42:33,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:42:33,617 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 32 treesize of output 36 [2019-01-14 15:42:33,617 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:42:33,631 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:42:33,655 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 30 treesize of output 23 [2019-01-14 15:42:33,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:42:33,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 40 [2019-01-14 15:42:33,678 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2019-01-14 15:42:33,755 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:42:33,789 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:42:33,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2019-01-14 15:42:33,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 15:42:33,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:42:33,874 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:42:33,875 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 16 treesize of output 30 [2019-01-14 15:42:33,875 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 15:42:33,884 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:42:33,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 15:42:33,923 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 10 treesize of output 9 [2019-01-14 15:42:33,924 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 15:42:33,933 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:42:33,944 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:42:33,950 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2019-01-14 15:42:33,954 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 33 treesize of output 32 [2019-01-14 15:42:33,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:42:33,985 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:42:33,986 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 32 treesize of output 43 [2019-01-14 15:42:33,986 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 15:42:33,998 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:42:34,015 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 30 treesize of output 23 [2019-01-14 15:42:34,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:42:34,024 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:42:34,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 41 [2019-01-14 15:42:34,044 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2019-01-14 15:42:34,070 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:42:34,096 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:42:34,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-01-14 15:42:34,158 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 4 variables, input treesize:82, output treesize:379 [2019-01-14 15:42:34,299 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 15:42:34,670 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-14 15:42:34,871 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 15:42:35,179 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-14 15:43:04,655 WARN L181 SmtUtils]: Spent 26.53 s on a formula simplification. DAG size of input: 162 DAG size of output: 102 [2019-01-14 15:43:19,346 WARN L181 SmtUtils]: Spent 14.57 s on a formula simplification that was a NOOP. DAG size: 115 [2019-01-14 15:43:37,308 WARN L181 SmtUtils]: Spent 17.81 s on a formula simplification that was a NOOP. DAG size: 120 [2019-01-14 15:43:45,804 WARN L181 SmtUtils]: Spent 8.41 s on a formula simplification that was a NOOP. DAG size: 109 [2019-01-14 15:44:16,141 WARN L181 SmtUtils]: Spent 30.03 s on a formula simplification. DAG size of input: 498 DAG size of output: 114 [2019-01-14 15:44:27,510 WARN L181 SmtUtils]: Spent 10.77 s on a formula simplification. DAG size of input: 710 DAG size of output: 134 [2019-01-14 15:44:28,728 WARN L181 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 457 DAG size of output: 139 [2019-01-14 15:44:28,757 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 15:44:28,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:29,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:29,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:29,347 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:29,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 254 treesize of output 261 [2019-01-14 15:44:29,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:29,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:29,395 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 256 [2019-01-14 15:44:29,397 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 15:44:29,726 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 194 treesize of output 188 [2019-01-14 15:44:29,728 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:44:30,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:30,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:30,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:30,628 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:30,628 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:30,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 223 [2019-01-14 15:44:30,630 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:30,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:30,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:30,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:30,637 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:30,638 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:30,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 213 [2019-01-14 15:44:30,639 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:30,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:30,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:30,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:30,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:30,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:30,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:30,900 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:30,901 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:30,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:30,904 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:30,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:30,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:30,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 333 [2019-01-14 15:44:30,909 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:31,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:31,173 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:31,174 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:31,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 211 [2019-01-14 15:44:31,175 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:31,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:31,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2019-01-14 15:44:31,391 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:31,589 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 110 treesize of output 102 [2019-01-14 15:44:31,591 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:44:31,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:31,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:31,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:31,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:31,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:31,792 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:31,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:31,794 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:31,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:31,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:31,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 287 [2019-01-14 15:44:31,799 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:32,008 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2019-01-14 15:44:33,245 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:33,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 245 [2019-01-14 15:44:33,288 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:33,295 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:33,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:33,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:33,300 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:33,301 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:33,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 239 [2019-01-14 15:44:33,304 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:33,409 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:33,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:33,412 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:33,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 208 [2019-01-14 15:44:33,413 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:33,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:33,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 115 [2019-01-14 15:44:33,487 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:33,523 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:44:33,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:33,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:33,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 104 [2019-01-14 15:44:33,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:33,816 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 100 treesize of output 94 [2019-01-14 15:44:33,818 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:33,891 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:33,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:33,895 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:33,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 46 [2019-01-14 15:44:33,897 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:33,952 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 36 [2019-01-14 15:44:33,953 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:34,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 82 [2019-01-14 15:44:34,008 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:34,068 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:34,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,072 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:34,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 28 [2019-01-14 15:44:34,074 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:34,110 INFO L267 ElimStorePlain]: Start of recursive call 17: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:44:34,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 82 [2019-01-14 15:44:34,123 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:34,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,126 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:34,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 13 [2019-01-14 15:44:34,127 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:34,145 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:44:34,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,155 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 112 [2019-01-14 15:44:34,169 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2019-01-14 15:44:34,171 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-14 15:44:34,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,240 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:34,241 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:34,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 83 [2019-01-14 15:44:34,442 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2019-01-14 15:44:34,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,451 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:34,453 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:34,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 43 [2019-01-14 15:44:34,456 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:34,515 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:44:34,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 88 [2019-01-14 15:44:34,538 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:34,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,542 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:34,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 28 [2019-01-14 15:44:34,543 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:34,575 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:44:34,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 124 [2019-01-14 15:44:34,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,601 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 120 treesize of output 114 [2019-01-14 15:44:34,602 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:34,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,706 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:34,707 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:34,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 70 [2019-01-14 15:44:34,709 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:34,780 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 100 treesize of output 94 [2019-01-14 15:44:34,781 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:34,834 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 44 treesize of output 38 [2019-01-14 15:44:34,835 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:34,865 INFO L267 ElimStorePlain]: Start of recursive call 31: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:44:34,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 85 [2019-01-14 15:44:34,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:34,978 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:34,980 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:34,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 51 [2019-01-14 15:44:34,983 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:35,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:35,033 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:35,035 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:35,037 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:35,038 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:35,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 30 [2019-01-14 15:44:35,040 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:35,069 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:44:35,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:35,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:35,372 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:35,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:35,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 216 [2019-01-14 15:44:35,390 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:35,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:35,395 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:35,426 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 179 treesize of output 172 [2019-01-14 15:44:35,428 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 15:44:35,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-14 15:44:35,515 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:35,543 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:44:35,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:35,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:35,667 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2019-01-14 15:44:35,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:35,708 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2019-01-14 15:44:35,709 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:35,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:44:35,728 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:35,730 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:44:35,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 13 [2019-01-14 15:44:35,732 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-01-14 15:44:35,744 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:44:35,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 18 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 15:44:35,816 INFO L202 ElimStorePlain]: Needed 44 recursive calls to eliminate 30 variables, input treesize:2050, output treesize:29 [2019-01-14 15:44:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 103 proven. 22 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-01-14 15:44:36,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:44:36,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2019-01-14 15:44:36,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-14 15:44:36,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-14 15:44:36,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=823, Unknown=3, NotChecked=0, Total=930 [2019-01-14 15:44:36,011 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 31 states. [2019-01-14 15:44:38,527 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-01-14 15:45:00,089 WARN L181 SmtUtils]: Spent 12.44 s on a formula simplification. DAG size of input: 162 DAG size of output: 99 [2019-01-14 15:45:12,667 WARN L181 SmtUtils]: Spent 12.46 s on a formula simplification. DAG size of input: 169 DAG size of output: 89 [2019-01-14 15:45:45,926 WARN L181 SmtUtils]: Spent 33.13 s on a formula simplification. DAG size of input: 123 DAG size of output: 119 [2019-01-14 15:45:58,650 WARN L181 SmtUtils]: Spent 12.56 s on a formula simplification. DAG size of input: 242 DAG size of output: 92 [2019-01-14 15:46:32,649 WARN L181 SmtUtils]: Spent 33.90 s on a formula simplification. DAG size of input: 205 DAG size of output: 135 [2019-01-14 15:46:43,595 WARN L181 SmtUtils]: Spent 10.78 s on a formula simplification. DAG size of input: 255 DAG size of output: 115 [2019-01-14 15:46:56,586 WARN L181 SmtUtils]: Spent 12.89 s on a formula simplification. DAG size of input: 225 DAG size of output: 110 [2019-01-14 15:47:07,724 WARN L181 SmtUtils]: Spent 10.98 s on a formula simplification. DAG size of input: 282 DAG size of output: 108 [2019-01-14 15:47:20,503 WARN L181 SmtUtils]: Spent 12.67 s on a formula simplification. DAG size of input: 248 DAG size of output: 108 [2019-01-14 15:47:33,943 WARN L181 SmtUtils]: Spent 13.27 s on a formula simplification. DAG size of input: 190 DAG size of output: 107 [2019-01-14 15:47:49,301 WARN L181 SmtUtils]: Spent 15.26 s on a formula simplification that was a NOOP. DAG size: 139 [2019-01-14 15:47:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:47:49,338 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2019-01-14 15:47:49,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 15:47:49,339 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 74 [2019-01-14 15:47:49,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:47:49,339 INFO L225 Difference]: With dead ends: 93 [2019-01-14 15:47:49,339 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 15:47:49,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 297.6s TimeCoverageRelationStatistics Valid=289, Invalid=1778, Unknown=3, NotChecked=0, Total=2070 [2019-01-14 15:47:49,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 15:47:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 15:47:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 15:47:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 15:47:49,341 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2019-01-14 15:47:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:47:49,341 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 15:47:49,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-14 15:47:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 15:47:49,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 15:47:49,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 15:47:49,702 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 402 DAG size of output: 382 [2019-01-14 15:47:49,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:47:50,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:47:50,256 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 348 DAG size of output: 283 [2019-01-14 15:47:50,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:47:50,443 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 266 [2019-01-14 15:47:50,620 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 293 [2019-01-14 15:47:52,647 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 379 DAG size of output: 94 [2019-01-14 15:49:31,837 WARN L181 SmtUtils]: Spent 1.65 m on a formula simplification. DAG size of input: 1321 DAG size of output: 345 [2019-01-14 15:49:32,389 WARN L181 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 94 [2019-01-14 15:49:33,664 WARN L181 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 280 DAG size of output: 91 [2019-01-14 15:49:42,205 WARN L181 SmtUtils]: Spent 8.52 s on a formula simplification. DAG size of input: 1357 DAG size of output: 1 [2019-01-14 15:49:42,747 WARN L181 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 100 [2019-01-14 15:49:44,379 WARN L181 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 291 DAG size of output: 78 [2019-01-14 15:49:44,383 INFO L451 ceAbstractionStarter]: At program point L609(lines 587 610) the Hoare annotation is: true [2019-01-14 15:49:44,383 INFO L448 ceAbstractionStarter]: For program point L576(lines 576 577) no Hoare annotation was computed. [2019-01-14 15:49:44,383 INFO L444 ceAbstractionStarter]: At program point L572(lines 572 578) the Hoare annotation is: (let ((.cse21 (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (let ((.cse0 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset)) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1)) (.cse26 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) .cse21))) (let ((.cse2 (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (.cse3 (= 0 ULTIMATE.start_main_~x~0.offset)) (.cse4 (= (select |#valid| ULTIMATE.start_main_~n~0.base) 1)) (.cse22 (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_re_insert_~x.base)) (.cse5 (not (= |ULTIMATE.start_main_~#list~0.base| 0))) (.cse6 (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1)) (.cse7 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_re_insert_~x.base) ULTIMATE.start_re_insert_~x.offset) |ULTIMATE.start_main_~#list~0.base|)) (.cse23 (= ULTIMATE.start_main_~x~0.base .cse26)) (.cse8 (and .cse0 .cse1)) (.cse9 (= 0 ULTIMATE.start_re_insert_~x.offset)) (.cse10 (<= (+ |ULTIMATE.start_main_~#list~0.base| 2) ULTIMATE.start_main_~x~0.base)) (.cse11 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~n~0.offset)) (.cse12 (not (= ULTIMATE.start_main_~n~0.base 0))) (.cse13 (= 0 ULTIMATE.start_remove_~x.offset)) (.cse14 (= ULTIMATE.start_main_~tail~0.base |ULTIMATE.start_main_~#list~0.base|)) (.cse15 (<= (+ ULTIMATE.start_main_~tail~0.base 2) ULTIMATE.start_main_~n~0.base)) (.cse16 (= ULTIMATE.start_main_~n~0.offset 0)) (.cse17 (<= (+ |ULTIMATE.start_main_~#list~0.base| 1) |#StackHeapBarrier|)) (.cse18 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) |ULTIMATE.start_main_~#list~0.base|)) (.cse19 (not (= ULTIMATE.start_main_~x~0.base 0))) (.cse20 (= ULTIMATE.start_remove_~x.base ULTIMATE.start_main_~x~0.base))) (or (and (< |ULTIMATE.start_main_~#list~0.base| |#StackHeapBarrier|) (= 0 |ULTIMATE.start_main_~#list~0.offset|) .cse0 .cse1 (= ULTIMATE.start_main_~x~0.offset |ULTIMATE.start_main_~#list~0.offset|) (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base) (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|)) (and (and (not (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_main_~n~0.base)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_remove_~x.base) ULTIMATE.start_remove_~x.offset)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|) .cse21) ULTIMATE.start_main_~x~0.offset) .cse22 .cse23) (let ((.cse24 (select |#memory_$Pointer$.offset| .cse26)) (.cse25 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base))) (and (= 0 (select .cse24 4)) .cse2 .cse3 .cse4 .cse22 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 (= (select .cse24 |ULTIMATE.start_main_~#list~0.offset|) |ULTIMATE.start_main_~#list~0.offset|) .cse12 .cse13 .cse14 .cse15 (= (select (select |#memory_$Pointer$.offset| (select .cse25 0)) .cse21) 0) .cse16 .cse17 .cse18 (= (select .cse25 4) 0) .cse19 .cse20)))))) [2019-01-14 15:49:44,383 INFO L448 ceAbstractionStarter]: For program point L601(lines 601 602) no Hoare annotation was computed. [2019-01-14 15:49:44,384 INFO L444 ceAbstractionStarter]: At program point L601-2(lines 593 603) the Hoare annotation is: (let ((.cse12 (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (let ((.cse19 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) .cse12)) (.cse20 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base))) (let ((.cse6 (+ ULTIMATE.start_main_~n~0.offset 4)) (.cse7 (select .cse20 ULTIMATE.start_main_~n~0.offset)) (.cse17 (select |#memory_$Pointer$.offset| .cse19))) (let ((.cse8 (+ |ULTIMATE.start_main_~#list~0.base| 2)) (.cse11 (= (select .cse17 |ULTIMATE.start_main_~#list~0.offset|) |ULTIMATE.start_main_~#list~0.offset|)) (.cse2 (= ULTIMATE.start_main_~n~0.base .cse19)) (.cse13 (= ULTIMATE.start_main_~n~0.offset (select (select |#memory_$Pointer$.offset| .cse7) .cse12))) (.cse10 (= .cse7 |ULTIMATE.start_main_~#list~0.base|)) (.cse16 (= 0 (select .cse20 .cse6))) (.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base)) (.cse9 (= ULTIMATE.start_main_~tail~0.base |ULTIMATE.start_main_~#list~0.base|)) (.cse1 (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1)) (.cse3 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset)) (.cse14 (not (= ULTIMATE.start_main_~x~0.base 0)))) (or (let ((.cse15 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base))) (let ((.cse4 (select .cse15 0)) (.cse5 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base))) (and (= 0 (select .cse0 4)) (= (select |#valid| ULTIMATE.start_main_~n~0.base) 1) .cse1 (and .cse2 .cse3 (= .cse4 |ULTIMATE.start_main_~#list~0.base|) (= 0 ULTIMATE.start_main_~x~0.offset) (= 0 (select .cse5 .cse6)) (< ULTIMATE.start_main_~tail~0.base |#StackHeapBarrier|) (not (= 0 .cse7)) (<= .cse8 ULTIMATE.start_main_~x~0.base) (not (= ULTIMATE.start_main_~n~0.base 0)) .cse9 (<= (+ ULTIMATE.start_main_~tail~0.base 2) ULTIMATE.start_main_~n~0.base) (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1) .cse10) .cse11 (= (select (select |#memory_$Pointer$.offset| .cse4) .cse12) 0) (= 0 (select .cse5 ULTIMATE.start_main_~tail~0.offset)) .cse13 (= (select .cse0 0) |ULTIMATE.start_main_~#list~0.offset|) .cse14 (= (select .cse15 4) 0) .cse16))) (and (and (and (let ((.cse18 (and (not (= ULTIMATE.start_main_~x~0.base .cse19)) (and (= 0 |ULTIMATE.start_main_~#list~0.offset|) (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~x~0.offset))))) (or (and (<= .cse8 ULTIMATE.start_main_~n~0.base) .cse11 .cse2 (= 0 (select .cse17 .cse6)) .cse18 .cse13 .cse10 .cse16) (and .cse18 (= 0 .cse19)))) (= 0 (select .cse0 .cse12))) .cse9 .cse1) .cse3 (<= (+ |ULTIMATE.start_main_~#list~0.base| 1) |#StackHeapBarrier|) (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|) .cse14)))))) [2019-01-14 15:49:44,384 INFO L444 ceAbstractionStarter]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base)) (.cse0 (< |ULTIMATE.start_main_~#list~0.base| |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset)) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1))) (or (and .cse0 (= 0 |ULTIMATE.start_main_~#list~0.offset|) .cse1 .cse2 (= ULTIMATE.start_main_~x~0.offset |ULTIMATE.start_main_~#list~0.offset|) .cse3 (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|)) (let ((.cse11 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base)) (.cse10 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base)) (.cse9 (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (let ((.cse6 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) .cse9)) (.cse7 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base)) (.cse4 (+ |ULTIMATE.start_main_~#list~0.base| 2)) (.cse5 (select .cse10 0)) (.cse8 (select .cse11 ULTIMATE.start_main_~n~0.offset))) (and (= ULTIMATE.start_main_~n~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~tail~0.base) (+ ULTIMATE.start_main_~tail~0.offset 4))) (and (and (and (<= .cse4 ULTIMATE.start_main_~n~0.base) .cse3 .cse0 .cse2 .cse1) (= ULTIMATE.start_main_~n~0.offset 0) (= .cse5 |ULTIMATE.start_main_~#list~0.base|)) (= |ULTIMATE.start_main_~#list~0.offset| 0) (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~x~0.offset)) (= (select |#valid| ULTIMATE.start_main_~n~0.base) 1) (not (= ULTIMATE.start_main_~x~0.base 0)) (= 0 (select (select |#memory_$Pointer$.offset| .cse6) 4)) (not (= .cse6 0)) (= 0 (select .cse7 0)) (= 0 (select .cse7 4)) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (not (= 0 .cse8)) (<= .cse4 ULTIMATE.start_main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| .cse5) .cse9) 0) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~tail~0.offset)) (= .cse8 |ULTIMATE.start_main_~#list~0.base|) (= (select .cse10 4) 0) (= 0 (select .cse11 (+ ULTIMATE.start_main_~n~0.offset 4)))))))) [2019-01-14 15:49:44,384 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-01-14 15:49:44,384 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-14 15:49:44,385 INFO L448 ceAbstractionStarter]: For program point L606(line 606) no Hoare annotation was computed. [2019-01-14 15:49:44,385 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 15:49:44,385 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 15:49:44,385 INFO L444 ceAbstractionStarter]: At program point L606-2(line 606) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.offset| ULTIMATE.start_remove_~x.base))) (let ((.cse2 (select .cse3 ULTIMATE.start_remove_~x.offset)) (.cse1 (+ |ULTIMATE.start_main_~#list~0.offset| 4)) (.cse0 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base))) (and (= 0 ULTIMATE.start_main_~n~0.offset) (= (select |#valid| ULTIMATE.start_main_~n~0.base) 1) (= |ULTIMATE.start_main_~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (not (= ULTIMATE.start_main_~x~0.base (select .cse0 .cse1))) (= .cse2 |ULTIMATE.start_main_~#list~0.offset|) (not (= 0 (select .cse0 0))) (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~x~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_remove_~x.base) ULTIMATE.start_remove_~x.offset)) (+ .cse2 4) (select .cse3 (+ ULTIMATE.start_remove_~x.offset 4))) .cse1)) (<= (+ |ULTIMATE.start_main_~#list~0.base| 2) ULTIMATE.start_main_~x~0.base) (not |ULTIMATE.start_main_#t~short21|) (not (= ULTIMATE.start_main_~n~0.base 0)) (= (select .cse0 ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_~#list~0.base|) (= ULTIMATE.start_main_~tail~0.base |ULTIMATE.start_main_~#list~0.base|) (<= (+ ULTIMATE.start_main_~tail~0.base 2) ULTIMATE.start_main_~n~0.base) (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset) (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1) (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_remove_~x.offset) (exists ((v_arrayElimCell_23 Int)) (let ((.cse8 (select |#memory_$Pointer$.base| v_arrayElimCell_23)) (.cse9 (select |#memory_$Pointer$.offset| v_arrayElimCell_23))) (let ((.cse7 (select .cse9 4)) (.cse5 (select .cse8 0)) (.cse6 (select .cse9 0)) (.cse4 (select .cse8 4))) (and (= .cse4 0) (= (select (select |#memory_$Pointer$.offset| .cse5) (+ .cse6 4)) .cse7) (= 0 .cse7) (= .cse5 |ULTIMATE.start_main_~#list~0.base|) (= |ULTIMATE.start_main_~#list~0.offset| .cse6) (= .cse4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (<= (+ |ULTIMATE.start_main_~#list~0.base| 2) v_arrayElimCell_23))))) (<= (+ |ULTIMATE.start_main_~#list~0.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) |ULTIMATE.start_main_~#list~0.base|) (= (select .cse0 4) 0) (= ULTIMATE.start_remove_~x.base ULTIMATE.start_main_~x~0.base)))) [2019-01-14 15:49:44,385 INFO L448 ceAbstractionStarter]: For program point L606-3(line 606) no Hoare annotation was computed. [2019-01-14 15:49:44,385 INFO L448 ceAbstractionStarter]: For program point L606-4(line 606) no Hoare annotation was computed. [2019-01-14 15:49:44,385 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 570) no Hoare annotation was computed. [2019-01-14 15:49:44,385 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 571) no Hoare annotation was computed. [2019-01-14 15:49:44,385 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 15:49:44,386 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 575) no Hoare annotation was computed. [2019-01-14 15:49:44,386 INFO L448 ceAbstractionStarter]: For program point L574-2(lines 574 575) no Hoare annotation was computed. [2019-01-14 15:49:44,386 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-01-14 15:49:44,386 INFO L444 ceAbstractionStarter]: At program point L5-2(lines 4 9) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset)) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1))) (or (and (< |ULTIMATE.start_main_~#list~0.base| |#StackHeapBarrier|) (= 0 |ULTIMATE.start_main_~#list~0.offset|) .cse0 .cse1 (= ULTIMATE.start_main_~x~0.offset |ULTIMATE.start_main_~#list~0.offset|) (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base) (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|)) (let ((.cse2 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base))) (and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)) (and .cse0 .cse1) (= 0 ULTIMATE.start_main_~x~0.offset) (= (select |#valid| ULTIMATE.start_main_~n~0.base) 1) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (not (= 0 (select .cse2 0))) (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~n~0.offset) (<= (+ |ULTIMATE.start_main_~#list~0.base| 2) ULTIMATE.start_main_~x~0.base) (not (= ULTIMATE.start_main_~n~0.base 0)) (= 0 ULTIMATE.start_remove_~x.offset) (= (select .cse2 ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_~#list~0.base|) (= ULTIMATE.start_main_~tail~0.base |ULTIMATE.start_main_~#list~0.base|) (<= (+ ULTIMATE.start_main_~tail~0.base 2) ULTIMATE.start_main_~n~0.base) (exists ((v_arrayElimCell_23 Int)) (let ((.cse7 (select |#memory_$Pointer$.base| v_arrayElimCell_23)) (.cse8 (select |#memory_$Pointer$.offset| v_arrayElimCell_23))) (let ((.cse6 (select .cse8 4)) (.cse4 (select .cse7 0)) (.cse5 (select .cse8 0)) (.cse3 (select .cse7 4))) (and (= .cse3 0) (= (select (select |#memory_$Pointer$.offset| .cse4) (+ .cse5 4)) .cse6) (= 0 .cse6) (= .cse4 |ULTIMATE.start_main_~#list~0.base|) (= |ULTIMATE.start_main_~#list~0.offset| .cse5) (= .cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (<= (+ |ULTIMATE.start_main_~#list~0.base| 2) v_arrayElimCell_23))))) (= 0 (select (let ((.cse9 (select |#memory_$Pointer$.offset| ULTIMATE.start_remove_~x.base))) (store (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ULTIMATE.start_remove_~x.base) ULTIMATE.start_remove_~x.offset)) (+ (select .cse9 ULTIMATE.start_remove_~x.offset) 4) (select .cse9 (+ ULTIMATE.start_remove_~x.offset 4)))) (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (= ULTIMATE.start_main_~n~0.offset 0) (<= (+ |ULTIMATE.start_main_~#list~0.base| 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) |ULTIMATE.start_main_~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base) |ULTIMATE.start_main_~#list~0.offset|) |ULTIMATE.start_main_~#list~0.offset|) (= (select .cse2 4) 0) (not (= ULTIMATE.start_main_~x~0.base 0)) (= ULTIMATE.start_remove_~x.base ULTIMATE.start_main_~x~0.base))))) [2019-01-14 15:49:44,386 INFO L448 ceAbstractionStarter]: For program point L5-3(lines 5 7) no Hoare annotation was computed. [2019-01-14 15:49:44,386 INFO L448 ceAbstractionStarter]: For program point L608(line 608) no Hoare annotation was computed. [2019-01-14 15:49:44,386 INFO L451 ceAbstractionStarter]: At program point L5-5(lines 4 9) the Hoare annotation is: true [2019-01-14 15:49:44,386 INFO L448 ceAbstractionStarter]: For program point L604(line 604) no Hoare annotation was computed. [2019-01-14 15:49:44,387 INFO L448 ceAbstractionStarter]: For program point L567(lines 567 568) no Hoare annotation was computed. [2019-01-14 15:49:44,387 INFO L448 ceAbstractionStarter]: For program point L567-2(lines 567 568) no Hoare annotation was computed. [2019-01-14 15:49:44,387 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 597) no Hoare annotation was computed. [2019-01-14 15:49:44,387 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-01-14 15:49:44,387 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-01-14 15:49:44,387 INFO L448 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. [2019-01-14 15:49:44,387 INFO L451 ceAbstractionStarter]: At program point is_list_containing_xENTRY(lines 579 586) the Hoare annotation is: true [2019-01-14 15:49:44,388 INFO L444 ceAbstractionStarter]: At program point L584(line 584) the Hoare annotation is: (let ((.cse20 (select |#memory_$Pointer$.offset| |is_list_containing_x_#in~l.base|)) (.cse63 (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|)) (.cse67 (+ |is_list_containing_x_#in~l.offset| 4))) (let ((.cse64 (select .cse63 .cse67)) (.cse22 (select .cse20 .cse67))) (let ((.cse21 (+ (- 0) 4)) (.cse33 (not (= 0 .cse22))) (.cse32 (not (= .cse64 0)))) (let ((.cse27 (forall ((ULTIMATE.start_main_~tail~0.offset Int) (v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_13 Int)) (let ((.cse66 (select |#memory_$Pointer$.base| v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_13))) (let ((.cse65 (select .cse66 0))) (or (= .cse65 0) (< v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_13 (+ .cse65 2)) (not (= (select .cse66 4) 0)) (not (= v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_13 (select (select |#memory_$Pointer$.base| .cse65) (+ ULTIMATE.start_main_~tail~0.offset 4))))))))) (.cse0 (or .cse33 .cse32)) (.cse1 (= .cse64 |is_list_containing_x_#t~mem14.base|)) (.cse17 (not (= |is_list_containing_x_#in~l.offset| 0))) (.cse19 (select .cse63 .cse21))) (and (or (and .cse0 .cse1) (and (or (forall ((v_arrayElimCell_23 Int)) (let ((.cse6 (select |#memory_$Pointer$.offset| v_arrayElimCell_23)) (.cse7 (select |#memory_$Pointer$.base| v_arrayElimCell_23))) (let ((.cse2 (select .cse7 0)) (.cse5 (select .cse7 4)) (.cse3 (select .cse6 4)) (.cse4 (select .cse6 0))) (or (< v_arrayElimCell_23 (+ .cse2 2)) (not (= .cse3 (select (select |#memory_$Pointer$.offset| .cse2) (+ .cse4 4)))) (not (= .cse5 (select (select |#memory_$Pointer$.base| .cse2) 4))) (not (= .cse5 0)) (not (= 0 .cse3)) (not (= 0 .cse4)))))) (forall ((|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_2| Int) (|v_is_list_containing_x_#in~l.base_BEFORE_CALL_2| Int)) (= (select (select |#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_2|) (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_2| 4)) 0))) (or (forall ((v_prenex_4 Int)) (let ((.cse12 (select |#memory_$Pointer$.base| v_prenex_4)) (.cse13 (select |#memory_$Pointer$.offset| v_prenex_4))) (let ((.cse10 (select .cse13 0)) (.cse11 (select .cse13 4)) (.cse8 (select .cse12 4)) (.cse9 (select .cse12 0))) (or (not (= .cse8 0)) (< v_prenex_4 (+ .cse9 2)) (not (= .cse10 0)) (not (= 0 .cse11)) (not (= (select (select |#memory_$Pointer$.offset| .cse9) (+ .cse10 4)) .cse11)) (not (= .cse8 (select (select |#memory_$Pointer$.base| .cse9) 4))))))) (forall ((v_prenex_5 Int) (v_prenex_3 Int)) (= (select (select |#memory_$Pointer$.base| v_prenex_5) (+ v_prenex_3 4)) 0)))) (forall ((v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_6 Int)) (let ((.cse16 (select |#memory_$Pointer$.base| v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_6))) (let ((.cse15 (select .cse16 4)) (.cse14 (select .cse16 0))) (or (not (= (select (select |#memory_$Pointer$.base| .cse14) 4) .cse15)) (not (= 0 .cse15)) (= v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_6 0) (< v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_6 (+ .cse14 2))))))) (or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))) (or .cse17 (let ((.cse18 (select .cse20 .cse21))) (and (= |is_list_containing_x_#t~mem14.offset| .cse18) (or (not (= 0 .cse18)) (not (= 0 .cse19)))))) (= is_list_containing_x_~x.offset |is_list_containing_x_#in~x.offset|) (or (and (= |is_list_containing_x_#t~mem14.offset| .cse22) .cse1) (or (forall ((|v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_9| Int)) (let ((.cse26 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_9|) 4))) (let ((.cse23 (select |#memory_$Pointer$.offset| .cse26)) (.cse24 (select |#memory_$Pointer$.base| .cse26)) (.cse25 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_9|) 4))) (or (not (= 0 (select .cse23 4))) (not (= 0 (select .cse23 0))) (not (= (select .cse24 .cse25) |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_9|)) (= 0 .cse26) (< .cse26 (+ |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_9| 2)) (not (= 0 (select .cse24 4))) (not (= .cse25 0)))))) .cse27)) (or .cse27 .cse0 (forall ((|v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_2| Int)) (let ((.cse30 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_2|) 4))) (let ((.cse28 (select |#memory_$Pointer$.base| .cse30)) (.cse29 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_2|) 4)) (.cse31 (select |#memory_$Pointer$.offset| .cse30))) (or (not (= (select .cse28 .cse29) |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_2|)) (= 0 .cse30) (not (= (select .cse31 4) 0)) (< .cse30 (+ |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_2| 2)) (not (= 0 (select .cse28 4))) (not (= 0 .cse29)) (not (= (select .cse31 0) 0))))))) (= is_list_containing_x_~l.offset |is_list_containing_x_#in~l.offset|) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (or (or (and .cse1 .cse32) (and .cse1 .cse33)) (and (forall ((v_arrayElimCell_144 Int) (v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_21 Int) (v_arrayElimCell_138 Int)) (let ((.cse43 (select |#memory_$Pointer$.offset| v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_21))) (let ((.cse40 (select .cse43 0)) (.cse42 (select |#memory_$Pointer$.base| v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_21))) (let ((.cse34 (select |#memory_$Pointer$.base| v_arrayElimCell_144)) (.cse38 (select .cse42 4)) (.cse39 (select |#memory_$Pointer$.offset| v_arrayElimCell_144)) (.cse35 (+ v_arrayElimCell_138 4)) (.cse41 (select .cse43 4)) (.cse36 (select .cse42 0)) (.cse37 (+ .cse40 4))) (or (not (= 0 (select .cse34 .cse35))) (not (= (select (select |#memory_$Pointer$.base| .cse36) .cse37) .cse38)) (< v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_21 (+ .cse36 2)) (not (= .cse36 (select .cse34 v_arrayElimCell_138))) (not (= 0 .cse38)) (not (= 0 (select .cse39 v_arrayElimCell_138))) (= .cse36 v_arrayElimCell_144) (not (= (select .cse39 .cse35) 0)) (not (= .cse40 0)) (not (= .cse41 0)) (= v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_21 v_arrayElimCell_144) (not (= .cse41 (select (select |#memory_$Pointer$.offset| .cse36) .cse37)))))))) (forall ((v_prenex_104 Int) (v_arrayElimIndex_9 Int)) (let ((.cse52 (select |#memory_$Pointer$.base| v_prenex_104)) (.cse53 (select |#memory_$Pointer$.offset| v_prenex_104))) (let ((.cse46 (select .cse53 0)) (.cse44 (select .cse52 0))) (let ((.cse50 (+ v_arrayElimIndex_9 4)) (.cse47 (select |#memory_$Pointer$.offset| .cse44)) (.cse49 (select .cse53 4)) (.cse48 (select .cse52 4)) (.cse45 (select |#memory_$Pointer$.base| .cse44)) (.cse51 (+ .cse46 4))) (or (not (= .cse44 (select .cse45 v_arrayElimIndex_9))) (< v_prenex_104 (+ .cse44 2)) (not (= 0 .cse46)) (not (= (select .cse47 v_arrayElimIndex_9) 0)) (not (= .cse48 0)) (not (= 0 .cse49)) (not (= .cse48 (select .cse45 .cse50))) (not (= (select .cse47 .cse50) .cse49)) (not (= (select .cse47 .cse51) .cse49)) (not (= .cse48 (select .cse45 .cse51)))))))) (forall ((v_prenex_103 Int)) (let ((.cse62 (select |#memory_$Pointer$.base| v_prenex_103)) (.cse61 (select |#memory_$Pointer$.offset| v_prenex_103))) (let ((.cse55 (select .cse61 0)) (.cse54 (select .cse62 0))) (let ((.cse57 (select .cse62 4)) (.cse56 (select |#memory_$Pointer$.base| .cse54)) (.cse59 (+ .cse55 4)) (.cse58 (select |#memory_$Pointer$.offset| .cse54)) (.cse60 (select .cse61 4))) (or (< v_prenex_103 (+ .cse54 2)) (not (= 0 .cse55)) (not (= (select .cse56 8) 0)) (not (= .cse57 0)) (not (= (select .cse58 .cse59) .cse60)) (not (= .cse57 (select .cse56 .cse59))) (not (= 0 (select .cse58 8))) (not (= 0 .cse60))))))))) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|) (or .cse17 (= |is_list_containing_x_#t~mem14.base| .cse19))))))) [2019-01-14 15:49:44,389 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 584) no Hoare annotation was computed. [2019-01-14 15:49:44,389 INFO L448 ceAbstractionStarter]: For program point L584-1(line 584) no Hoare annotation was computed. [2019-01-14 15:49:44,389 INFO L448 ceAbstractionStarter]: For program point is_list_containing_xFINAL(lines 579 586) no Hoare annotation was computed. [2019-01-14 15:49:44,389 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 582) no Hoare annotation was computed. [2019-01-14 15:49:44,389 INFO L448 ceAbstractionStarter]: For program point is_list_containing_xEXIT(lines 579 586) no Hoare annotation was computed. [2019-01-14 15:49:44,404 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,407 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,408 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,408 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,408 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,409 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,409 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,409 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,410 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,411 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,412 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,412 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,412 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,412 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,413 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,413 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,413 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,413 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,414 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,414 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,414 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,415 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,416 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,416 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,416 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,416 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,421 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,421 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,421 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 15:49:44,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,437 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,437 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,437 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,437 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,438 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,438 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,438 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,438 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,439 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,440 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 15:49:44,443 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,443 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,461 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,461 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,462 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,462 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,462 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,462 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,463 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,463 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,463 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,463 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,464 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,483 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,483 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,483 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,484 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,484 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,484 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,485 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,485 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,485 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,486 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,487 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 15:49:44,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,493 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,493 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,493 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,494 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,496 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,498 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,499 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,499 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,499 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,499 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,500 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 15:49:44,511 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,514 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,515 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,515 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,516 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,516 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,516 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,517 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,517 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,518 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,518 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,519 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,519 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,521 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,521 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,521 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,522 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,522 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,522 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,523 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,523 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,524 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 15:49:44,524 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,524 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,524 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,525 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,534 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,534 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,535 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,535 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,535 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,535 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 15:49:44,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,543 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,543 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,543 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,552 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,553 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,553 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,553 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,554 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,554 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,559 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,559 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,560 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,560 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,561 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,561 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,561 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,561 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,562 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,562 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,562 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,563 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 15:49:44,563 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,563 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,563 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,564 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,564 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,564 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,564 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,565 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,565 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,565 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,565 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,576 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,576 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,576 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,576 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 15:49:44,576 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,577 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,577 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:49:44 BoogieIcfgContainer [2019-01-14 15:49:44,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:49:44,585 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:49:44,585 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:49:44,585 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:49:44,586 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:35:55" (3/4) ... [2019-01-14 15:49:44,590 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 15:49:44,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_list_containing_x [2019-01-14 15:49:44,611 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-01-14 15:49:44,611 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 15:49:44,613 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 15:49:44,652 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((list < unknown-#StackHeapBarrier-unknown && 0 == list) && list == tail) && \valid[list] == 1) && x == list) && list == tail) && x == list) || (((((((((((((((((((((0 == #memory_$Pointer$[n][n] && list == tail && \valid[list] == 1) && 0 == x) && \valid[n] == 1) && \valid[x] == 1) && !(0 == #memory_$Pointer$[x][0])) && list == n) && list + 2 <= x) && !(n == 0)) && 0 == x) && #memory_$Pointer$[x][x] == list) && tail == list) && tail + 2 <= n) && (\exists v_arrayElimCell_23 : int :: (((((#memory_$Pointer$[v_arrayElimCell_23][4] == 0 && #memory_$Pointer$[#memory_$Pointer$[v_arrayElimCell_23][0]][#memory_$Pointer$[v_arrayElimCell_23][0] + 4] == #memory_$Pointer$[v_arrayElimCell_23][4]) && 0 == #memory_$Pointer$[v_arrayElimCell_23][4]) && #memory_$Pointer$[v_arrayElimCell_23][0] == list) && list == #memory_$Pointer$[v_arrayElimCell_23][0]) && #memory_$Pointer$[v_arrayElimCell_23][4] == #memory_$Pointer$[list][list + 4]) && list + 2 <= v_arrayElimCell_23)) && 0 == #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4 := #memory_$Pointer$[x][x + 4]][list + 4]) && n == 0) && list + 1 <= unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[x][list] == list) && #memory_$Pointer$[x][4] == 0) && !(x == 0)) && x == x) [2019-01-14 15:49:44,675 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:49:44,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:49:44,676 INFO L168 Benchmark]: Toolchain (without parser) took 830403.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:49:44,681 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:49:44,681 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-14 15:49:44,681 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.20 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:49:44,682 INFO L168 Benchmark]: Boogie Preprocessor took 41.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:49:44,685 INFO L168 Benchmark]: RCFGBuilder took 600.11 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:49:44,686 INFO L168 Benchmark]: TraceAbstraction took 829006.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -3.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.1 MB). Peak memory consumption was 315.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:49:44,686 INFO L168 Benchmark]: Witness Printer took 90.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:49:44,692 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 601.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -174.1 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.20 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 600.11 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 829006.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -3.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.1 MB). Peak memory consumption was 315.8 MB. Max. memory is 11.5 GB. * Witness Printer took 90.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - 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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] - 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_arrayElimCell_23,QUANTIFIED] - 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_arrayElimCell_23,QUANTIFIED] - 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_arrayElimCell_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] - 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_arrayElimCell_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] - 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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] - 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_arrayElimCell_23,QUANTIFIED] - 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_arrayElimCell_23,QUANTIFIED] - 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_arrayElimCell_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] - 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_arrayElimCell_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] - 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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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_$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_$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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 #StackHeapBarrier - 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_$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_$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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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_$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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 #StackHeapBarrier - 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_$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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 593]: Loop Invariant [2019-01-14 15:49:44,705 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,705 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,706 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,709 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,709 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,710 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,710 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,710 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,710 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,710 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,711 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,711 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,711 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,711 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,711 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,712 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,716 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,716 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,716 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,717 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,717 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,717 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,717 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,718 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,718 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,718 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,718 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,718 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,721 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,722 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,722 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,722 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,722 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,723 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 15:49:44,723 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,723 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,723 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,723 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,729 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,729 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,729 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,729 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,730 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,731 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,732 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,733 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 15:49:44,734 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,735 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,735 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,735 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,736 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,736 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,736 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,736 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,736 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,737 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,737 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,737 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,737 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,737 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,739 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,739 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,739 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,739 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,739 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,740 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,740 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,740 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,740 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,740 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 15:49:44,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((((((((0 == #memory_$Pointer$[x][4] && \valid[n] == 1) && \valid[x] == 1) && (((((((((((n == #memory_$Pointer$[list][list + 4] && list == tail) && #memory_$Pointer$[x][0] == list) && 0 == x) && 0 == #memory_$Pointer$[n][n + 4]) && tail < unknown-#StackHeapBarrier-unknown) && !(0 == #memory_$Pointer$[n][n])) && list + 2 <= x) && !(n == 0)) && tail == list) && tail + 2 <= n) && \valid[list] == 1) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[#memory_$Pointer$[list][list + 4]][list] == list) && #memory_$Pointer$[#memory_$Pointer$[x][0]][list + 4] == 0) && 0 == #memory_$Pointer$[n][tail]) && n == #memory_$Pointer$[#memory_$Pointer$[n][n]][list + 4]) && #memory_$Pointer$[x][0] == list) && !(x == 0)) && #memory_$Pointer$[x][4] == 0) && 0 == #memory_$Pointer$[n][n + 4]) || (((((((((((((((list + 2 <= n && #memory_$Pointer$[#memory_$Pointer$[list][list + 4]][list] == list) && n == #memory_$Pointer$[list][list + 4]) && 0 == #memory_$Pointer$[#memory_$Pointer$[list][list + 4]][n + 4]) && !(x == #memory_$Pointer$[list][list + 4]) && 0 == list && list == x) && n == #memory_$Pointer$[#memory_$Pointer$[n][n]][list + 4]) && #memory_$Pointer$[n][n] == list) && 0 == #memory_$Pointer$[n][n + 4]) || ((!(x == #memory_$Pointer$[list][list + 4]) && 0 == list && list == x) && 0 == #memory_$Pointer$[list][list + 4])) && 0 == #memory_$Pointer$[x][list + 4]) && tail == list) && \valid[x] == 1) && list == tail) && list + 1 <= unknown-#StackHeapBarrier-unknown) && x == list) && !(x == 0)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant [2019-01-14 15:49:44,750 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,751 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,751 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,751 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,752 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,752 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,752 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,753 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,753 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,754 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,754 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,754 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,755 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,755 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,755 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,756 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,756 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,756 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,756 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,756 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 15:49:44,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 15:49:44,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,765 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,767 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,767 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,767 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,768 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,768 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,768 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,769 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,769 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,770 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,770 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,770 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,771 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_23,QUANTIFIED] [2019-01-14 15:49:44,771 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,771 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,772 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,793 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,793 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,793 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 15:49:44,793 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 15:49:44,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 15:49:44,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,797 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 15:49:44,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 15:49:44,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((list < unknown-#StackHeapBarrier-unknown && 0 == list) && list == tail) && \valid[list] == 1) && x == list) && list == tail) && x == list) || (((((((((((((((((((((0 == #memory_$Pointer$[n][n] && list == tail && \valid[list] == 1) && 0 == x) && \valid[n] == 1) && \valid[x] == 1) && !(0 == #memory_$Pointer$[x][0])) && list == n) && list + 2 <= x) && !(n == 0)) && 0 == x) && #memory_$Pointer$[x][x] == list) && tail == list) && tail + 2 <= n) && (\exists v_arrayElimCell_23 : int :: (((((#memory_$Pointer$[v_arrayElimCell_23][4] == 0 && #memory_$Pointer$[#memory_$Pointer$[v_arrayElimCell_23][0]][#memory_$Pointer$[v_arrayElimCell_23][0] + 4] == #memory_$Pointer$[v_arrayElimCell_23][4]) && 0 == #memory_$Pointer$[v_arrayElimCell_23][4]) && #memory_$Pointer$[v_arrayElimCell_23][0] == list) && list == #memory_$Pointer$[v_arrayElimCell_23][0]) && #memory_$Pointer$[v_arrayElimCell_23][4] == #memory_$Pointer$[list][list + 4]) && list + 2 <= v_arrayElimCell_23)) && 0 == #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4 := #memory_$Pointer$[x][x + 4]][list + 4]) && n == 0) && list + 1 <= unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[x][list] == list) && #memory_$Pointer$[x][4] == 0) && !(x == 0)) && x == x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 2 error locations. SAFE Result, 828.7s OverallTime, 24 OverallIterations, 8 TraceHistogramMax, 467.8s AutomataDifference, 0.0s DeadEndRemovalTime, 115.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 985 SDtfs, 3752 SDslu, 6376 SDs, 0 SdLazy, 9049 SolverSat, 1878 SolverUnsat, 43 SolverUnknown, 0 SolverNotchecked, 106.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1411 GetRequests, 612 SyntacticMatches, 36 SemanticMatches, 763 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11595 ImplicationChecksByTransitivity, 560.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=17, 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.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 512 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 203 PreInvPairs, 236 NumberOfFragments, 2253 HoareAnnotationTreeSize, 203 FomulaSimplifications, 3407127 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1148552 FormulaSimplificationTreeSizeReductionInter, 113.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 243.1s InterpolantComputationTime, 1691 NumberOfCodeBlocks, 1666 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1652 ConstructedInterpolants, 295 QuantifiedInterpolants, 4233200 SizeOfPredicates, 312 NumberOfNonLiveVariables, 3449 ConjunctsInSsa, 762 ConjunctsInUnsatCore, 39 InterpolantComputations, 9 PerfectInterpolantSequences, 1051/1590 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...