./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_abp_1-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/psyco/psyco_abp_1-3.c -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 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:25:29,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:25:29,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:25:29,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:25:29,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:25:29,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:25:29,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:25:29,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:25:29,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:25:29,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:25:29,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:25:29,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:25:29,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:25:29,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:25:29,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:25:29,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:25:29,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:25:29,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:25:29,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:25:29,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:25:29,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:25:29,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:25:29,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:25:29,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:25:29,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:25:29,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:25:29,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:25:29,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:25:29,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:25:29,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:25:29,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:25:29,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:25:29,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:25:29,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:25:29,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:25:29,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:25:29,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:25:29,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:25:29,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:25:29,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:25:29,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:25:29,339 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:25:29,357 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:25:29,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:25:29,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:25:29,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:25:29,360 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:25:29,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:25:29,361 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:25:29,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:25:29,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:25:29,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:25:29,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:25:29,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:25:29,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:25:29,362 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:25:29,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:25:29,363 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:25:29,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:25:29,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:25:29,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:25:29,364 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:25:29,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:25:29,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:25:29,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:25:29,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:25:29,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:25:29,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:25:29,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:25:29,367 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:25:29,367 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 [2019-11-27 23:25:29,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:25:29,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:25:29,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:25:29,686 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:25:29,686 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:25:29,687 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-3.c [2019-11-27 23:25:29,752 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df2decee/10ad17d7aee34864be1df4c7e0929cc2/FLAGd89f2aa09 [2019-11-27 23:25:30,297 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:25:30,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-3.c [2019-11-27 23:25:30,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df2decee/10ad17d7aee34864be1df4c7e0929cc2/FLAGd89f2aa09 [2019-11-27 23:25:30,590 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df2decee/10ad17d7aee34864be1df4c7e0929cc2 [2019-11-27 23:25:30,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:25:30,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:25:30,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:25:30,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:25:30,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:25:30,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:25:30" (1/1) ... [2019-11-27 23:25:30,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772fdc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:30, skipping insertion in model container [2019-11-27 23:25:30,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:25:30" (1/1) ... [2019-11-27 23:25:30,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:25:30,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:25:30,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:25:30,987 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:25:31,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:25:31,153 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:25:31,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:31 WrapperNode [2019-11-27 23:25:31,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:25:31,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:25:31,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:25:31,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:25:31,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:31" (1/1) ... [2019-11-27 23:25:31,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:31" (1/1) ... [2019-11-27 23:25:31,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:25:31,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:25:31,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:25:31,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:25:31,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:31" (1/1) ... [2019-11-27 23:25:31,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:31" (1/1) ... [2019-11-27 23:25:31,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:31" (1/1) ... [2019-11-27 23:25:31,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:31" (1/1) ... [2019-11-27 23:25:31,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:31" (1/1) ... [2019-11-27 23:25:31,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:31" (1/1) ... [2019-11-27 23:25:31,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:31" (1/1) ... [2019-11-27 23:25:31,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:25:31,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:25:31,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:25:31,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:25:31,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:31" (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-11-27 23:25:31,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:25:31,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:25:32,466 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:25:32,467 INFO L297 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-27 23:25:32,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:25:32 BoogieIcfgContainer [2019-11-27 23:25:32,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:25:32,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:25:32,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:25:32,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:25:32,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:25:30" (1/3) ... [2019-11-27 23:25:32,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1e4e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:25:32, skipping insertion in model container [2019-11-27 23:25:32,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:31" (2/3) ... [2019-11-27 23:25:32,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1e4e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:25:32, skipping insertion in model container [2019-11-27 23:25:32,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:25:32" (3/3) ... [2019-11-27 23:25:32,485 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2019-11-27 23:25:32,498 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:25:32,512 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:25:32,531 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:25:32,584 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:25:32,584 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:25:32,585 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:25:32,585 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:25:32,586 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:25:32,586 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:25:32,586 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:25:32,587 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:25:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2019-11-27 23:25:32,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 23:25:32,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:32,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:32,635 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:32,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:32,644 INFO L82 PathProgramCache]: Analyzing trace with hash 352571511, now seen corresponding path program 1 times [2019-11-27 23:25:32,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:32,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895877192] [2019-11-27 23:25:32,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:32,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895877192] [2019-11-27 23:25:32,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:32,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:25:32,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789048525] [2019-11-27 23:25:32,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:25:32,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:32,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:25:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:25:32,888 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 2 states. [2019-11-27 23:25:32,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:32,958 INFO L93 Difference]: Finished difference Result 216 states and 416 transitions. [2019-11-27 23:25:32,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:25:32,961 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-27 23:25:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:32,982 INFO L225 Difference]: With dead ends: 216 [2019-11-27 23:25:32,983 INFO L226 Difference]: Without dead ends: 100 [2019-11-27 23:25:32,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:25:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-27 23:25:33,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-27 23:25:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-27 23:25:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 165 transitions. [2019-11-27 23:25:33,084 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 165 transitions. Word has length 9 [2019-11-27 23:25:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:33,085 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 165 transitions. [2019-11-27 23:25:33,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:25:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 165 transitions. [2019-11-27 23:25:33,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:25:33,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:33,088 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:33,089 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:33,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697561, now seen corresponding path program 1 times [2019-11-27 23:25:33,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:33,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352009968] [2019-11-27 23:25:33,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:33,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352009968] [2019-11-27 23:25:33,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:33,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:33,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948331369] [2019-11-27 23:25:33,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:33,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:33,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:33,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:33,183 INFO L87 Difference]: Start difference. First operand 100 states and 165 transitions. Second operand 3 states. [2019-11-27 23:25:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:33,267 INFO L93 Difference]: Finished difference Result 201 states and 332 transitions. [2019-11-27 23:25:33,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:33,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-27 23:25:33,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:33,269 INFO L225 Difference]: With dead ends: 201 [2019-11-27 23:25:33,270 INFO L226 Difference]: Without dead ends: 103 [2019-11-27 23:25:33,272 INFO L630 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-11-27 23:25:33,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-27 23:25:33,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-11-27 23:25:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-27 23:25:33,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 168 transitions. [2019-11-27 23:25:33,289 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 168 transitions. Word has length 10 [2019-11-27 23:25:33,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:33,289 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 168 transitions. [2019-11-27 23:25:33,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:33,290 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 168 transitions. [2019-11-27 23:25:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:25:33,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:33,291 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:33,292 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:33,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:33,292 INFO L82 PathProgramCache]: Analyzing trace with hash 658032730, now seen corresponding path program 1 times [2019-11-27 23:25:33,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:33,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696210080] [2019-11-27 23:25:33,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:33,928 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 32 [2019-11-27 23:25:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:33,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696210080] [2019-11-27 23:25:33,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:33,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:25:33,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088522728] [2019-11-27 23:25:33,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:25:33,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:33,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:25:33,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:25:33,941 INFO L87 Difference]: Start difference. First operand 103 states and 168 transitions. Second operand 4 states. [2019-11-27 23:25:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:34,370 INFO L93 Difference]: Finished difference Result 205 states and 334 transitions. [2019-11-27 23:25:34,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:34,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-27 23:25:34,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:34,373 INFO L225 Difference]: With dead ends: 205 [2019-11-27 23:25:34,373 INFO L226 Difference]: Without dead ends: 186 [2019-11-27 23:25:34,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:25:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-27 23:25:34,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2019-11-27 23:25:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-27 23:25:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 281 transitions. [2019-11-27 23:25:34,388 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 281 transitions. Word has length 15 [2019-11-27 23:25:34,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:34,388 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 281 transitions. [2019-11-27 23:25:34,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:25:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 281 transitions. [2019-11-27 23:25:34,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:25:34,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:34,390 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:34,390 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:34,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:34,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1675425412, now seen corresponding path program 1 times [2019-11-27 23:25:34,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:34,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236951797] [2019-11-27 23:25:34,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:34,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236951797] [2019-11-27 23:25:34,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:34,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:34,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921736545] [2019-11-27 23:25:34,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:34,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:34,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:34,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:34,448 INFO L87 Difference]: Start difference. First operand 172 states and 281 transitions. Second operand 3 states. [2019-11-27 23:25:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:34,494 INFO L93 Difference]: Finished difference Result 293 states and 477 transitions. [2019-11-27 23:25:34,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:34,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 23:25:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:34,496 INFO L225 Difference]: With dead ends: 293 [2019-11-27 23:25:34,496 INFO L226 Difference]: Without dead ends: 124 [2019-11-27 23:25:34,497 INFO L630 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-11-27 23:25:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-27 23:25:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-11-27 23:25:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-27 23:25:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2019-11-27 23:25:34,517 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 16 [2019-11-27 23:25:34,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:34,518 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2019-11-27 23:25:34,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2019-11-27 23:25:34,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 23:25:34,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:34,519 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:34,520 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:34,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:34,520 INFO L82 PathProgramCache]: Analyzing trace with hash -843118083, now seen corresponding path program 1 times [2019-11-27 23:25:34,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:34,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891675768] [2019-11-27 23:25:34,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:25:34,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891675768] [2019-11-27 23:25:34,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:34,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:34,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765223056] [2019-11-27 23:25:34,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:34,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:34,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:34,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:34,581 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand 3 states. [2019-11-27 23:25:34,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:34,622 INFO L93 Difference]: Finished difference Result 226 states and 358 transitions. [2019-11-27 23:25:34,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:34,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-27 23:25:34,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:34,624 INFO L225 Difference]: With dead ends: 226 [2019-11-27 23:25:34,625 INFO L226 Difference]: Without dead ends: 107 [2019-11-27 23:25:34,627 INFO L630 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-11-27 23:25:34,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-27 23:25:34,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-11-27 23:25:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-27 23:25:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 163 transitions. [2019-11-27 23:25:34,644 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 163 transitions. Word has length 21 [2019-11-27 23:25:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:34,646 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 163 transitions. [2019-11-27 23:25:34,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 163 transitions. [2019-11-27 23:25:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 23:25:34,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:34,649 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:34,650 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:34,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:34,650 INFO L82 PathProgramCache]: Analyzing trace with hash -671640130, now seen corresponding path program 1 times [2019-11-27 23:25:34,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:34,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819860438] [2019-11-27 23:25:34,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:37,017 WARN L192 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 80 DAG size of output: 27 [2019-11-27 23:25:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:37,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819860438] [2019-11-27 23:25:37,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114907223] [2019-11-27 23:25:37,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:25:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:37,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 23:25:37,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:25:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:37,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:25:37,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-27 23:25:37,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406076925] [2019-11-27 23:25:37,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:25:37,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:37,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:25:37,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:25:37,191 INFO L87 Difference]: Start difference. First operand 105 states and 163 transitions. Second operand 7 states. [2019-11-27 23:25:37,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:37,914 INFO L93 Difference]: Finished difference Result 359 states and 564 transitions. [2019-11-27 23:25:37,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:25:37,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-27 23:25:37,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:37,917 INFO L225 Difference]: With dead ends: 359 [2019-11-27 23:25:37,917 INFO L226 Difference]: Without dead ends: 319 [2019-11-27 23:25:37,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:25:37,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-11-27 23:25:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 275. [2019-11-27 23:25:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-27 23:25:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 434 transitions. [2019-11-27 23:25:37,931 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 434 transitions. Word has length 23 [2019-11-27 23:25:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:37,932 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 434 transitions. [2019-11-27 23:25:37,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:25:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 434 transitions. [2019-11-27 23:25:37,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:25:37,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:37,933 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:38,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:25:38,138 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:38,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:38,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1800121285, now seen corresponding path program 1 times [2019-11-27 23:25:38,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:38,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269536064] [2019-11-27 23:25:38,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:25:38,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269536064] [2019-11-27 23:25:38,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:38,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:38,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552213292] [2019-11-27 23:25:38,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:38,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:38,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:38,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:38,185 INFO L87 Difference]: Start difference. First operand 275 states and 434 transitions. Second operand 3 states. [2019-11-27 23:25:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:38,237 INFO L93 Difference]: Finished difference Result 548 states and 861 transitions. [2019-11-27 23:25:38,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:38,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-27 23:25:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:38,240 INFO L225 Difference]: With dead ends: 548 [2019-11-27 23:25:38,240 INFO L226 Difference]: Without dead ends: 297 [2019-11-27 23:25:38,241 INFO L630 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-11-27 23:25:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-27 23:25:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2019-11-27 23:25:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-27 23:25:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 454 transitions. [2019-11-27 23:25:38,252 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 454 transitions. Word has length 25 [2019-11-27 23:25:38,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:38,253 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 454 transitions. [2019-11-27 23:25:38,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 454 transitions. [2019-11-27 23:25:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 23:25:38,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:38,254 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:38,254 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:38,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:38,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2124865792, now seen corresponding path program 1 times [2019-11-27 23:25:38,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:38,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250695713] [2019-11-27 23:25:38,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:38,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250695713] [2019-11-27 23:25:38,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140980097] [2019-11-27 23:25:38,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:25:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:38,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 23:25:38,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:25:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 23:25:38,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:25:38,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-11-27 23:25:38,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461484329] [2019-11-27 23:25:38,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:38,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:38,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:38,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:25:38,593 INFO L87 Difference]: Start difference. First operand 295 states and 454 transitions. Second operand 3 states. [2019-11-27 23:25:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:38,614 INFO L93 Difference]: Finished difference Result 298 states and 456 transitions. [2019-11-27 23:25:38,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:38,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-27 23:25:38,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:38,617 INFO L225 Difference]: With dead ends: 298 [2019-11-27 23:25:38,617 INFO L226 Difference]: Without dead ends: 292 [2019-11-27 23:25:38,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:25:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-27 23:25:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2019-11-27 23:25:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-27 23:25:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 442 transitions. [2019-11-27 23:25:38,627 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 442 transitions. Word has length 27 [2019-11-27 23:25:38,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:38,629 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 442 transitions. [2019-11-27 23:25:38,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 442 transitions. [2019-11-27 23:25:38,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-27 23:25:38,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:38,632 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:38,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:25:38,836 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:38,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:38,837 INFO L82 PathProgramCache]: Analyzing trace with hash -917092134, now seen corresponding path program 1 times [2019-11-27 23:25:38,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:38,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746913904] [2019-11-27 23:25:38,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-27 23:25:38,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746913904] [2019-11-27 23:25:38,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:38,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:38,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436541453] [2019-11-27 23:25:38,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:38,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:38,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:38,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:38,889 INFO L87 Difference]: Start difference. First operand 291 states and 442 transitions. Second operand 3 states. [2019-11-27 23:25:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:38,919 INFO L93 Difference]: Finished difference Result 510 states and 775 transitions. [2019-11-27 23:25:38,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:38,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-27 23:25:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:38,922 INFO L225 Difference]: With dead ends: 510 [2019-11-27 23:25:38,922 INFO L226 Difference]: Without dead ends: 243 [2019-11-27 23:25:38,923 INFO L630 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-11-27 23:25:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-27 23:25:38,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2019-11-27 23:25:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-27 23:25:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 361 transitions. [2019-11-27 23:25:38,931 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 361 transitions. Word has length 33 [2019-11-27 23:25:38,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:38,931 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 361 transitions. [2019-11-27 23:25:38,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:38,931 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 361 transitions. [2019-11-27 23:25:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-27 23:25:38,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:38,932 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:38,933 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:38,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:38,933 INFO L82 PathProgramCache]: Analyzing trace with hash 272165387, now seen corresponding path program 1 times [2019-11-27 23:25:38,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:38,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598029398] [2019-11-27 23:25:38,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-27 23:25:38,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598029398] [2019-11-27 23:25:38,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:38,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:38,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572780943] [2019-11-27 23:25:38,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:38,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:38,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:38,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:38,994 INFO L87 Difference]: Start difference. First operand 241 states and 361 transitions. Second operand 3 states. [2019-11-27 23:25:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:39,028 INFO L93 Difference]: Finished difference Result 424 states and 632 transitions. [2019-11-27 23:25:39,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:39,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-27 23:25:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:39,031 INFO L225 Difference]: With dead ends: 424 [2019-11-27 23:25:39,031 INFO L226 Difference]: Without dead ends: 225 [2019-11-27 23:25:39,032 INFO L630 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-11-27 23:25:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-27 23:25:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2019-11-27 23:25:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-27 23:25:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 324 transitions. [2019-11-27 23:25:39,041 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 324 transitions. Word has length 37 [2019-11-27 23:25:39,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:39,041 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 324 transitions. [2019-11-27 23:25:39,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:39,042 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 324 transitions. [2019-11-27 23:25:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-27 23:25:39,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:39,045 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:39,045 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:39,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:39,046 INFO L82 PathProgramCache]: Analyzing trace with hash -140510671, now seen corresponding path program 1 times [2019-11-27 23:25:39,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:39,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252528252] [2019-11-27 23:25:39,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-27 23:25:39,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252528252] [2019-11-27 23:25:39,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:25:39,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:25:39,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352349275] [2019-11-27 23:25:39,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:25:39,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:39,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:25:39,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:25:39,124 INFO L87 Difference]: Start difference. First operand 223 states and 324 transitions. Second operand 3 states. [2019-11-27 23:25:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:39,154 INFO L93 Difference]: Finished difference Result 305 states and 442 transitions. [2019-11-27 23:25:39,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:25:39,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-27 23:25:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:39,158 INFO L225 Difference]: With dead ends: 305 [2019-11-27 23:25:39,158 INFO L226 Difference]: Without dead ends: 143 [2019-11-27 23:25:39,159 INFO L630 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-11-27 23:25:39,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-27 23:25:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-11-27 23:25:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-27 23:25:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 199 transitions. [2019-11-27 23:25:39,165 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 199 transitions. Word has length 46 [2019-11-27 23:25:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:39,166 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 199 transitions. [2019-11-27 23:25:39,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:25:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 199 transitions. [2019-11-27 23:25:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-27 23:25:39,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:39,167 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:39,167 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:39,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1014660280, now seen corresponding path program 1 times [2019-11-27 23:25:39,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:39,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857873192] [2019-11-27 23:25:39,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-27 23:25:39,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857873192] [2019-11-27 23:25:39,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204919750] [2019-11-27 23:25:39,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:25:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:39,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-27 23:25:39,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:25:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:39,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:25:39,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-27 23:25:39,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824415395] [2019-11-27 23:25:39,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:25:39,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:39,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:25:39,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:25:39,594 INFO L87 Difference]: Start difference. First operand 141 states and 199 transitions. Second operand 10 states. [2019-11-27 23:25:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:39,720 INFO L93 Difference]: Finished difference Result 167 states and 233 transitions. [2019-11-27 23:25:39,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:25:39,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-11-27 23:25:39,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:39,723 INFO L225 Difference]: With dead ends: 167 [2019-11-27 23:25:39,724 INFO L226 Difference]: Without dead ends: 160 [2019-11-27 23:25:39,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:25:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-27 23:25:39,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-11-27 23:25:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-27 23:25:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 220 transitions. [2019-11-27 23:25:39,732 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 220 transitions. Word has length 47 [2019-11-27 23:25:39,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:39,734 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 220 transitions. [2019-11-27 23:25:39,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:25:39,734 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 220 transitions. [2019-11-27 23:25:39,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-27 23:25:39,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:39,736 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:39,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:25:39,948 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:39,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:39,949 INFO L82 PathProgramCache]: Analyzing trace with hash 751253453, now seen corresponding path program 1 times [2019-11-27 23:25:39,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:39,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695059695] [2019-11-27 23:25:39,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:40,539 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 31 [2019-11-27 23:25:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:40,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695059695] [2019-11-27 23:25:40,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356462977] [2019-11-27 23:25:40,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:25:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:40,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-27 23:25:40,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:25:40,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-27 23:25:40,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:25:40,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:25:40,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:25:40,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:25:40,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:40,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:25:40,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-27 23:25:40,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175426779] [2019-11-27 23:25:40,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:25:40,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:40,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:25:40,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:25:40,860 INFO L87 Difference]: Start difference. First operand 158 states and 220 transitions. Second operand 10 states. [2019-11-27 23:25:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:41,215 INFO L93 Difference]: Finished difference Result 177 states and 246 transitions. [2019-11-27 23:25:41,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:25:41,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-11-27 23:25:41,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:41,217 INFO L225 Difference]: With dead ends: 177 [2019-11-27 23:25:41,217 INFO L226 Difference]: Without dead ends: 175 [2019-11-27 23:25:41,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:25:41,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-27 23:25:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-11-27 23:25:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-27 23:25:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 243 transitions. [2019-11-27 23:25:41,228 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 243 transitions. Word has length 57 [2019-11-27 23:25:41,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:41,228 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 243 transitions. [2019-11-27 23:25:41,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:25:41,229 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 243 transitions. [2019-11-27 23:25:41,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-27 23:25:41,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:41,230 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:41,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:25:41,435 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:41,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:41,436 INFO L82 PathProgramCache]: Analyzing trace with hash 384172331, now seen corresponding path program 1 times [2019-11-27 23:25:41,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:41,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993449413] [2019-11-27 23:25:41,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:41,955 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2019-11-27 23:25:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:41,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993449413] [2019-11-27 23:25:41,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182334344] [2019-11-27 23:25:41,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:25:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:42,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-27 23:25:42,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:25:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:42,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:25:42,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2019-11-27 23:25:42,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413196949] [2019-11-27 23:25:42,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 23:25:42,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:42,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 23:25:42,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:25:42,175 INFO L87 Difference]: Start difference. First operand 174 states and 243 transitions. Second operand 9 states. [2019-11-27 23:25:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:42,298 INFO L93 Difference]: Finished difference Result 194 states and 270 transitions. [2019-11-27 23:25:42,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 23:25:42,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-27 23:25:42,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:42,300 INFO L225 Difference]: With dead ends: 194 [2019-11-27 23:25:42,300 INFO L226 Difference]: Without dead ends: 192 [2019-11-27 23:25:42,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:25:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-27 23:25:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-11-27 23:25:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-27 23:25:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 268 transitions. [2019-11-27 23:25:42,309 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 268 transitions. Word has length 66 [2019-11-27 23:25:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:42,309 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 268 transitions. [2019-11-27 23:25:42,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 23:25:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 268 transitions. [2019-11-27 23:25:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-27 23:25:42,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:25:42,310 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:25:42,514 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:25:42,514 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:25:42,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:25:42,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2057891779, now seen corresponding path program 1 times [2019-11-27 23:25:42,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:25:42,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371288721] [2019-11-27 23:25:42,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:25:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:45,047 WARN L192 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 74 DAG size of output: 21 [2019-11-27 23:25:47,075 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse37 (<= c_ULTIMATE.start_main_~this_buffer_empty~0 1)) (.cse38 (div c_ULTIMATE.start_main_~this_buffer_empty~0 4294967296))) (and (let ((.cse33 (div c_ULTIMATE.start_main_~this_expect~0 2)) (.cse30 (div c_ULTIMATE.start_main_~P6~0 2))) (let ((.cse31 (* .cse30 (- 2))) (.cse32 (* .cse33 (- 2)))) (let ((.cse14 (div (+ .cse32 c_ULTIMATE.start_main_~this_expect~0) 4294967296)) (.cse2 (* 2 .cse33)) (.cse29 (* 4294967296 (div c_ULTIMATE.start_main_~this_expect~0 4294967296))) (.cse19 (div (+ c_ULTIMATE.start_main_~P6~0 .cse31) 4294967296)) (.cse16 (* 2 .cse30)) (.cse5 (div (+ .cse32 c_ULTIMATE.start_main_~this_expect~0 (- 2)) 4294967296))) (let ((.cse20 (div (+ c_ULTIMATE.start_main_~P6~0 .cse31 (- 2)) 4294967296)) (.cse1 (* 4294967296 .cse5)) (.cse8 (* 4 .cse30)) (.cse26 (<= 0 c_ULTIMATE.start_main_~P6~0)) (.cse27 (= c_ULTIMATE.start_main_~P6~0 .cse16)) (.cse12 (* 4294967296 .cse19)) (.cse24 (<= .cse29 c_ULTIMATE.start_main_~this_expect~0)) (.cse25 (= .cse2 c_ULTIMATE.start_main_~this_expect~0)) (.cse18 (* 4294967296 .cse14)) (.cse22 (* 2 c_ULTIMATE.start_main_~P6~0))) (let ((.cse0 (+ c_ULTIMATE.start_main_~this_expect~0 1)) (.cse7 (+ .cse18 .cse22 .cse2)) (.cse13 (or .cse24 .cse25)) (.cse17 (+ .cse12 .cse16 c_ULTIMATE.start_main_~this_expect~0)) (.cse3 (< c_ULTIMATE.start_main_~this_expect~0 .cse29)) (.cse11 (or .cse26 .cse27)) (.cse21 (+ .cse12 .cse8 c_ULTIMATE.start_main_~this_expect~0)) (.cse6 (not .cse27)) (.cse23 (+ .cse22 .cse1 .cse2)) (.cse9 (* 4294967296 .cse20)) (.cse10 (< c_ULTIMATE.start_main_~P6~0 0)) (.cse4 (not .cse25))) (or (and (<= .cse0 (+ .cse1 .cse2)) .cse3 .cse4) (and .cse3 .cse4 (<= (+ .cse5 1) 0)) (and (or (and .cse6 (<= .cse7 (+ .cse8 .cse9 c_ULTIMATE.start_main_~this_expect~0 5)) .cse10) (and .cse11 (<= .cse7 (+ .cse12 .cse8 c_ULTIMATE.start_main_~this_expect~0 1)))) .cse13) (and (<= (+ .cse14 1) 0) .cse13) (and (let ((.cse15 (+ .cse18 c_ULTIMATE.start_main_~P6~0 .cse2))) (or (and .cse6 .cse10 (<= .cse15 (+ .cse16 .cse9 c_ULTIMATE.start_main_~this_expect~0 2))) (and .cse11 (<= .cse15 .cse17)))) .cse13) (and .cse13 (<= .cse0 (+ .cse18 .cse2))) (and (or (and (<= (+ .cse18 .cse2 1) c_ULTIMATE.start_main_~this_expect~0) .cse13) (and .cse13 (or (and .cse11 (<= .cse14 .cse19)) (and .cse6 .cse10 (<= .cse14 .cse20)))) (and .cse3 .cse4 (<= (+ .cse1 .cse2 1) c_ULTIMATE.start_main_~this_expect~0)) (and (or (and .cse11 (<= .cse5 .cse19)) (and .cse6 (<= .cse5 .cse20) .cse10)) .cse3 .cse4)) (or (and (or (and .cse11 (<= (+ .cse12 .cse8 c_ULTIMATE.start_main_~this_expect~0 3) .cse7)) (and .cse6 (<= (+ .cse8 .cse9 c_ULTIMATE.start_main_~this_expect~0 7) .cse7) .cse10)) .cse13) (and .cse3 .cse4 (or (and .cse11 (<= .cse21 (+ .cse22 .cse1 .cse2 1))) (and .cse6 (<= (+ .cse8 .cse9 c_ULTIMATE.start_main_~this_expect~0 3) .cse23) .cse10))) (let ((.cse28 (and .cse6 .cse10))) (and (or .cse24 .cse25 (and (or .cse26 .cse27 (< .cse20 .cse5)) (or (< .cse19 .cse5) .cse28))) (or (and .cse3 .cse4) (and (or (< .cse19 .cse14) .cse28) (or .cse26 .cse27 (< .cse20 .cse14)))))))) (and (or (and .cse6 (<= (+ c_ULTIMATE.start_main_~P6~0 .cse1 .cse2) (+ .cse16 .cse9 c_ULTIMATE.start_main_~this_expect~0)) .cse10) (and .cse11 (<= (+ c_ULTIMATE.start_main_~P6~0 .cse1 .cse2 2) .cse17))) .cse3 .cse4) (and .cse3 (or (and .cse11 (<= (+ .cse22 .cse1 .cse2 3) .cse21)) (and .cse6 (<= .cse23 (+ .cse8 .cse9 c_ULTIMATE.start_main_~this_expect~0 1)) .cse10)) .cse4))))))) (or (let ((.cse39 (* 4294967296 .cse38))) (let ((.cse36 (<= 1 c_ULTIMATE.start_main_~this_buffer_empty~0)) (.cse34 (+ .cse39 1))) (and (or (<= c_ULTIMATE.start_main_~this_buffer_empty~0 .cse34) (let ((.cse35 (+ .cse38 1))) (and (or (< 0 .cse35) .cse36) (or .cse37 (<= .cse35 0))))) (or .cse36 (< .cse34 c_ULTIMATE.start_main_~this_buffer_empty~0) (< .cse39 c_ULTIMATE.start_main_~this_buffer_empty~0))))) (< 0 .cse38)) (or .cse37 (<= .cse38 0)))) is different from false [2019-11-27 23:25:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 62 refuted. 0 times theorem prover too weak. 9 trivial. 28 not checked. [2019-11-27 23:25:47,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371288721] [2019-11-27 23:25:47,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264742740] [2019-11-27 23:25:47,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:25:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:25:47,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-27 23:25:47,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:25:47,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:25:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:25:47,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:25:47,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-11-27 23:25:47,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039350578] [2019-11-27 23:25:47,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 23:25:47,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:25:47,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 23:25:47,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2019-11-27 23:25:47,498 INFO L87 Difference]: Start difference. First operand 192 states and 268 transitions. Second operand 16 states. [2019-11-27 23:25:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:25:48,077 INFO L93 Difference]: Finished difference Result 211 states and 295 transitions. [2019-11-27 23:25:48,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 23:25:48,077 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 78 [2019-11-27 23:25:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:25:48,077 INFO L225 Difference]: With dead ends: 211 [2019-11-27 23:25:48,078 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 23:25:48,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2019-11-27 23:25:48,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 23:25:48,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 23:25:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 23:25:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 23:25:48,079 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-11-27 23:25:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:25:48,080 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 23:25:48,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 23:25:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 23:25:48,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 23:25:48,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:25:48,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 23:25:48,483 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-11-27 23:25:48,559 INFO L246 CegarLoopResult]: For program point L498(lines 498 500) no Hoare annotation was computed. [2019-11-27 23:25:48,559 INFO L246 CegarLoopResult]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-11-27 23:25:48,559 INFO L246 CegarLoopResult]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-27 23:25:48,559 INFO L246 CegarLoopResult]: For program point L39(lines 39 58) no Hoare annotation was computed. [2019-11-27 23:25:48,559 INFO L246 CegarLoopResult]: For program point L40(lines 40 55) no Hoare annotation was computed. [2019-11-27 23:25:48,560 INFO L246 CegarLoopResult]: For program point L140(lines 140 155) no Hoare annotation was computed. [2019-11-27 23:25:48,560 INFO L246 CegarLoopResult]: For program point L240(lines 240 255) no Hoare annotation was computed. [2019-11-27 23:25:48,560 INFO L246 CegarLoopResult]: For program point L108(lines 108 123) no Hoare annotation was computed. [2019-11-27 23:25:48,560 INFO L246 CegarLoopResult]: For program point L42(lines 42 53) no Hoare annotation was computed. [2019-11-27 23:25:48,560 INFO L246 CegarLoopResult]: For program point L340(lines 340 355) no Hoare annotation was computed. [2019-11-27 23:25:48,560 INFO L246 CegarLoopResult]: For program point L208(lines 208 223) no Hoare annotation was computed. [2019-11-27 23:25:48,560 INFO L246 CegarLoopResult]: For program point L142(lines 142 153) no Hoare annotation was computed. [2019-11-27 23:25:48,561 INFO L246 CegarLoopResult]: For program point L76(lines 76 91) no Hoare annotation was computed. [2019-11-27 23:25:48,561 INFO L246 CegarLoopResult]: For program point L440(lines 440 455) no Hoare annotation was computed. [2019-11-27 23:25:48,561 INFO L246 CegarLoopResult]: For program point L308(lines 308 323) no Hoare annotation was computed. [2019-11-27 23:25:48,561 INFO L246 CegarLoopResult]: For program point L242(lines 242 253) no Hoare annotation was computed. [2019-11-27 23:25:48,561 INFO L246 CegarLoopResult]: For program point L176(lines 176 191) no Hoare annotation was computed. [2019-11-27 23:25:48,561 INFO L246 CegarLoopResult]: For program point L110(lines 110 121) no Hoare annotation was computed. [2019-11-27 23:25:48,561 INFO L246 CegarLoopResult]: For program point L540(lines 540 555) no Hoare annotation was computed. [2019-11-27 23:25:48,562 INFO L246 CegarLoopResult]: For program point L408(lines 408 423) no Hoare annotation was computed. [2019-11-27 23:25:48,562 INFO L246 CegarLoopResult]: For program point L342(lines 342 353) no Hoare annotation was computed. [2019-11-27 23:25:48,562 INFO L246 CegarLoopResult]: For program point L276(lines 276 291) no Hoare annotation was computed. [2019-11-27 23:25:48,562 INFO L246 CegarLoopResult]: For program point L210(lines 210 221) no Hoare annotation was computed. [2019-11-27 23:25:48,562 INFO L246 CegarLoopResult]: For program point L78(lines 78 89) no Hoare annotation was computed. [2019-11-27 23:25:48,562 INFO L246 CegarLoopResult]: For program point L508(lines 508 523) no Hoare annotation was computed. [2019-11-27 23:25:48,563 INFO L246 CegarLoopResult]: For program point L442(lines 442 453) no Hoare annotation was computed. [2019-11-27 23:25:48,563 INFO L246 CegarLoopResult]: For program point L376(lines 376 391) no Hoare annotation was computed. [2019-11-27 23:25:48,563 INFO L246 CegarLoopResult]: For program point L310(lines 310 321) no Hoare annotation was computed. [2019-11-27 23:25:48,563 INFO L246 CegarLoopResult]: For program point L178(lines 178 189) no Hoare annotation was computed. [2019-11-27 23:25:48,563 INFO L246 CegarLoopResult]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-11-27 23:25:48,563 INFO L246 CegarLoopResult]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-11-27 23:25:48,563 INFO L246 CegarLoopResult]: For program point L476(lines 476 491) no Hoare annotation was computed. [2019-11-27 23:25:48,564 INFO L246 CegarLoopResult]: For program point L410(lines 410 421) no Hoare annotation was computed. [2019-11-27 23:25:48,564 INFO L246 CegarLoopResult]: For program point L278(lines 278 289) no Hoare annotation was computed. [2019-11-27 23:25:48,564 INFO L246 CegarLoopResult]: For program point L146(lines 146 148) no Hoare annotation was computed. [2019-11-27 23:25:48,564 INFO L249 CegarLoopResult]: At program point L14(lines 14 566) the Hoare annotation is: true [2019-11-27 23:25:48,564 INFO L246 CegarLoopResult]: For program point L510(lines 510 521) no Hoare annotation was computed. [2019-11-27 23:25:48,564 INFO L246 CegarLoopResult]: For program point L378(lines 378 389) no Hoare annotation was computed. [2019-11-27 23:25:48,564 INFO L246 CegarLoopResult]: For program point L246(lines 246 248) no Hoare annotation was computed. [2019-11-27 23:25:48,564 INFO L246 CegarLoopResult]: For program point L114(lines 114 116) no Hoare annotation was computed. [2019-11-27 23:25:48,564 INFO L246 CegarLoopResult]: For program point L478(lines 478 489) no Hoare annotation was computed. [2019-11-27 23:25:48,565 INFO L246 CegarLoopResult]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-11-27 23:25:48,565 INFO L246 CegarLoopResult]: For program point L214(lines 214 216) no Hoare annotation was computed. [2019-11-27 23:25:48,565 INFO L246 CegarLoopResult]: For program point L82(lines 82 84) no Hoare annotation was computed. [2019-11-27 23:25:48,565 INFO L246 CegarLoopResult]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-27 23:25:48,565 INFO L246 CegarLoopResult]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-11-27 23:25:48,565 INFO L246 CegarLoopResult]: For program point L182(lines 182 184) no Hoare annotation was computed. [2019-11-27 23:25:48,565 INFO L246 CegarLoopResult]: For program point L546(lines 546 548) no Hoare annotation was computed. [2019-11-27 23:25:48,565 INFO L246 CegarLoopResult]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-27 23:25:48,565 INFO L246 CegarLoopResult]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-11-27 23:25:48,565 INFO L242 CegarLoopResult]: At program point L547(lines 14 566) the Hoare annotation is: false [2019-11-27 23:25:48,566 INFO L246 CegarLoopResult]: For program point L514(lines 514 516) no Hoare annotation was computed. [2019-11-27 23:25:48,566 INFO L246 CegarLoopResult]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-11-27 23:25:48,566 INFO L246 CegarLoopResult]: For program point L482(lines 482 484) no Hoare annotation was computed. [2019-11-27 23:25:48,566 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 23:25:48,566 INFO L242 CegarLoopResult]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~this_buffer_empty~0 0))) (or (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 2)) 2)) 2)) (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648)) (<= ULTIMATE.start_main_~P8~0 2147483647)) (and .cse0 (<= 0 ULTIMATE.start_main_~this_expect~0) (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0)))) [2019-11-27 23:25:48,566 INFO L246 CegarLoopResult]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2019-11-27 23:25:48,566 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 23:25:48,566 INFO L246 CegarLoopResult]: For program point L124(lines 124 139) no Hoare annotation was computed. [2019-11-27 23:25:48,567 INFO L246 CegarLoopResult]: For program point L224(lines 224 239) no Hoare annotation was computed. [2019-11-27 23:25:48,567 INFO L246 CegarLoopResult]: For program point L92(lines 92 107) no Hoare annotation was computed. [2019-11-27 23:25:48,567 INFO L246 CegarLoopResult]: For program point L59(lines 59 158) no Hoare annotation was computed. [2019-11-27 23:25:48,567 INFO L246 CegarLoopResult]: For program point L324(lines 324 339) no Hoare annotation was computed. [2019-11-27 23:25:48,567 INFO L246 CegarLoopResult]: For program point L192(lines 192 207) no Hoare annotation was computed. [2019-11-27 23:25:48,567 INFO L246 CegarLoopResult]: For program point L159(lines 159 258) no Hoare annotation was computed. [2019-11-27 23:25:48,567 INFO L246 CegarLoopResult]: For program point L126(lines 126 137) no Hoare annotation was computed. [2019-11-27 23:25:48,567 INFO L246 CegarLoopResult]: For program point L60(lines 60 75) no Hoare annotation was computed. [2019-11-27 23:25:48,567 INFO L246 CegarLoopResult]: For program point L424(lines 424 439) no Hoare annotation was computed. [2019-11-27 23:25:48,567 INFO L246 CegarLoopResult]: For program point L292(lines 292 307) no Hoare annotation was computed. [2019-11-27 23:25:48,567 INFO L246 CegarLoopResult]: For program point L259(lines 259 358) no Hoare annotation was computed. [2019-11-27 23:25:48,567 INFO L246 CegarLoopResult]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-11-27 23:25:48,568 INFO L246 CegarLoopResult]: For program point L160(lines 160 175) no Hoare annotation was computed. [2019-11-27 23:25:48,568 INFO L246 CegarLoopResult]: For program point L94(lines 94 105) no Hoare annotation was computed. [2019-11-27 23:25:48,568 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 23:25:48,568 INFO L242 CegarLoopResult]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 2)) 2)) 2))) (.cse0 (= ULTIMATE.start_main_~this_buffer_empty~0 0)) (.cse5 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 1)) 2)) 1))) (.cse4 (= ULTIMATE.start_main_~this_buffer_empty~0 1)) (.cse2 (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648))) (.cse3 (<= ULTIMATE.start_main_~P8~0 2147483647))) (or (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_main_~q~0 1) .cse1 .cse4 .cse2 .cse3) (and (= ULTIMATE.start_main_~q~0 3) .cse0 .cse5 .cse2 .cse3) (and .cse0 (<= 0 ULTIMATE.start_main_~this_expect~0) (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0)) (and .cse5 (= ULTIMATE.start_main_~q~0 4) .cse4 .cse2 .cse3))) [2019-11-27 23:25:48,568 INFO L246 CegarLoopResult]: For program point L524(lines 524 539) no Hoare annotation was computed. [2019-11-27 23:25:48,568 INFO L246 CegarLoopResult]: For program point L392(lines 392 407) no Hoare annotation was computed. [2019-11-27 23:25:48,568 INFO L246 CegarLoopResult]: For program point L359(lines 359 458) no Hoare annotation was computed. [2019-11-27 23:25:48,568 INFO L246 CegarLoopResult]: For program point L326(lines 326 337) no Hoare annotation was computed. [2019-11-27 23:25:48,568 INFO L246 CegarLoopResult]: For program point L260(lines 260 275) no Hoare annotation was computed. [2019-11-27 23:25:48,568 INFO L246 CegarLoopResult]: For program point L194(lines 194 205) no Hoare annotation was computed. [2019-11-27 23:25:48,569 INFO L246 CegarLoopResult]: For program point L62(lines 62 73) no Hoare annotation was computed. [2019-11-27 23:25:48,569 INFO L246 CegarLoopResult]: For program point L492(lines 492 507) no Hoare annotation was computed. [2019-11-27 23:25:48,569 INFO L246 CegarLoopResult]: For program point L459(lines 459 558) no Hoare annotation was computed. [2019-11-27 23:25:48,569 INFO L246 CegarLoopResult]: For program point L426(lines 426 437) no Hoare annotation was computed. [2019-11-27 23:25:48,569 INFO L246 CegarLoopResult]: For program point L360(lines 360 375) no Hoare annotation was computed. [2019-11-27 23:25:48,569 INFO L246 CegarLoopResult]: For program point L294(lines 294 305) no Hoare annotation was computed. [2019-11-27 23:25:48,569 INFO L246 CegarLoopResult]: For program point L162(lines 162 173) no Hoare annotation was computed. [2019-11-27 23:25:48,569 INFO L246 CegarLoopResult]: For program point L526(lines 526 537) no Hoare annotation was computed. [2019-11-27 23:25:48,569 INFO L246 CegarLoopResult]: For program point L460(lines 460 475) no Hoare annotation was computed. [2019-11-27 23:25:48,569 INFO L246 CegarLoopResult]: For program point L394(lines 394 405) no Hoare annotation was computed. [2019-11-27 23:25:48,569 INFO L246 CegarLoopResult]: For program point L262(lines 262 273) no Hoare annotation was computed. [2019-11-27 23:25:48,570 INFO L246 CegarLoopResult]: For program point L130(lines 130 132) no Hoare annotation was computed. [2019-11-27 23:25:48,570 INFO L246 CegarLoopResult]: For program point L494(lines 494 505) no Hoare annotation was computed. [2019-11-27 23:25:48,570 INFO L246 CegarLoopResult]: For program point L362(lines 362 373) no Hoare annotation was computed. [2019-11-27 23:25:48,570 INFO L246 CegarLoopResult]: For program point L230(lines 230 232) no Hoare annotation was computed. [2019-11-27 23:25:48,570 INFO L246 CegarLoopResult]: For program point L98(lines 98 100) no Hoare annotation was computed. [2019-11-27 23:25:48,570 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 23:25:48,570 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2019-11-27 23:25:48,570 INFO L246 CegarLoopResult]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-27 23:25:48,570 INFO L246 CegarLoopResult]: For program point L330(lines 330 332) no Hoare annotation was computed. [2019-11-27 23:25:48,570 INFO L246 CegarLoopResult]: For program point L198(lines 198 200) no Hoare annotation was computed. [2019-11-27 23:25:48,571 INFO L246 CegarLoopResult]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-11-27 23:25:48,571 INFO L246 CegarLoopResult]: For program point L430(lines 430 432) no Hoare annotation was computed. [2019-11-27 23:25:48,571 INFO L246 CegarLoopResult]: For program point L298(lines 298 300) no Hoare annotation was computed. [2019-11-27 23:25:48,571 INFO L246 CegarLoopResult]: For program point L166(lines 166 168) no Hoare annotation was computed. [2019-11-27 23:25:48,571 INFO L246 CegarLoopResult]: For program point L530(lines 530 532) no Hoare annotation was computed. [2019-11-27 23:25:48,571 INFO L246 CegarLoopResult]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-11-27 23:25:48,571 INFO L246 CegarLoopResult]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-11-27 23:25:48,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:25:48 BoogieIcfgContainer [2019-11-27 23:25:48,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:25:48,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:25:48,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:25:48,591 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:25:48,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:25:32" (3/4) ... [2019-11-27 23:25:48,595 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 23:25:48,613 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-27 23:25:48,613 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 23:25:48,657 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:25:48,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:25:48,659 INFO L168 Benchmark]: Toolchain (without parser) took 18063.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 320.3 MB). Free memory was 957.7 MB in the beginning and 910.4 MB in the end (delta: 47.3 MB). Peak memory consumption was 367.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:25:48,659 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:25:48,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 557.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:25:48,660 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.58 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-27 23:25:48,661 INFO L168 Benchmark]: Boogie Preprocessor took 71.80 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-11-27 23:25:48,662 INFO L168 Benchmark]: RCFGBuilder took 1158.39 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: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:25:48,662 INFO L168 Benchmark]: TraceAbstraction took 16118.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 919.7 MB in the end (delta: 133.7 MB). Peak memory consumption was 316.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:25:48,663 INFO L168 Benchmark]: Witness Printer took 65.86 ms. Allocated memory is still 1.3 GB. Free memory was 919.7 MB in the beginning and 910.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-11-27 23:25:48,667 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 557.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.58 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1158.39 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: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16118.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 919.7 MB in the end (delta: 133.7 MB). Peak memory consumption was 316.1 MB. Max. memory is 11.5 GB. * Witness Printer took 65.86 ms. Allocated memory is still 1.3 GB. Free memory was 919.7 MB in the beginning and 910.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: 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: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((5 <= q && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || ((((q == 1 && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || ((((q == 3 && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -1) / 2) + 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || (((this_buffer_empty == 0 && 0 <= this_expect) && this_expect <= 0) && q == 0)) || ((((this_expect <= 2 * ((this_expect + -1) / 2) + 1 && q == 4) && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((5 <= q && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || (((this_buffer_empty == 0 && 0 <= this_expect) && this_expect <= 0) && q == 0) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 1 error locations. Result: SAFE, OverallTime: 15.7s, OverallIterations: 15, TraceHistogramMax: 8, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 2279 SDtfs, 1913 SDslu, 5000 SDs, 0 SdLazy, 818 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 306 SyntacticMatches, 12 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 74 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 20 NumberOfFragments, 160 HoareAnnotationTreeSize, 4 FomulaSimplifications, 983 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 257 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 1581330 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2024 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 215/668 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...