./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/heap-data/process_queue_true-unreach-call.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-data/process_queue_true-unreach-call.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 17ca2c4cfd3f3304aa1a07a698354da791c69868 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-12 10:34:00,505 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 10:34:00,507 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 10:34:00,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 10:34:00,519 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 10:34:00,520 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 10:34:00,521 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 10:34:00,527 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 10:34:00,530 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 10:34:00,532 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 10:34:00,534 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 10:34:00,535 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 10:34:00,535 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 10:34:00,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 10:34:00,543 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 10:34:00,544 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 10:34:00,547 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 10:34:00,552 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 10:34:00,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 10:34:00,558 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 10:34:00,560 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 10:34:00,565 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 10:34:00,571 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 10:34:00,572 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 10:34:00,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 10:34:00,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 10:34:00,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 10:34:00,578 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 10:34:00,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 10:34:00,583 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 10:34:00,583 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 10:34:00,584 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 10:34:00,584 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 10:34:00,584 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 10:34:00,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 10:34:00,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 10:34:00,591 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 10:34:00,619 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 10:34:00,620 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 10:34:00,622 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 10:34:00,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 10:34:00,624 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 10:34:00,624 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 10:34:00,624 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 10:34:00,624 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 10:34:00,625 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 10:34:00,625 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 10:34:00,625 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 10:34:00,625 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 10:34:00,625 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 10:34:00,625 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 10:34:00,626 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 10:34:00,626 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 10:34:00,626 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 10:34:00,626 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 10:34:00,626 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 10:34:00,626 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 10:34:00,627 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 10:34:00,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 10:34:00,627 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 10:34:00,627 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 10:34:00,627 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 10:34:00,627 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 10:34:00,631 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 10:34:00,632 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 10:34:00,632 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 -> 17ca2c4cfd3f3304aa1a07a698354da791c69868 [2019-01-12 10:34:00,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 10:34:00,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 10:34:00,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 10:34:00,718 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 10:34:00,719 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 10:34:00,720 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/heap-data/process_queue_true-unreach-call.i [2019-01-12 10:34:00,784 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7995d0373/d2162c3fa6204714b015bd71e1452536/FLAG3e358c9c3 [2019-01-12 10:34:01,343 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 10:34:01,344 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/heap-data/process_queue_true-unreach-call.i [2019-01-12 10:34:01,362 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7995d0373/d2162c3fa6204714b015bd71e1452536/FLAG3e358c9c3 [2019-01-12 10:34:01,601 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7995d0373/d2162c3fa6204714b015bd71e1452536 [2019-01-12 10:34:01,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 10:34:01,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 10:34:01,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 10:34:01,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 10:34:01,611 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 10:34:01,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:34:01" (1/1) ... [2019-01-12 10:34:01,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44233d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:34:01, skipping insertion in model container [2019-01-12 10:34:01,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 10:34:01" (1/1) ... [2019-01-12 10:34:01,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 10:34:01,673 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 10:34:02,030 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:34:02,054 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 10:34:02,221 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 10:34:02,283 INFO L195 MainTranslator]: Completed translation [2019-01-12 10:34:02,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:34:02 WrapperNode [2019-01-12 10:34:02,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 10:34:02,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 10:34:02,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 10:34:02,285 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 10:34:02,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:34:02" (1/1) ... [2019-01-12 10:34:02,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:34:02" (1/1) ... [2019-01-12 10:34:02,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 10:34:02,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 10:34:02,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 10:34:02,346 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 10:34:02,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:34:02" (1/1) ... [2019-01-12 10:34:02,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:34:02" (1/1) ... [2019-01-12 10:34:02,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:34:02" (1/1) ... [2019-01-12 10:34:02,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:34:02" (1/1) ... [2019-01-12 10:34:02,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:34:02" (1/1) ... [2019-01-12 10:34:02,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:34:02" (1/1) ... [2019-01-12 10:34:02,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:34:02" (1/1) ... [2019-01-12 10:34:02,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 10:34:02,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 10:34:02,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 10:34:02,400 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 10:34:02,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:34:02" (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-12 10:34:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 10:34:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 10:34:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-12 10:34:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 10:34:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-12 10:34:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-12 10:34:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 10:34:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-12 10:34:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 10:34:02,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 10:34:02,971 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 10:34:02,972 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-12 10:34:02,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:34:02 BoogieIcfgContainer [2019-01-12 10:34:02,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 10:34:02,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 10:34:02,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 10:34:02,978 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 10:34:02,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 10:34:01" (1/3) ... [2019-01-12 10:34:02,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283eb75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:34:02, skipping insertion in model container [2019-01-12 10:34:02,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 10:34:02" (2/3) ... [2019-01-12 10:34:02,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283eb75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 10:34:02, skipping insertion in model container [2019-01-12 10:34:02,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:34:02" (3/3) ... [2019-01-12 10:34:02,983 INFO L112 eAbstractionObserver]: Analyzing ICFG process_queue_true-unreach-call.i [2019-01-12 10:34:02,994 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 10:34:03,005 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 10:34:03,023 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 10:34:03,051 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 10:34:03,052 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 10:34:03,052 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 10:34:03,052 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 10:34:03,053 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 10:34:03,053 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 10:34:03,053 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 10:34:03,053 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 10:34:03,054 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 10:34:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-01-12 10:34:03,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 10:34:03,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:34:03,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:34:03,077 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:34:03,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:34:03,082 INFO L82 PathProgramCache]: Analyzing trace with hash 765962421, now seen corresponding path program 1 times [2019-01-12 10:34:03,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:34:03,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:34:03,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:03,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:34:03,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:34:03,278 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-12 10:34:03,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:34:03,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 10:34:03,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 10:34:03,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 10:34:03,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 10:34:03,299 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-01-12 10:34:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:34:03,375 INFO L93 Difference]: Finished difference Result 49 states and 72 transitions. [2019-01-12 10:34:03,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 10:34:03,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-12 10:34:03,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:34:03,391 INFO L225 Difference]: With dead ends: 49 [2019-01-12 10:34:03,391 INFO L226 Difference]: Without dead ends: 22 [2019-01-12 10:34:03,395 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-12 10:34:03,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-12 10:34:03,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-12 10:34:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-12 10:34:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-01-12 10:34:03,437 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 10 [2019-01-12 10:34:03,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:34:03,437 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-01-12 10:34:03,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 10:34:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2019-01-12 10:34:03,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 10:34:03,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:34:03,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:34:03,439 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:34:03,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:34:03,439 INFO L82 PathProgramCache]: Analyzing trace with hash 708704119, now seen corresponding path program 1 times [2019-01-12 10:34:03,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:34:03,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:34:03,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:03,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:34:03,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:34:03,896 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-12 10:34:03,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:34:03,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 10:34:03,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 10:34:03,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 10:34:03,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 10:34:03,900 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 6 states. [2019-01-12 10:34:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:34:04,390 INFO L93 Difference]: Finished difference Result 91 states and 124 transitions. [2019-01-12 10:34:04,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 10:34:04,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-12 10:34:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:34:04,394 INFO L225 Difference]: With dead ends: 91 [2019-01-12 10:34:04,394 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 10:34:04,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 10:34:04,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 10:34:04,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2019-01-12 10:34:04,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 10:34:04,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2019-01-12 10:34:04,408 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 10 [2019-01-12 10:34:04,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:34:04,408 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2019-01-12 10:34:04,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 10:34:04,409 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2019-01-12 10:34:04,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 10:34:04,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:34:04,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:34:04,410 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:34:04,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:34:04,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1941169483, now seen corresponding path program 1 times [2019-01-12 10:34:04,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:34:04,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:34:04,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:04,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:34:04,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:34:04,477 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-12 10:34:04,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:34:04,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 10:34:04,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 10:34:04,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 10:34:04,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:34:04,480 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand 4 states. [2019-01-12 10:34:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:34:04,584 INFO L93 Difference]: Finished difference Result 121 states and 167 transitions. [2019-01-12 10:34:04,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 10:34:04,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-12 10:34:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:34:04,587 INFO L225 Difference]: With dead ends: 121 [2019-01-12 10:34:04,587 INFO L226 Difference]: Without dead ends: 73 [2019-01-12 10:34:04,588 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-12 10:34:04,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-12 10:34:04,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-01-12 10:34:04,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 10:34:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2019-01-12 10:34:04,601 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 11 [2019-01-12 10:34:04,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:34:04,601 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2019-01-12 10:34:04,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 10:34:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2019-01-12 10:34:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 10:34:04,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:34:04,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:34:04,603 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:34:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:34:04,604 INFO L82 PathProgramCache]: Analyzing trace with hash 578790451, now seen corresponding path program 1 times [2019-01-12 10:34:04,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:34:04,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:34:04,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:04,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:34:04,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:34:04,727 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-12 10:34:04,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:34:04,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 10:34:04,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 10:34:04,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 10:34:04,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:34:04,729 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand 4 states. [2019-01-12 10:34:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:34:04,904 INFO L93 Difference]: Finished difference Result 145 states and 193 transitions. [2019-01-12 10:34:04,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 10:34:04,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-12 10:34:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:34:04,911 INFO L225 Difference]: With dead ends: 145 [2019-01-12 10:34:04,913 INFO L226 Difference]: Without dead ends: 76 [2019-01-12 10:34:04,914 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-12 10:34:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-12 10:34:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2019-01-12 10:34:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-12 10:34:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2019-01-12 10:34:04,942 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 11 [2019-01-12 10:34:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:34:04,942 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2019-01-12 10:34:04,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 10:34:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2019-01-12 10:34:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 10:34:04,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:34:04,944 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:34:04,945 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:34:04,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:34:04,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1050906354, now seen corresponding path program 1 times [2019-01-12 10:34:04,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:34:04,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:34:04,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:04,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:34:04,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:34:05,463 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2019-01-12 10:34:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:34:05,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:34:05,506 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-12 10:34:05,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:34:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:34:05,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:34:05,646 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:34:05,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:34:05,754 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-12 10:34:05,791 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-12 10:34:05,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:05,974 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 26 treesize of output 27 [2019-01-12 10:34:05,981 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 15 treesize of output 18 [2019-01-12 10:34:05,992 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 18 treesize of output 7 [2019-01-12 10:34:05,993 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:06,007 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:06,038 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:06,147 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:34:06,175 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:34:06,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:06,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:06,356 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 50 treesize of output 61 [2019-01-12 10:34:06,381 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 47 treesize of output 52 [2019-01-12 10:34:06,382 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:06,542 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 42 treesize of output 41 [2019-01-12 10:34:06,544 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:06,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:06,720 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:34:06,723 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 39 [2019-01-12 10:34:06,732 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 30 [2019-01-12 10:34:06,733 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:06,752 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:06,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:06,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:06,888 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:34:06,905 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 40 treesize of output 41 [2019-01-12 10:34:06,928 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 26 treesize of output 21 [2019-01-12 10:34:06,929 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:06,949 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:06,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:07,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:07,011 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:34:07,026 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 37 treesize of output 38 [2019-01-12 10:34:07,032 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 23 treesize of output 19 [2019-01-12 10:34:07,033 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:07,051 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:07,073 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:07,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:07,135 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 109 treesize of output 58 [2019-01-12 10:34:07,171 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 11 treesize of output 14 [2019-01-12 10:34:07,213 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-12 10:34:07,215 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:07,283 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:07,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:07,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:07,399 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 57 treesize of output 66 [2019-01-12 10:34:07,466 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 52 treesize of output 59 [2019-01-12 10:34:07,467 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:07,579 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 49 treesize of output 48 [2019-01-12 10:34:07,581 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:07,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:07,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:07,676 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 48 treesize of output 49 [2019-01-12 10:34:07,702 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 23 treesize of output 19 [2019-01-12 10:34:07,704 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:07,721 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:07,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:07,790 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 51 treesize of output 46 [2019-01-12 10:34:07,803 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 30 [2019-01-12 10:34:07,804 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:07,819 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:07,880 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:07,889 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:07,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:34:07,918 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 8 variables, input treesize:156, output treesize:45 [2019-01-12 10:34:08,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:08,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:08,012 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:34:08,022 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 0 case distinctions, treesize of input 53 treesize of output 54 [2019-01-12 10:34:08,029 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 34 treesize of output 23 [2019-01-12 10:34:08,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:08,101 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:34:08,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-12 10:34:08,103 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:08,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:08,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:08,140 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-12 10:34:08,161 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:34:08,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-12 10:34:08,163 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:08,174 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-12 10:34:08,175 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:08,178 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:08,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:08,186 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:76, output treesize:7 [2019-01-12 10:34:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:34:08,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:34:08,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-01-12 10:34:08,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 10:34:08,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 10:34:08,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=64, Unknown=4, NotChecked=0, Total=90 [2019-01-12 10:34:08,222 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand 10 states. [2019-01-12 10:34:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:34:09,107 INFO L93 Difference]: Finished difference Result 164 states and 218 transitions. [2019-01-12 10:34:09,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 10:34:09,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-01-12 10:34:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:34:09,111 INFO L225 Difference]: With dead ends: 164 [2019-01-12 10:34:09,111 INFO L226 Difference]: Without dead ends: 105 [2019-01-12 10:34:09,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=151, Unknown=4, NotChecked=0, Total=210 [2019-01-12 10:34:09,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-12 10:34:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2019-01-12 10:34:09,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-12 10:34:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2019-01-12 10:34:09,128 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 13 [2019-01-12 10:34:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:34:09,129 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2019-01-12 10:34:09,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 10:34:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2019-01-12 10:34:09,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 10:34:09,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:34:09,133 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:34:09,133 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:34:09,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:34:09,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2100423790, now seen corresponding path program 1 times [2019-01-12 10:34:09,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:34:09,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:34:09,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:09,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:34:09,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:34:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:34:09,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 10:34:09,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 10:34:09,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 10:34:09,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 10:34:09,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 10:34:09,240 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand 4 states. [2019-01-12 10:34:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:34:09,458 INFO L93 Difference]: Finished difference Result 161 states and 209 transitions. [2019-01-12 10:34:09,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 10:34:09,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-01-12 10:34:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:34:09,460 INFO L225 Difference]: With dead ends: 161 [2019-01-12 10:34:09,460 INFO L226 Difference]: Without dead ends: 104 [2019-01-12 10:34:09,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 10:34:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-12 10:34:09,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2019-01-12 10:34:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-12 10:34:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2019-01-12 10:34:09,476 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 17 [2019-01-12 10:34:09,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:34:09,477 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2019-01-12 10:34:09,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 10:34:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2019-01-12 10:34:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 10:34:09,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:34:09,478 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 10:34:09,478 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:34:09,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:34:09,478 INFO L82 PathProgramCache]: Analyzing trace with hash 32961051, now seen corresponding path program 1 times [2019-01-12 10:34:09,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:34:09,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:34:09,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:09,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:34:09,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:34:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 10:34:09,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:34:09,762 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-12 10:34:09,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:34:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:34:09,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:34:09,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:34:09,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:34:09,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 43 treesize of output 30 [2019-01-12 10:34:09,955 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 14 treesize of output 17 [2019-01-12 10:34:09,987 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 17 treesize of output 19 [2019-01-12 10:34:10,074 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 19 treesize of output 22 [2019-01-12 10:34:10,075 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,152 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,167 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:10,216 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 37 treesize of output 38 [2019-01-12 10:34:10,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-12 10:34:10,222 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,236 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:10,293 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 35 treesize of output 28 [2019-01-12 10:34:10,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-12 10:34:10,313 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:10,475 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 23 treesize of output 22 [2019-01-12 10:34:10,484 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 18 treesize of output 7 [2019-01-12 10:34:10,485 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,494 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,498 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:10,529 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 35 treesize of output 28 [2019-01-12 10:34:10,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-12 10:34:10,534 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:10,555 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 23 treesize of output 22 [2019-01-12 10:34:10,559 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 18 treesize of output 7 [2019-01-12 10:34:10,560 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,567 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,571 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,604 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:118, output treesize:31 [2019-01-12 10:34:10,626 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 28 treesize of output 22 [2019-01-12 10:34:10,629 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 22 treesize of output 13 [2019-01-12 10:34:10,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 10:34:10,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-12 10:34:10,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,657 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-12 10:34:10,658 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:11 [2019-01-12 10:34:10,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 10:34:10,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-12 10:34:10,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:10,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-12 10:34:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 10:34:10,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:34:10,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-01-12 10:34:10,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 10:34:10,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 10:34:10,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-12 10:34:10,715 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 11 states. [2019-01-12 10:34:11,262 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-12 10:34:11,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:34:11,781 INFO L93 Difference]: Finished difference Result 239 states and 308 transitions. [2019-01-12 10:34:11,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 10:34:11,785 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-12 10:34:11,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:34:11,786 INFO L225 Difference]: With dead ends: 239 [2019-01-12 10:34:11,786 INFO L226 Difference]: Without dead ends: 171 [2019-01-12 10:34:11,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-01-12 10:34:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-12 10:34:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2019-01-12 10:34:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-01-12 10:34:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 204 transitions. [2019-01-12 10:34:11,826 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 204 transitions. Word has length 20 [2019-01-12 10:34:11,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:34:11,830 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 204 transitions. [2019-01-12 10:34:11,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 10:34:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 204 transitions. [2019-01-12 10:34:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 10:34:11,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 10:34:11,831 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-12 10:34:11,831 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 10:34:11,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 10:34:11,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1600928790, now seen corresponding path program 2 times [2019-01-12 10:34:11,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 10:34:11,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 10:34:11,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:11,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 10:34:11,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 10:34:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 10:34:12,492 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:34:12,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 10:34:12,492 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-12 10:34:12,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 10:34:12,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 10:34:12,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 10:34:12,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 10:34:12,749 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-12 10:34:12,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:12,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:12,794 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 35 treesize of output 28 [2019-01-12 10:34:12,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-12 10:34:12,815 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:12,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:12,838 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 23 treesize of output 22 [2019-01-12 10:34:12,848 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 18 treesize of output 7 [2019-01-12 10:34:12,849 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:12,857 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:12,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:12,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:12,893 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 35 treesize of output 32 [2019-01-12 10:34:12,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2019-01-12 10:34:12,899 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:12,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:12,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-12 10:34:12,921 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 7 [2019-01-12 10:34:12,921 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:12,926 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:12,929 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-12 10:34:12,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:12,943 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:86, output treesize:30 [2019-01-12 10:34:13,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:13,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:13,123 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 15 treesize of output 8 [2019-01-12 10:34:13,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:13,464 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 39 treesize of output 44 [2019-01-12 10:34:13,480 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 18 treesize of output 21 [2019-01-12 10:34:13,505 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 21 treesize of output 23 [2019-01-12 10:34:13,569 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 23 treesize of output 15 [2019-01-12 10:34:13,569 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:13,613 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:13,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:13,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:13,930 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-12 10:34:13,944 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:34:14,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:14,135 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 50 treesize of output 51 [2019-01-12 10:34:14,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-12 10:34:14,142 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:14,197 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:14,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:14,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 73 [2019-01-12 10:34:14,413 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 24 treesize of output 22 [2019-01-12 10:34:14,414 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:14,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:14,473 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 22 treesize of output 20 [2019-01-12 10:34:14,480 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 10 treesize of output 8 [2019-01-12 10:34:14,481 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-12 10:34:14,518 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-12 10:34:14,519 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:14,538 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:14,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:14,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:14,598 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 53 treesize of output 48 [2019-01-12 10:34:14,604 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 37 treesize of output 30 [2019-01-12 10:34:14,606 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:34:14,638 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:34:14,665 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:34:14,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:14,762 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 36 treesize of output 41 [2019-01-12 10:34:14,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2019-01-12 10:34:14,772 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:14,787 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:14,848 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:34:14,854 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:34:14,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:14,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:14,925 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 43 treesize of output 60 [2019-01-12 10:34:14,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-12 10:34:14,930 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:14,945 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:14,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:15,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 67 [2019-01-12 10:34:15,009 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 32 treesize of output 34 [2019-01-12 10:34:15,009 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:15,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:15,040 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 34 treesize of output 39 [2019-01-12 10:34:15,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 10:34:15,046 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:15,054 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:15,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:15,110 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 54 treesize of output 44 [2019-01-12 10:34:15,129 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 25 [2019-01-12 10:34:15,129 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:15,201 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 18 treesize of output 23 [2019-01-12 10:34:15,201 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:15,209 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:15,221 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:15,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:34:15,257 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 12 variables, input treesize:222, output treesize:53 [2019-01-12 10:34:15,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:15,399 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2019-01-12 10:34:15,403 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 44 treesize of output 34 [2019-01-12 10:34:15,404 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 10:34:15,426 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-12 10:34:15,426 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:15,468 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-12 10:34:15,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 10:34:15,490 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 28 treesize of output 24 [2019-01-12 10:34:15,497 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 10:34:15,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 10:34:15,498 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:15,510 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-12 10:34:15,511 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:15,514 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 10:34:15,525 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-12 10:34:15,526 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:82, output treesize:11 [2019-01-12 10:34:15,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-01-12 10:34:15,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-12 10:34:15,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:15,573 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 10 treesize of output 8 [2019-01-12 10:34:15,573 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 10:34:15,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-12 10:34:15,580 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-12 10:34:15,581 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-01-12 10:34:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 10:34:15,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 10:34:15,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2019-01-12 10:34:15,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 10:34:15,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 10:34:15,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=255, Unknown=4, NotChecked=0, Total=306 [2019-01-12 10:34:15,604 INFO L87 Difference]: Start difference. First operand 160 states and 204 transitions. Second operand 18 states. [2019-01-12 10:34:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 10:34:37,294 INFO L93 Difference]: Finished difference Result 421 states and 564 transitions. [2019-01-12 10:34:37,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 10:34:37,296 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2019-01-12 10:34:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 10:34:37,296 INFO L225 Difference]: With dead ends: 421 [2019-01-12 10:34:37,297 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 10:34:37,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=382, Invalid=1505, Unknown=5, NotChecked=0, Total=1892 [2019-01-12 10:34:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 10:34:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 10:34:37,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 10:34:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 10:34:37,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-01-12 10:34:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 10:34:37,301 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 10:34:37,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 10:34:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 10:34:37,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 10:34:37,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 10:34:37,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 10:34:37,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 10:34:37,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 10:34:37,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 10:34:37,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 10:34:37,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 10:34:37,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 10:34:37,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 10:34:37,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 10:34:37,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 10:34:37,927 WARN L181 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 14 [2019-01-12 10:34:38,275 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 10 [2019-01-12 10:34:38,380 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 14 [2019-01-12 10:34:38,513 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 25 [2019-01-12 10:34:38,516 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 580) no Hoare annotation was computed. [2019-01-12 10:34:38,517 INFO L448 ceAbstractionStarter]: For program point L572-1(lines 572 580) no Hoare annotation was computed. [2019-01-12 10:34:38,517 INFO L448 ceAbstractionStarter]: For program point L601(lines 601 605) no Hoare annotation was computed. [2019-01-12 10:34:38,517 INFO L448 ceAbstractionStarter]: For program point L601-2(lines 601 605) no Hoare annotation was computed. [2019-01-12 10:34:38,517 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-01-12 10:34:38,517 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 10:34:38,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 10:34:38,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 10:34:38,517 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 607) no Hoare annotation was computed. [2019-01-12 10:34:38,518 INFO L444 ceAbstractionStarter]: At program point L594-3(lines 594 607) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_main_~#queue~0.offset|)) (.cse1 (< |ULTIMATE.start_main_~#queue~0.base| |#StackHeapBarrier|))) (or (and .cse0 (= 1 ULTIMATE.start_main_~next_time~0) (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#queue~0.base|) |ULTIMATE.start_main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#queue~0.base|) |ULTIMATE.start_main_~#queue~0.offset|)) .cse1) (and .cse0 (= ULTIMATE.start_check_queue_~n~0.offset 0) (= ULTIMATE.start_check_queue_~n~0.base 0) (<= 1 ULTIMATE.start_main_~next_time~0) .cse1))) [2019-01-12 10:34:38,518 INFO L448 ceAbstractionStarter]: For program point L594-4(lines 594 607) no Hoare annotation was computed. [2019-01-12 10:34:38,518 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 590) no Hoare annotation was computed. [2019-01-12 10:34:38,518 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 10:34:38,518 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 577) no Hoare annotation was computed. [2019-01-12 10:34:38,518 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-01-12 10:34:38,518 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-01-12 10:34:38,518 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-12 10:34:38,519 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 608) no Hoare annotation was computed. [2019-01-12 10:34:38,519 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 589) no Hoare annotation was computed. [2019-01-12 10:34:38,519 INFO L444 ceAbstractionStarter]: At program point L587-3(lines 587 589) the Hoare annotation is: (and (= 0 |ULTIMATE.start_main_~#queue~0.offset|) (<= 1 ULTIMATE.start_main_~next_time~0) (< |ULTIMATE.start_main_~#queue~0.base| |#StackHeapBarrier|)) [2019-01-12 10:34:38,519 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 589) no Hoare annotation was computed. [2019-01-12 10:34:38,519 INFO L444 ceAbstractionStarter]: At program point L571-2(lines 571 583) the Hoare annotation is: (and (= 0 |ULTIMATE.start_main_~#queue~0.offset|) (<= 2 ULTIMATE.start_main_~next_time~0) (= ULTIMATE.start_check_queue_~n~0.offset 0) (= ULTIMATE.start_check_queue_~n~0.base 0) (< |ULTIMATE.start_main_~#queue~0.base| |#StackHeapBarrier|)) [2019-01-12 10:34:38,519 INFO L448 ceAbstractionStarter]: For program point L571-3(lines 571 583) no Hoare annotation was computed. [2019-01-12 10:34:38,519 INFO L448 ceAbstractionStarter]: For program point L588(lines 588 589) no Hoare annotation was computed. [2019-01-12 10:34:38,520 INFO L444 ceAbstractionStarter]: At program point L584(lines 567 585) the Hoare annotation is: (and (= 0 |ULTIMATE.start_main_~#queue~0.offset|) (<= 2 ULTIMATE.start_main_~next_time~0) (= ULTIMATE.start_check_queue_~n~0.offset 0) (= ULTIMATE.start_check_queue_~n~0.base 0) (< |ULTIMATE.start_main_~#queue~0.base| |#StackHeapBarrier|)) [2019-01-12 10:34:38,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,533 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,535 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,538 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 10:34:38,538 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 10:34:38,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:34:38,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:34:38,540 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,541 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 10:34:38,541 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 10:34:38,543 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:34:38,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:34:38,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 10:34:38 BoogieIcfgContainer [2019-01-12 10:34:38,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 10:34:38,548 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 10:34:38,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 10:34:38,549 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 10:34:38,549 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 10:34:02" (3/4) ... [2019-01-12 10:34:38,555 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 10:34:38,568 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-01-12 10:34:38,568 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 10:34:38,569 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 10:34:38,647 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 10:34:38,647 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 10:34:38,648 INFO L168 Benchmark]: Toolchain (without parser) took 37042.48 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.2 MB). Free memory was 950.0 MB in the beginning and 877.8 MB in the end (delta: 72.3 MB). Peak memory consumption was 399.4 MB. Max. memory is 11.5 GB. [2019-01-12 10:34:38,649 INFO L168 Benchmark]: CDTParser took 0.50 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-12 10:34:38,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-01-12 10:34:38,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 10:34:38,650 INFO L168 Benchmark]: Boogie Preprocessor took 51.19 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-12 10:34:38,651 INFO L168 Benchmark]: RCFGBuilder took 574.79 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: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-01-12 10:34:38,651 INFO L168 Benchmark]: TraceAbstraction took 35572.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 887.2 MB in the end (delta: 202.9 MB). Peak memory consumption was 387.5 MB. Max. memory is 11.5 GB. [2019-01-12 10:34:38,651 INFO L168 Benchmark]: Witness Printer took 98.81 ms. Allocated memory is still 1.4 GB. Free memory was 887.2 MB in the beginning and 877.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-01-12 10:34:38,657 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.50 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 676.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.19 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. * RCFGBuilder took 574.79 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: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35572.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 887.2 MB in the end (delta: 202.9 MB). Peak memory consumption was 387.5 MB. Max. memory is 11.5 GB. * Witness Printer took 98.81 ms. Allocated memory is still 1.4 GB. Free memory was 887.2 MB in the beginning and 877.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 #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 #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 589]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 571]: Loop Invariant [2019-01-12 10:34:38,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,664 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((0 == queue && 2 <= next_time) && n == 0) && n == 0) && queue < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 567]: Loop Invariant [2019-01-12 10:34:38,664 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((0 == queue && 2 <= next_time) && n == 0) && n == 0) && queue < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 587]: Loop Invariant [2019-01-12 10:34:38,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (0 == queue && 1 <= next_time) && queue < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 594]: Loop Invariant [2019-01-12 10:34:38,666 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 10:34:38,666 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 10:34:38,667 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:34:38,667 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:34:38,667 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,667 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,668 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-12 10:34:38,668 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-12 10:34:38,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:34:38,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-12 10:34:38,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-12 10:34:38,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((0 == queue && 1 == next_time) && 0 == #memory_$Pointer$[queue][queue]) && 0 == #memory_$Pointer$[queue][queue]) && queue < unknown-#StackHeapBarrier-unknown) || ((((0 == queue && n == 0) && n == 0) && 1 <= next_time) && queue < unknown-#StackHeapBarrier-unknown) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. SAFE Result, 35.4s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 24.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 257 SDtfs, 658 SDslu, 918 SDs, 0 SdLazy, 891 SolverSat, 125 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 21.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=7, 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 89 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 102 NumberOfFragments, 83 HoareAnnotationTreeSize, 4 FomulaSimplifications, 11853 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1281 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 160 ConstructedInterpolants, 9 QuantifiedInterpolants, 43749 SizeOfPredicates, 97 NumberOfNonLiveVariables, 465 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 22/58 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...