./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-14 16:49:31,399 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 16:49:31,400 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 16:49:31,422 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 16:49:31,423 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 16:49:31,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 16:49:31,428 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 16:49:31,431 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 16:49:31,435 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 16:49:31,436 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 16:49:31,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 16:49:31,438 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 16:49:31,440 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 16:49:31,441 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 16:49:31,451 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 16:49:31,452 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 16:49:31,453 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 16:49:31,455 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 16:49:31,460 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 16:49:31,462 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 16:49:31,463 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 16:49:31,464 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 16:49:31,467 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 16:49:31,467 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 16:49:31,467 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 16:49:31,469 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 16:49:31,470 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 16:49:31,471 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 16:49:31,471 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 16:49:31,472 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 16:49:31,472 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 16:49:31,474 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 16:49:31,474 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 16:49:31,474 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 16:49:31,475 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 16:49:31,476 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 16:49:31,476 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 16:49:31,491 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 16:49:31,491 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 16:49:31,492 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 16:49:31,493 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 16:49:31,493 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 16:49:31,493 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 16:49:31,493 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 16:49:31,493 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 16:49:31,494 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 16:49:31,495 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 16:49:31,495 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 16:49:31,495 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 16:49:31,495 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 16:49:31,495 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 16:49:31,495 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 16:49:31,496 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 16:49:31,497 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 16:49:31,497 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 16:49:31,497 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 16:49:31,497 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 16:49:31,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 16:49:31,497 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 16:49:31,498 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 16:49:31,498 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 16:49:31,498 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 16:49:31,498 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 16:49:31,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 16:49:31,498 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-14 16:49:31,536 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 16:49:31,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 16:49:31,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 16:49:31,557 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 16:49:31,558 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 16:49:31,558 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/heap-data/process_queue_true-unreach-call.i [2019-01-14 16:49:31,624 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d30c92575/a4df3e2b888e45a78e6eb6e58cd1e116/FLAGe092a4991 [2019-01-14 16:49:32,131 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 16:49:32,132 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/heap-data/process_queue_true-unreach-call.i [2019-01-14 16:49:32,147 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d30c92575/a4df3e2b888e45a78e6eb6e58cd1e116/FLAGe092a4991 [2019-01-14 16:49:32,434 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d30c92575/a4df3e2b888e45a78e6eb6e58cd1e116 [2019-01-14 16:49:32,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 16:49:32,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 16:49:32,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 16:49:32,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 16:49:32,448 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 16:49:32,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:49:32" (1/1) ... [2019-01-14 16:49:32,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a0c3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:49:32, skipping insertion in model container [2019-01-14 16:49:32,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:49:32" (1/1) ... [2019-01-14 16:49:32,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 16:49:32,520 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 16:49:32,945 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 16:49:32,960 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 16:49:33,144 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 16:49:33,220 INFO L195 MainTranslator]: Completed translation [2019-01-14 16:49:33,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:49:33 WrapperNode [2019-01-14 16:49:33,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 16:49:33,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 16:49:33,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 16:49:33,224 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 16:49:33,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:49:33" (1/1) ... [2019-01-14 16:49:33,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:49:33" (1/1) ... [2019-01-14 16:49:33,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 16:49:33,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 16:49:33,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 16:49:33,299 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 16:49:33,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:49:33" (1/1) ... [2019-01-14 16:49:33,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:49:33" (1/1) ... [2019-01-14 16:49:33,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:49:33" (1/1) ... [2019-01-14 16:49:33,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:49:33" (1/1) ... [2019-01-14 16:49:33,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:49:33" (1/1) ... [2019-01-14 16:49:33,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:49:33" (1/1) ... [2019-01-14 16:49:33,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:49:33" (1/1) ... [2019-01-14 16:49:33,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 16:49:33,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 16:49:33,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 16:49:33,366 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 16:49:33,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:49:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 16:49:33,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 16:49:33,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 16:49:33,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 16:49:33,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 16:49:33,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 16:49:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 16:49:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 16:49:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 16:49:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 16:49:33,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 16:49:34,021 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 16:49:34,022 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-14 16:49:34,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:49:34 BoogieIcfgContainer [2019-01-14 16:49:34,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 16:49:34,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 16:49:34,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 16:49:34,028 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 16:49:34,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 04:49:32" (1/3) ... [2019-01-14 16:49:34,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8cbc47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 04:49:34, skipping insertion in model container [2019-01-14 16:49:34,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:49:33" (2/3) ... [2019-01-14 16:49:34,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8cbc47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 04:49:34, skipping insertion in model container [2019-01-14 16:49:34,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:49:34" (3/3) ... [2019-01-14 16:49:34,034 INFO L112 eAbstractionObserver]: Analyzing ICFG process_queue_true-unreach-call.i [2019-01-14 16:49:34,046 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 16:49:34,055 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 16:49:34,073 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 16:49:34,102 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 16:49:34,103 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 16:49:34,103 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 16:49:34,103 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 16:49:34,103 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 16:49:34,104 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 16:49:34,104 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 16:49:34,104 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 16:49:34,104 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 16:49:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-01-14 16:49:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 16:49:34,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:49:34,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:49:34,126 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:49:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:49:34,131 INFO L82 PathProgramCache]: Analyzing trace with hash 765962421, now seen corresponding path program 1 times [2019-01-14 16:49:34,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:49:34,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:49:34,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:34,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:49:34,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:49:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:49:34,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 16:49:34,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 16:49:34,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 16:49:34,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 16:49:34,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 16:49:34,350 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-01-14 16:49:34,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:49:34,431 INFO L93 Difference]: Finished difference Result 49 states and 72 transitions. [2019-01-14 16:49:34,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 16:49:34,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 16:49:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:49:34,446 INFO L225 Difference]: With dead ends: 49 [2019-01-14 16:49:34,446 INFO L226 Difference]: Without dead ends: 22 [2019-01-14 16:49:34,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 16:49:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-14 16:49:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-14 16:49:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 16:49:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-01-14 16:49:34,485 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 10 [2019-01-14 16:49:34,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:49:34,486 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-01-14 16:49:34,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 16:49:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2019-01-14 16:49:34,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 16:49:34,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:49:34,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:49:34,488 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:49:34,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:49:34,489 INFO L82 PathProgramCache]: Analyzing trace with hash 708704119, now seen corresponding path program 1 times [2019-01-14 16:49:34,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:49:34,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:49:34,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:34,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:49:34,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:49:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:49:34,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 16:49:34,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 16:49:34,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 16:49:34,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 16:49:34,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 16:49:34,854 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 6 states. [2019-01-14 16:49:35,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:49:35,515 INFO L93 Difference]: Finished difference Result 91 states and 124 transitions. [2019-01-14 16:49:35,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 16:49:35,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-14 16:49:35,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:49:35,520 INFO L225 Difference]: With dead ends: 91 [2019-01-14 16:49:35,520 INFO L226 Difference]: Without dead ends: 71 [2019-01-14 16:49:35,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 16:49:35,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-14 16:49:35,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2019-01-14 16:49:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-14 16:49:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2019-01-14 16:49:35,533 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 10 [2019-01-14 16:49:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:49:35,534 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2019-01-14 16:49:35,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 16:49:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2019-01-14 16:49:35,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 16:49:35,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:49:35,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:49:35,535 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:49:35,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:49:35,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1941169483, now seen corresponding path program 1 times [2019-01-14 16:49:35,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:49:35,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:49:35,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:35,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:49:35,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:49:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:49:35,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 16:49:35,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 16:49:35,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 16:49:35,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 16:49:35,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 16:49:35,604 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand 4 states. [2019-01-14 16:49:35,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:49:35,698 INFO L93 Difference]: Finished difference Result 121 states and 167 transitions. [2019-01-14 16:49:35,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 16:49:35,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-14 16:49:35,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:49:35,701 INFO L225 Difference]: With dead ends: 121 [2019-01-14 16:49:35,701 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 16:49:35,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 16:49:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 16:49:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-01-14 16:49:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 16:49:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2019-01-14 16:49:35,714 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 11 [2019-01-14 16:49:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:49:35,714 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2019-01-14 16:49:35,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 16:49:35,715 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2019-01-14 16:49:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 16:49:35,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:49:35,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:49:35,716 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:49:35,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:49:35,716 INFO L82 PathProgramCache]: Analyzing trace with hash 578790451, now seen corresponding path program 1 times [2019-01-14 16:49:35,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:49:35,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:49:35,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:35,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:49:35,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:49:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:49:35,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 16:49:35,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 16:49:35,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 16:49:35,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 16:49:35,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 16:49:35,951 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand 4 states. [2019-01-14 16:49:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:49:36,124 INFO L93 Difference]: Finished difference Result 145 states and 193 transitions. [2019-01-14 16:49:36,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 16:49:36,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-14 16:49:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:49:36,127 INFO L225 Difference]: With dead ends: 145 [2019-01-14 16:49:36,128 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 16:49:36,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 16:49:36,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 16:49:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2019-01-14 16:49:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 16:49:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2019-01-14 16:49:36,157 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 11 [2019-01-14 16:49:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:49:36,158 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2019-01-14 16:49:36,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 16:49:36,158 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2019-01-14 16:49:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 16:49:36,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:49:36,160 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:49:36,160 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:49:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:49:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1050906354, now seen corresponding path program 1 times [2019-01-14 16:49:36,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:49:36,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:49:36,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:36,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:49:36,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:49:36,442 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-14 16:49:36,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:49:36,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:49:36,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:49:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:49:36,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:49:36,745 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-14 16:49:36,755 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-14 16:49:36,965 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:49:37,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:49:37,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:37,234 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-14 16:49:37,242 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-14 16:49:37,260 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-14 16:49:37,260 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:37,284 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:37,308 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:37,417 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-14 16:49:37,444 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-14 16:49:37,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:37,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:37,626 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-14 16:49:37,648 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-14 16:49:37,649 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:37,805 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-14 16:49:37,806 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:37,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:37,965 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 16:49:37,968 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-14 16:49:37,975 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-14 16:49:37,976 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:37,993 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:38,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:38,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:38,140 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 16:49:38,157 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-14 16:49:38,163 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-14 16:49:38,164 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:38,182 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:38,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:38,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:38,245 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 16:49:38,259 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-14 16:49:38,271 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-14 16:49:38,272 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:38,293 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:38,313 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-14 16:49:38,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:38,362 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-14 16:49:38,371 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-14 16:49:38,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2019-01-14 16:49:38,384 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:38,395 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:38,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:38,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:38,502 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-14 16:49:38,530 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-14 16:49:38,531 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:38,640 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-14 16:49:38,641 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:38,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:38,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:38,757 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-14 16:49:38,763 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-14 16:49:38,763 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:38,780 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:38,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:38,845 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-14 16:49:38,859 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-14 16:49:38,860 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:38,873 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:38,935 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-14 16:49:38,945 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-14 16:49:38,977 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-14 16:49:38,977 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 8 variables, input treesize:156, output treesize:45 [2019-01-14 16:49:39,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:39,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:39,065 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 16:49:39,070 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-14 16:49:39,074 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-14 16:49:39,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:39,148 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 16:49:39,149 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-14 16:49:39,149 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:39,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:39,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:39,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-01-14 16:49:39,200 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 16:49:39,201 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-14 16:49:39,202 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:39,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 16:49:39,216 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:39,220 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:39,228 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-14 16:49:39,228 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:76, output treesize:7 [2019-01-14 16:49:39,256 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-14 16:49:39,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:49:39,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-01-14 16:49:39,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 16:49:39,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 16:49:39,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=64, Unknown=4, NotChecked=0, Total=90 [2019-01-14 16:49:39,280 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand 10 states. [2019-01-14 16:49:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:49:40,255 INFO L93 Difference]: Finished difference Result 164 states and 218 transitions. [2019-01-14 16:49:40,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 16:49:40,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-01-14 16:49:40,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:49:40,257 INFO L225 Difference]: With dead ends: 164 [2019-01-14 16:49:40,257 INFO L226 Difference]: Without dead ends: 105 [2019-01-14 16:49:40,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=151, Unknown=4, NotChecked=0, Total=210 [2019-01-14 16:49:40,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-14 16:49:40,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2019-01-14 16:49:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-14 16:49:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2019-01-14 16:49:40,277 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 13 [2019-01-14 16:49:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:49:40,277 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2019-01-14 16:49:40,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 16:49:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2019-01-14 16:49:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 16:49:40,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:49:40,284 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:49:40,284 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:49:40,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:49:40,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2100423790, now seen corresponding path program 1 times [2019-01-14 16:49:40,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:49:40,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:49:40,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:40,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:49:40,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:49:40,459 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-14 16:49:40,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 16:49:40,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 16:49:40,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 16:49:40,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 16:49:40,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 16:49:40,464 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand 4 states. [2019-01-14 16:49:40,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:49:40,699 INFO L93 Difference]: Finished difference Result 161 states and 209 transitions. [2019-01-14 16:49:40,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 16:49:40,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-01-14 16:49:40,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:49:40,701 INFO L225 Difference]: With dead ends: 161 [2019-01-14 16:49:40,701 INFO L226 Difference]: Without dead ends: 104 [2019-01-14 16:49:40,702 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-14 16:49:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-14 16:49:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2019-01-14 16:49:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-14 16:49:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2019-01-14 16:49:40,716 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 17 [2019-01-14 16:49:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:49:40,717 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2019-01-14 16:49:40,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 16:49:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2019-01-14 16:49:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 16:49:40,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:49:40,718 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:49:40,718 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:49:40,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:49:40,718 INFO L82 PathProgramCache]: Analyzing trace with hash 32961051, now seen corresponding path program 1 times [2019-01-14 16:49:40,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:49:40,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:49:40,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:40,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:49:40,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:49:40,890 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-14 16:49:40,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:49:40,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:49:40,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:49:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:49:40,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:49:41,030 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-14 16:49:41,056 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-14 16:49:41,199 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-14 16:49:41,204 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-14 16:49:41,211 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-14 16:49:41,271 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-14 16:49:41,272 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,288 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,302 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:41,392 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-14 16:49:41,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-14 16:49:41,412 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,439 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,453 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-14 16:49:41,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:41,494 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-14 16:49:41,512 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-14 16:49:41,513 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:41,711 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-01-14 16:49:41,712 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-14 16:49:41,741 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-14 16:49:41,741 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,751 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,757 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-14 16:49:41,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:41,800 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-14 16:49:41,807 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-14 16:49:41,808 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:41,829 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-14 16:49:41,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2019-01-14 16:49:41,834 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,849 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,853 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-14 16:49:41,883 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-14 16:49:41,883 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:118, output treesize:31 [2019-01-14 16:49:41,933 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-14 16:49:41,937 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-14 16:49:41,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,968 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-14 16:49:41,973 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-14 16:49:41,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:41,985 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:11 [2019-01-14 16:49:41,994 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-14 16:49:41,998 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-14 16:49:41,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:42,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:42,002 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-14 16:49:42,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 16:49:42,040 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-14 16:49:42,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:49:42,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-01-14 16:49:42,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 16:49:42,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 16:49:42,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-14 16:49:42,059 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 11 states. [2019-01-14 16:49:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:49:42,773 INFO L93 Difference]: Finished difference Result 239 states and 308 transitions. [2019-01-14 16:49:42,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 16:49:42,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-14 16:49:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:49:42,775 INFO L225 Difference]: With dead ends: 239 [2019-01-14 16:49:42,776 INFO L226 Difference]: Without dead ends: 171 [2019-01-14 16:49:42,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-01-14 16:49:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-14 16:49:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2019-01-14 16:49:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-01-14 16:49:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 204 transitions. [2019-01-14 16:49:42,801 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 204 transitions. Word has length 20 [2019-01-14 16:49:42,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:49:42,802 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 204 transitions. [2019-01-14 16:49:42,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 16:49:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 204 transitions. [2019-01-14 16:49:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 16:49:42,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:49:42,805 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 16:49:42,805 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:49:42,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:49:42,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1600928790, now seen corresponding path program 2 times [2019-01-14 16:49:42,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:49:42,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:49:42,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:42,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:49:42,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:49:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:49:43,429 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-14 16:49:43,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:49:43,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:49:43,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 16:49:43,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 16:49:43,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 16:49:43,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:49:43,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 16:49:43,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:43,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:43,577 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-14 16:49:43,598 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-14 16:49:43,598 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:43,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:43,622 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-14 16:49:43,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 16:49:43,637 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:43,643 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:43,647 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-14 16:49:43,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:43,676 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-14 16:49:43,688 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-14 16:49:43,689 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:43,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:43,705 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-14 16:49:43,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 16:49:43,710 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:43,717 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:43,723 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:43,735 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-14 16:49:43,735 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:86, output treesize:30 [2019-01-14 16:49:43,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:43,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:43,959 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-14 16:49:43,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:44,313 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-14 16:49:44,328 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-14 16:49:44,353 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-14 16:49:44,412 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-14 16:49:44,412 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:44,454 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:44,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:44,563 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:44,766 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:49:44,780 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-14 16:49:44,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:44,958 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-14 16:49:44,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-14 16:49:44,965 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:45,016 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:45,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:45,209 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-14 16:49:45,219 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-14 16:49:45,219 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:45,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:45,282 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 56 treesize of output 48 [2019-01-14 16:49:45,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2019-01-14 16:49:45,291 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:49:45,344 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 14 treesize of output 15 [2019-01-14 16:49:45,345 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:45,381 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:45,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:45,449 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 53 treesize of output 54 [2019-01-14 16:49:45,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 16:49:45,456 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:45,482 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:45,512 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:45,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:45,648 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 40 treesize of output 45 [2019-01-14 16:49:45,653 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-14 16:49:45,653 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:45,667 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:45,729 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-14 16:49:45,734 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-14 16:49:45,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:45,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:45,804 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 47 treesize of output 72 [2019-01-14 16:49:45,808 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-14 16:49:45,809 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:45,824 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:45,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:45,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 71 [2019-01-14 16:49:45,883 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-14 16:49:45,884 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:45,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:45,908 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 16:49:45,911 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 58 treesize of output 59 [2019-01-14 16:49:45,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-01-14 16:49:45,917 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:45,928 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:45,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:45,945 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 34 treesize of output 28 [2019-01-14 16:49:45,951 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 14 treesize of output 12 [2019-01-14 16:49:45,952 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:49:45,996 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-14 16:49:45,996 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:46,004 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:46,028 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-14 16:49:46,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:46,055 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 12 variables, input treesize:222, output treesize:66 [2019-01-14 16:49:46,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:46,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 69 [2019-01-14 16:49:46,164 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 37 treesize of output 29 [2019-01-14 16:49:46,166 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-14 16:49:46,193 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 16:49:46,195 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 26 [2019-01-14 16:49:46,195 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:46,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 16:49:46,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:49:46,226 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 21 treesize of output 19 [2019-01-14 16:49:46,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2019-01-14 16:49:46,246 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:46,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 16:49:46,293 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 16:49:46,296 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:46,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:46,304 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:95, output treesize:7 [2019-01-14 16:49:46,324 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 17 treesize of output 13 [2019-01-14 16:49:46,333 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-01-14 16:49:46,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 16:49:46,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 16:49:46,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:49:46,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:1 [2019-01-14 16:49:46,347 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-14 16:49:46,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:49:46,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2019-01-14 16:49:46,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 16:49:46,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 16:49:46,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-01-14 16:49:46,367 INFO L87 Difference]: Start difference. First operand 160 states and 204 transitions. Second operand 18 states. [2019-01-14 16:49:47,172 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-01-14 16:49:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:49:49,156 INFO L93 Difference]: Finished difference Result 467 states and 623 transitions. [2019-01-14 16:49:49,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 16:49:49,164 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2019-01-14 16:49:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:49:49,164 INFO L225 Difference]: With dead ends: 467 [2019-01-14 16:49:49,164 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 16:49:49,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=307, Invalid=1253, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 16:49:49,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 16:49:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 16:49:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 16:49:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 16:49:49,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-01-14 16:49:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:49:49,168 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 16:49:49,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 16:49:49,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 16:49:49,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 16:49:49,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 16:49:49,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 16:49:49,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 16:49:49,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 16:49:49,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 16:49:49,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 16:49:49,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 16:49:49,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 16:49:49,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 16:49:49,940 WARN L181 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 14 [2019-01-14 16:49:50,356 WARN L181 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 10 [2019-01-14 16:49:50,475 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 14 [2019-01-14 16:49:50,605 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 25 [2019-01-14 16:49:50,609 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 580) no Hoare annotation was computed. [2019-01-14 16:49:50,609 INFO L448 ceAbstractionStarter]: For program point L572-1(lines 572 580) no Hoare annotation was computed. [2019-01-14 16:49:50,609 INFO L448 ceAbstractionStarter]: For program point L601(lines 601 605) no Hoare annotation was computed. [2019-01-14 16:49:50,609 INFO L448 ceAbstractionStarter]: For program point L601-2(lines 601 605) no Hoare annotation was computed. [2019-01-14 16:49:50,609 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-01-14 16:49:50,609 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 589) no Hoare annotation was computed. [2019-01-14 16:49:50,609 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-14 16:49:50,610 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 16:49:50,610 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 16:49:50,610 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 607) no Hoare annotation was computed. [2019-01-14 16:49:50,610 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-14 16:49:50,610 INFO L448 ceAbstractionStarter]: For program point L594-4(lines 594 607) no Hoare annotation was computed. [2019-01-14 16:49:50,610 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 590) no Hoare annotation was computed. [2019-01-14 16:49:50,610 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 16:49:50,611 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 577) no Hoare annotation was computed. [2019-01-14 16:49:50,611 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-01-14 16:49:50,611 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-01-14 16:49:50,611 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-14 16:49:50,611 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 608) no Hoare annotation was computed. [2019-01-14 16:49:50,611 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 589) no Hoare annotation was computed. [2019-01-14 16:49:50,611 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-14 16:49:50,611 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-14 16:49:50,612 INFO L448 ceAbstractionStarter]: For program point L571-3(lines 571 583) no Hoare annotation was computed. [2019-01-14 16:49:50,612 INFO L448 ceAbstractionStarter]: For program point L588(lines 588 589) no Hoare annotation was computed. [2019-01-14 16:49:50,612 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-14 16:49:50,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,625 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,626 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,632 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 16:49:50,632 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 16:49:50,633 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:49:50,633 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:49:50,634 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,634 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,634 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 16:49:50,635 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 16:49:50,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:49:50,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:49:50,636 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,636 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 04:49:50 BoogieIcfgContainer [2019-01-14 16:49:50,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 16:49:50,638 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 16:49:50,638 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 16:49:50,639 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 16:49:50,639 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:49:34" (3/4) ... [2019-01-14 16:49:50,643 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 16:49:50,654 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-01-14 16:49:50,655 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 16:49:50,655 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 16:49:50,723 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 16:49:50,726 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 16:49:50,727 INFO L168 Benchmark]: Toolchain (without parser) took 18288.78 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.7 MB). Free memory was 947.3 MB in the beginning and 850.4 MB in the end (delta: 97.0 MB). Peak memory consumption was 381.7 MB. Max. memory is 11.5 GB. [2019-01-14 16:49:50,728 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 16:49:50,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-01-14 16:49:50,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 16:49:50,730 INFO L168 Benchmark]: Boogie Preprocessor took 66.70 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-14 16:49:50,731 INFO L168 Benchmark]: RCFGBuilder took 657.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-14 16:49:50,732 INFO L168 Benchmark]: TraceAbstraction took 16613.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.1 MB). Free memory was 1.1 GB in the beginning and 859.3 MB in the end (delta: 241.6 MB). Peak memory consumption was 373.7 MB. Max. memory is 11.5 GB. [2019-01-14 16:49:50,732 INFO L168 Benchmark]: Witness Printer took 88.04 ms. Allocated memory is still 1.3 GB. Free memory was 859.3 MB in the beginning and 850.4 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-01-14 16:49:50,736 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.22 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 782.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 657.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16613.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.1 MB). Free memory was 1.1 GB in the beginning and 859.3 MB in the end (delta: 241.6 MB). Peak memory consumption was 373.7 MB. Max. memory is 11.5 GB. * Witness Printer took 88.04 ms. Allocated memory is still 1.3 GB. Free memory was 859.3 MB in the beginning and 850.4 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 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-14 16:49:50,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,742 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-14 16:49:50,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,743 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-14 16:49:50,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,744 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-14 16:49:50,744 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 16:49:50,744 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 16:49:50,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:49:50,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:49:50,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,746 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-01-14 16:49:50,746 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-01-14 16:49:50,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:49:50,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-01-14 16:49:50,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-01-14 16:49:50,748 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, 16.5s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 256 SDtfs, 663 SDslu, 935 SDs, 0 SdLazy, 880 SolverSat, 102 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 4.0s 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, 110 NumberOfFragments, 83 HoareAnnotationTreeSize, 4 FomulaSimplifications, 12776 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1334 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 160 ConstructedInterpolants, 7 QuantifiedInterpolants, 44739 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...