./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.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-91b1670 [2018-11-28 17:27:18,692 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 17:27:18,694 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 17:27:18,706 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 17:27:18,706 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 17:27:18,707 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 17:27:18,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 17:27:18,711 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 17:27:18,713 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 17:27:18,714 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 17:27:18,714 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 17:27:18,715 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 17:27:18,716 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 17:27:18,717 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 17:27:18,718 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 17:27:18,719 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 17:27:18,720 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 17:27:18,722 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 17:27:18,724 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 17:27:18,726 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 17:27:18,727 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 17:27:18,729 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 17:27:18,732 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 17:27:18,732 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 17:27:18,732 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 17:27:18,733 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 17:27:18,734 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 17:27:18,735 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 17:27:18,736 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 17:27:18,738 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 17:27:18,738 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 17:27:18,739 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 17:27:18,739 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 17:27:18,739 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 17:27:18,741 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 17:27:18,742 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 17:27:18,742 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 17:27:18,766 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 17:27:18,768 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 17:27:18,769 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 17:27:18,769 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 17:27:18,771 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 17:27:18,772 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 17:27:18,772 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 17:27:18,772 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 17:27:18,772 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 17:27:18,772 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 17:27:18,774 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 17:27:18,774 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 17:27:18,774 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 17:27:18,774 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 17:27:18,775 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 17:27:18,775 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 17:27:18,775 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 17:27:18,775 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 17:27:18,777 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 17:27:18,777 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 17:27:18,778 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 17:27:18,778 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 17:27:18,778 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 17:27:18,778 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 17:27:18,778 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 17:27:18,780 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 17:27:18,780 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 17:27:18,780 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 17:27:18,780 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 17:27:18,781 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 17:27:18,781 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 [2018-11-28 17:27:18,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 17:27:18,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 17:27:18,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 17:27:18,851 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 17:27:18,852 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 17:27:18,852 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-28 17:27:18,907 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4eb06c4b/159473200819420a829d4b17a2b110bc/FLAG8d3232a94 [2018-11-28 17:27:19,473 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 17:27:19,476 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-28 17:27:19,496 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4eb06c4b/159473200819420a829d4b17a2b110bc/FLAG8d3232a94 [2018-11-28 17:27:19,694 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4eb06c4b/159473200819420a829d4b17a2b110bc [2018-11-28 17:27:19,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 17:27:19,699 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 17:27:19,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 17:27:19,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 17:27:19,705 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 17:27:19,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:27:19" (1/1) ... [2018-11-28 17:27:19,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@edc88b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:19, skipping insertion in model container [2018-11-28 17:27:19,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:27:19" (1/1) ... [2018-11-28 17:27:19,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 17:27:19,766 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 17:27:20,079 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 17:27:20,085 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 17:27:20,204 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 17:27:20,221 INFO L195 MainTranslator]: Completed translation [2018-11-28 17:27:20,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:20 WrapperNode [2018-11-28 17:27:20,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 17:27:20,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 17:27:20,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 17:27:20,223 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 17:27:20,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:20" (1/1) ... [2018-11-28 17:27:20,248 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:20" (1/1) ... [2018-11-28 17:27:20,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 17:27:20,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 17:27:20,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 17:27:20,257 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 17:27:20,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:20" (1/1) ... [2018-11-28 17:27:20,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:20" (1/1) ... [2018-11-28 17:27:20,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:20" (1/1) ... [2018-11-28 17:27:20,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:20" (1/1) ... [2018-11-28 17:27:20,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:20" (1/1) ... [2018-11-28 17:27:20,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:20" (1/1) ... [2018-11-28 17:27:20,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:20" (1/1) ... [2018-11-28 17:27:20,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 17:27:20,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 17:27:20,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 17:27:20,428 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 17:27:20,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:20" (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 [2018-11-28 17:27:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 17:27:20,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 17:27:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 17:27:20,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 17:27:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 17:27:20,517 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 17:27:22,281 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 17:27:22,282 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 17:27:22,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:27:22 BoogieIcfgContainer [2018-11-28 17:27:22,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 17:27:22,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 17:27:22,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 17:27:22,288 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 17:27:22,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:27:19" (1/3) ... [2018-11-28 17:27:22,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c04c47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:27:22, skipping insertion in model container [2018-11-28 17:27:22,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:27:20" (2/3) ... [2018-11-28 17:27:22,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c04c47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:27:22, skipping insertion in model container [2018-11-28 17:27:22,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:27:22" (3/3) ... [2018-11-28 17:27:22,292 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-28 17:27:22,301 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 17:27:22,309 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 17:27:22,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 17:27:22,358 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 17:27:22,359 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 17:27:22,359 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 17:27:22,360 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 17:27:22,361 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 17:27:22,361 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 17:27:22,361 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 17:27:22,361 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 17:27:22,362 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 17:27:22,385 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-11-28 17:27:22,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 17:27:22,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:22,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:22,395 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:22,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:22,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1483071650, now seen corresponding path program 1 times [2018-11-28 17:27:22,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:22,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:22,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:22,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:22,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:22,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 17:27:22,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 17:27:22,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 17:27:22,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 17:27:22,574 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-11-28 17:27:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:22,610 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-11-28 17:27:22,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 17:27:22,611 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-28 17:27:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:22,625 INFO L225 Difference]: With dead ends: 222 [2018-11-28 17:27:22,625 INFO L226 Difference]: Without dead ends: 104 [2018-11-28 17:27:22,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 17:27:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-28 17:27:22,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-28 17:27:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 17:27:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-11-28 17:27:22,682 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-11-28 17:27:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:22,682 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-11-28 17:27:22,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 17:27:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-11-28 17:27:22,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 17:27:22,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:22,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:22,686 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:22,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:22,686 INFO L82 PathProgramCache]: Analyzing trace with hash -736931587, now seen corresponding path program 1 times [2018-11-28 17:27:22,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:22,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:22,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:22,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:22,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:22,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:22,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 17:27:22,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 17:27:22,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 17:27:22,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:22,821 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-11-28 17:27:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:22,959 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-11-28 17:27:22,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 17:27:22,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-28 17:27:22,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:22,964 INFO L225 Difference]: With dead ends: 205 [2018-11-28 17:27:22,964 INFO L226 Difference]: Without dead ends: 107 [2018-11-28 17:27:22,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:22,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-28 17:27:22,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-28 17:27:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 17:27:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-11-28 17:27:22,980 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-11-28 17:27:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:22,980 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-11-28 17:27:22,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 17:27:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-11-28 17:27:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 17:27:22,983 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:22,984 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:22,984 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:22,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:22,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1504395429, now seen corresponding path program 1 times [2018-11-28 17:27:22,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:22,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:22,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:22,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:22,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:23,611 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 16 [2018-11-28 17:27:24,638 WARN L180 SmtUtils]: Spent 954.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 39 [2018-11-28 17:27:24,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:24,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:24,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 17:27:24,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 17:27:24,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 17:27:24,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:27:24,646 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 4 states. [2018-11-28 17:27:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:25,108 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-11-28 17:27:25,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 17:27:25,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-28 17:27:25,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:25,112 INFO L225 Difference]: With dead ends: 209 [2018-11-28 17:27:25,112 INFO L226 Difference]: Without dead ends: 190 [2018-11-28 17:27:25,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:27:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-28 17:27:25,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-11-28 17:27:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-28 17:27:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-11-28 17:27:25,129 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-11-28 17:27:25,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:25,130 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-11-28 17:27:25,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 17:27:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-11-28 17:27:25,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 17:27:25,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:25,131 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:25,132 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:25,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:25,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2142865338, now seen corresponding path program 1 times [2018-11-28 17:27:25,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:25,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:25,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:25,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:25,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:25,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:25,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 17:27:25,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 17:27:25,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 17:27:25,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:25,181 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-11-28 17:27:25,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:25,248 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-11-28 17:27:25,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 17:27:25,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 17:27:25,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:25,250 INFO L225 Difference]: With dead ends: 297 [2018-11-28 17:27:25,251 INFO L226 Difference]: Without dead ends: 128 [2018-11-28 17:27:25,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:25,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-28 17:27:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-28 17:27:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 17:27:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-11-28 17:27:25,265 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-11-28 17:27:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:25,266 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-11-28 17:27:25,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 17:27:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-11-28 17:27:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 17:27:25,267 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:25,267 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:25,268 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:25,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:25,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2011475352, now seen corresponding path program 1 times [2018-11-28 17:27:25,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:25,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:25,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:25,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:25,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:25,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 17:27:25,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:25,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 17:27:25,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 17:27:25,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 17:27:25,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:25,357 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-11-28 17:27:25,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:25,510 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-11-28 17:27:25,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 17:27:25,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 17:27:25,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:25,513 INFO L225 Difference]: With dead ends: 230 [2018-11-28 17:27:25,514 INFO L226 Difference]: Without dead ends: 111 [2018-11-28 17:27:25,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:25,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-28 17:27:25,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-11-28 17:27:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-28 17:27:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-11-28 17:27:25,524 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-11-28 17:27:25,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:25,524 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-11-28 17:27:25,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 17:27:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-11-28 17:27:25,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 17:27:25,527 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:25,527 INFO L402 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] [2018-11-28 17:27:25,527 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:25,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:25,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1818456969, now seen corresponding path program 1 times [2018-11-28 17:27:25,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:25,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:25,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:25,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:25,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:25,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:27:25,802 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:27:25,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:25,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:27:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:25,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:27:25,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-28 17:27:25,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 17:27:25,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 17:27:25,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:27:25,943 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 4 states. [2018-11-28 17:27:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:26,366 INFO L93 Difference]: Finished difference Result 192 states and 299 transitions. [2018-11-28 17:27:26,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 17:27:26,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-28 17:27:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:26,368 INFO L225 Difference]: With dead ends: 192 [2018-11-28 17:27:26,368 INFO L226 Difference]: Without dead ends: 174 [2018-11-28 17:27:26,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:27:26,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-28 17:27:26,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-11-28 17:27:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-28 17:27:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 265 transitions. [2018-11-28 17:27:26,383 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 265 transitions. Word has length 27 [2018-11-28 17:27:26,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:26,383 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 265 transitions. [2018-11-28 17:27:26,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 17:27:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 265 transitions. [2018-11-28 17:27:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 17:27:26,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:26,387 INFO L402 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, 1] [2018-11-28 17:27:26,388 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:26,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:26,388 INFO L82 PathProgramCache]: Analyzing trace with hash 549034740, now seen corresponding path program 1 times [2018-11-28 17:27:26,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:26,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:26,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:26,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:26,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:26,777 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 9 [2018-11-28 17:27:27,052 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 33 [2018-11-28 17:27:27,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:27,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:27:27,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:27:27,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:27,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:27:27,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:27,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:27:27,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 17:27:27,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 17:27:27,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 17:27:27,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 17:27:27,399 INFO L87 Difference]: Start difference. First operand 172 states and 265 transitions. Second operand 6 states. [2018-11-28 17:27:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:28,208 INFO L93 Difference]: Finished difference Result 230 states and 355 transitions. [2018-11-28 17:27:28,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 17:27:28,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-28 17:27:28,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:28,212 INFO L225 Difference]: With dead ends: 230 [2018-11-28 17:27:28,212 INFO L226 Difference]: Without dead ends: 226 [2018-11-28 17:27:28,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 17:27:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-28 17:27:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2018-11-28 17:27:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-28 17:27:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 339 transitions. [2018-11-28 17:27:28,235 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 339 transitions. Word has length 28 [2018-11-28 17:27:28,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:28,235 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 339 transitions. [2018-11-28 17:27:28,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 17:27:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 339 transitions. [2018-11-28 17:27:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 17:27:28,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:28,240 INFO L402 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, 1, 1] [2018-11-28 17:27:28,245 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:28,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:28,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1113591962, now seen corresponding path program 1 times [2018-11-28 17:27:28,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:28,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:28,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:28,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:28,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 17:27:28,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:28,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 17:27:28,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 17:27:28,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 17:27:28,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:28,325 INFO L87 Difference]: Start difference. First operand 217 states and 339 transitions. Second operand 3 states. [2018-11-28 17:27:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:28,507 INFO L93 Difference]: Finished difference Result 391 states and 608 transitions. [2018-11-28 17:27:28,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 17:27:28,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 17:27:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:28,510 INFO L225 Difference]: With dead ends: 391 [2018-11-28 17:27:28,510 INFO L226 Difference]: Without dead ends: 202 [2018-11-28 17:27:28,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:28,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-28 17:27:28,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-11-28 17:27:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-28 17:27:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2018-11-28 17:27:28,521 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 29 [2018-11-28 17:27:28,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:28,521 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2018-11-28 17:27:28,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 17:27:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2018-11-28 17:27:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 17:27:28,527 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:28,528 INFO L402 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, 1, 1, 1, 1] [2018-11-28 17:27:28,528 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:28,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:28,528 INFO L82 PathProgramCache]: Analyzing trace with hash 454582667, now seen corresponding path program 1 times [2018-11-28 17:27:28,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:28,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:28,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:28,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:28,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:29,197 WARN L180 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 5 [2018-11-28 17:27:29,529 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2018-11-28 17:27:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:29,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:27:29,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:27:29,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:29,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:27:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 17:27:29,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 17:27:29,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-28 17:27:29,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 17:27:29,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 17:27:29,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 17:27:29,831 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 6 states. [2018-11-28 17:27:30,048 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-28 17:27:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:30,543 INFO L93 Difference]: Finished difference Result 357 states and 542 transitions. [2018-11-28 17:27:30,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 17:27:30,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-28 17:27:30,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:30,547 INFO L225 Difference]: With dead ends: 357 [2018-11-28 17:27:30,547 INFO L226 Difference]: Without dead ends: 341 [2018-11-28 17:27:30,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-28 17:27:30,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-11-28 17:27:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 312. [2018-11-28 17:27:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-28 17:27:30,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 471 transitions. [2018-11-28 17:27:30,559 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 471 transitions. Word has length 31 [2018-11-28 17:27:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:30,559 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 471 transitions. [2018-11-28 17:27:30,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 17:27:30,559 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 471 transitions. [2018-11-28 17:27:30,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 17:27:30,560 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:30,561 INFO L402 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, 1, 1, 1, 1] [2018-11-28 17:27:30,561 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:30,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:30,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1646630523, now seen corresponding path program 1 times [2018-11-28 17:27:30,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:30,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:30,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:30,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:30,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 17:27:30,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:30,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 17:27:30,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 17:27:30,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 17:27:30,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:30,644 INFO L87 Difference]: Start difference. First operand 312 states and 471 transitions. Second operand 3 states. [2018-11-28 17:27:30,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:30,770 INFO L93 Difference]: Finished difference Result 512 states and 778 transitions. [2018-11-28 17:27:30,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 17:27:30,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-28 17:27:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:30,772 INFO L225 Difference]: With dead ends: 512 [2018-11-28 17:27:30,772 INFO L226 Difference]: Without dead ends: 246 [2018-11-28 17:27:30,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:30,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-28 17:27:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2018-11-28 17:27:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-28 17:27:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 364 transitions. [2018-11-28 17:27:30,783 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 364 transitions. Word has length 37 [2018-11-28 17:27:30,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:30,783 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 364 transitions. [2018-11-28 17:27:30,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 17:27:30,784 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 364 transitions. [2018-11-28 17:27:30,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 17:27:30,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:30,785 INFO L402 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, 1, 1, 1] [2018-11-28 17:27:30,785 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:30,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:30,786 INFO L82 PathProgramCache]: Analyzing trace with hash 939353414, now seen corresponding path program 1 times [2018-11-28 17:27:30,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:30,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:30,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:30,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:30,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:31,015 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 17:27:31,192 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 17:27:31,473 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2018-11-28 17:27:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:31,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:27:31,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:27:31,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:31,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:27:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:31,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:27:31,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-28 17:27:31,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 17:27:31,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 17:27:31,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 17:27:31,896 INFO L87 Difference]: Start difference. First operand 244 states and 364 transitions. Second operand 8 states. [2018-11-28 17:27:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:32,571 INFO L93 Difference]: Finished difference Result 254 states and 373 transitions. [2018-11-28 17:27:32,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 17:27:32,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-28 17:27:32,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:32,575 INFO L225 Difference]: With dead ends: 254 [2018-11-28 17:27:32,575 INFO L226 Difference]: Without dead ends: 252 [2018-11-28 17:27:32,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 17:27:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-28 17:27:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 245. [2018-11-28 17:27:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-28 17:27:32,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 365 transitions. [2018-11-28 17:27:32,587 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 365 transitions. Word has length 40 [2018-11-28 17:27:32,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:32,587 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 365 transitions. [2018-11-28 17:27:32,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 17:27:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 365 transitions. [2018-11-28 17:27:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 17:27:32,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:32,588 INFO L402 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, 1, 1, 1, 1] [2018-11-28 17:27:32,589 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:32,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:32,591 INFO L82 PathProgramCache]: Analyzing trace with hash -819577482, now seen corresponding path program 1 times [2018-11-28 17:27:32,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:32,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:32,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:32,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:32,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 17:27:32,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:32,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 17:27:32,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 17:27:32,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 17:27:32,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:32,676 INFO L87 Difference]: Start difference. First operand 245 states and 365 transitions. Second operand 3 states. [2018-11-28 17:27:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:32,801 INFO L93 Difference]: Finished difference Result 428 states and 636 transitions. [2018-11-28 17:27:32,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 17:27:32,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-28 17:27:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:32,803 INFO L225 Difference]: With dead ends: 428 [2018-11-28 17:27:32,804 INFO L226 Difference]: Without dead ends: 229 [2018-11-28 17:27:32,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-28 17:27:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-11-28 17:27:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-28 17:27:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2018-11-28 17:27:32,813 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 41 [2018-11-28 17:27:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:32,814 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2018-11-28 17:27:32,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 17:27:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2018-11-28 17:27:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 17:27:32,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:32,816 INFO L402 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, 1, 1, 1, 1] [2018-11-28 17:27:32,816 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:32,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:32,817 INFO L82 PathProgramCache]: Analyzing trace with hash 711556807, now seen corresponding path program 1 times [2018-11-28 17:27:32,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:32,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:32,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:32,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:32,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 17:27:32,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:27:32,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 17:27:32,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 17:27:32,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 17:27:32,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:32,911 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand 3 states. [2018-11-28 17:27:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:33,180 INFO L93 Difference]: Finished difference Result 309 states and 446 transitions. [2018-11-28 17:27:33,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 17:27:33,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-28 17:27:33,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:33,184 INFO L225 Difference]: With dead ends: 309 [2018-11-28 17:27:33,184 INFO L226 Difference]: Without dead ends: 147 [2018-11-28 17:27:33,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 17:27:33,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-28 17:27:33,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-28 17:27:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-28 17:27:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2018-11-28 17:27:33,194 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 50 [2018-11-28 17:27:33,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:33,196 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2018-11-28 17:27:33,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 17:27:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2018-11-28 17:27:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 17:27:33,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:33,197 INFO L402 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, 1, 1, 1, 1] [2018-11-28 17:27:33,197 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:33,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:33,197 INFO L82 PathProgramCache]: Analyzing trace with hash -370372205, now seen corresponding path program 1 times [2018-11-28 17:27:33,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:33,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:33,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:33,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:33,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:33,744 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-11-28 17:27:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 17:27:33,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:27:33,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:27:33,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:33,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:27:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:34,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:27:34,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-11-28 17:27:34,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 17:27:34,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 17:27:34,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 17:27:34,125 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 9 states. [2018-11-28 17:27:34,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:34,324 INFO L93 Difference]: Finished difference Result 188 states and 263 transitions. [2018-11-28 17:27:34,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 17:27:34,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-28 17:27:34,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:34,326 INFO L225 Difference]: With dead ends: 188 [2018-11-28 17:27:34,326 INFO L226 Difference]: Without dead ends: 184 [2018-11-28 17:27:34,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 17:27:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-28 17:27:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-11-28 17:27:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-28 17:27:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 254 transitions. [2018-11-28 17:27:34,334 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 254 transitions. Word has length 51 [2018-11-28 17:27:34,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:34,334 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 254 transitions. [2018-11-28 17:27:34,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 17:27:34,334 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 254 transitions. [2018-11-28 17:27:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 17:27:34,335 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:34,335 INFO L402 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, 1, 1, 1, 1] [2018-11-28 17:27:34,336 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:34,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:34,336 INFO L82 PathProgramCache]: Analyzing trace with hash -379328264, now seen corresponding path program 1 times [2018-11-28 17:27:34,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:34,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:34,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:34,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:34,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:34,600 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 17:27:34,767 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 17:27:37,442 WARN L180 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 194 DAG size of output: 36 [2018-11-28 17:27:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:37,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:27:37,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:27:37,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:37,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:27:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:37,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:27:37,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-28 17:27:37,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 17:27:37,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 17:27:37,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-28 17:27:37,789 INFO L87 Difference]: Start difference. First operand 181 states and 254 transitions. Second operand 11 states. [2018-11-28 17:27:39,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:39,216 INFO L93 Difference]: Finished difference Result 187 states and 260 transitions. [2018-11-28 17:27:39,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 17:27:39,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-11-28 17:27:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:39,219 INFO L225 Difference]: With dead ends: 187 [2018-11-28 17:27:39,219 INFO L226 Difference]: Without dead ends: 185 [2018-11-28 17:27:39,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-28 17:27:39,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-28 17:27:39,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-11-28 17:27:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-28 17:27:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 255 transitions. [2018-11-28 17:27:39,232 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 255 transitions. Word has length 61 [2018-11-28 17:27:39,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:39,232 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 255 transitions. [2018-11-28 17:27:39,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 17:27:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 255 transitions. [2018-11-28 17:27:39,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 17:27:39,234 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:39,235 INFO L402 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, 1, 1, 1, 1] [2018-11-28 17:27:39,235 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:39,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:39,235 INFO L82 PathProgramCache]: Analyzing trace with hash 638427137, now seen corresponding path program 1 times [2018-11-28 17:27:39,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:39,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:39,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:39,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:39,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:39,491 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 17:27:39,662 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 17:27:39,837 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-28 17:27:40,045 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 17:27:40,276 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 17:27:40,776 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 33 [2018-11-28 17:27:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:40,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:27:40,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:27:40,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:40,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:27:40,948 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:40,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:27:40,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-11-28 17:27:40,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 17:27:40,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 17:27:40,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 17:27:40,980 INFO L87 Difference]: Start difference. First operand 182 states and 255 transitions. Second operand 9 states. [2018-11-28 17:27:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:41,139 INFO L93 Difference]: Finished difference Result 203 states and 284 transitions. [2018-11-28 17:27:41,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 17:27:41,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-11-28 17:27:41,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:41,142 INFO L225 Difference]: With dead ends: 203 [2018-11-28 17:27:41,142 INFO L226 Difference]: Without dead ends: 200 [2018-11-28 17:27:41,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 17:27:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-28 17:27:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-11-28 17:27:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-28 17:27:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 280 transitions. [2018-11-28 17:27:41,151 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 280 transitions. Word has length 70 [2018-11-28 17:27:41,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:41,151 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 280 transitions. [2018-11-28 17:27:41,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 17:27:41,151 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 280 transitions. [2018-11-28 17:27:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 17:27:41,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:41,154 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:41,155 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:41,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:41,155 INFO L82 PathProgramCache]: Analyzing trace with hash -784011109, now seen corresponding path program 1 times [2018-11-28 17:27:41,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:41,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:41,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:41,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:41,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 17:27:41,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:27:41,731 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:27:41,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:41,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:27:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 17:27:41,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:27:41,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-28 17:27:41,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 17:27:41,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 17:27:41,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 17:27:41,944 INFO L87 Difference]: Start difference. First operand 200 states and 280 transitions. Second operand 7 states. [2018-11-28 17:27:42,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:42,187 INFO L93 Difference]: Finished difference Result 224 states and 311 transitions. [2018-11-28 17:27:42,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 17:27:42,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-11-28 17:27:42,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:42,190 INFO L225 Difference]: With dead ends: 224 [2018-11-28 17:27:42,190 INFO L226 Difference]: Without dead ends: 221 [2018-11-28 17:27:42,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 17:27:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-28 17:27:42,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-11-28 17:27:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-28 17:27:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 305 transitions. [2018-11-28 17:27:42,200 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 305 transitions. Word has length 79 [2018-11-28 17:27:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:42,202 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 305 transitions. [2018-11-28 17:27:42,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 17:27:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 305 transitions. [2018-11-28 17:27:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 17:27:42,204 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:42,204 INFO L402 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, 1, 1, 1, 1] [2018-11-28 17:27:42,204 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:42,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:42,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1961279789, now seen corresponding path program 1 times [2018-11-28 17:27:42,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:42,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:42,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:42,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:42,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:42,524 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 17:27:45,198 WARN L180 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 133 DAG size of output: 40 [2018-11-28 17:27:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:45,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:27:45,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:27:45,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:45,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:27:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:45,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:27:45,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-28 17:27:45,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 17:27:45,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 17:27:45,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-28 17:27:45,560 INFO L87 Difference]: Start difference. First operand 218 states and 305 transitions. Second operand 11 states. [2018-11-28 17:27:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:45,748 INFO L93 Difference]: Finished difference Result 221 states and 308 transitions. [2018-11-28 17:27:45,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 17:27:45,749 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2018-11-28 17:27:45,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:45,751 INFO L225 Difference]: With dead ends: 221 [2018-11-28 17:27:45,751 INFO L226 Difference]: Without dead ends: 219 [2018-11-28 17:27:45,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-28 17:27:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-28 17:27:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-11-28 17:27:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-28 17:27:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 306 transitions. [2018-11-28 17:27:45,761 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 306 transitions. Word has length 82 [2018-11-28 17:27:45,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:45,761 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 306 transitions. [2018-11-28 17:27:45,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 17:27:45,762 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 306 transitions. [2018-11-28 17:27:45,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 17:27:45,762 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:45,763 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 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, 1, 1] [2018-11-28 17:27:45,763 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:45,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:45,763 INFO L82 PathProgramCache]: Analyzing trace with hash -101241370, now seen corresponding path program 1 times [2018-11-28 17:27:45,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:45,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:45,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:45,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:45,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 17:27:46,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:27:46,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:27:46,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:46,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:27:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:46,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:27:46,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-11-28 17:27:46,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 17:27:46,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 17:27:46,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-28 17:27:46,363 INFO L87 Difference]: Start difference. First operand 219 states and 306 transitions. Second operand 15 states. [2018-11-28 17:27:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:46,484 INFO L93 Difference]: Finished difference Result 262 states and 366 transitions. [2018-11-28 17:27:46,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 17:27:46,486 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-11-28 17:27:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:46,488 INFO L225 Difference]: With dead ends: 262 [2018-11-28 17:27:46,488 INFO L226 Difference]: Without dead ends: 258 [2018-11-28 17:27:46,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-28 17:27:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-28 17:27:46,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 255. [2018-11-28 17:27:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-28 17:27:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 357 transitions. [2018-11-28 17:27:46,499 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 357 transitions. Word has length 93 [2018-11-28 17:27:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:46,499 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 357 transitions. [2018-11-28 17:27:46,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 17:27:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 357 transitions. [2018-11-28 17:27:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 17:27:46,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:46,503 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-28 17:27:46,503 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:46,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:46,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1744733813, now seen corresponding path program 2 times [2018-11-28 17:27:46,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:46,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:46,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:46,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:27:46,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:46,845 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 17:27:47,022 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 17:27:47,493 WARN L180 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-11-28 17:27:48,108 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 39 [2018-11-28 17:27:48,492 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 36 [2018-11-28 17:27:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:48,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:27:48,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:27:48,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 17:27:48,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 17:27:48,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 17:27:48,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:27:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:49,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:27:49,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2018-11-28 17:27:49,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 17:27:49,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 17:27:49,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-28 17:27:49,004 INFO L87 Difference]: Start difference. First operand 255 states and 357 transitions. Second operand 15 states. [2018-11-28 17:27:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:50,040 INFO L93 Difference]: Finished difference Result 265 states and 367 transitions. [2018-11-28 17:27:50,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 17:27:50,042 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 103 [2018-11-28 17:27:50,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:50,044 INFO L225 Difference]: With dead ends: 265 [2018-11-28 17:27:50,044 INFO L226 Difference]: Without dead ends: 263 [2018-11-28 17:27:50,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-11-28 17:27:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-28 17:27:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 256. [2018-11-28 17:27:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-28 17:27:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 358 transitions. [2018-11-28 17:27:50,057 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 358 transitions. Word has length 103 [2018-11-28 17:27:50,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:50,057 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 358 transitions. [2018-11-28 17:27:50,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 17:27:50,057 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 358 transitions. [2018-11-28 17:27:50,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-28 17:27:50,058 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:50,060 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-11-28 17:27:50,061 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:50,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:50,061 INFO L82 PathProgramCache]: Analyzing trace with hash 769524942, now seen corresponding path program 2 times [2018-11-28 17:27:50,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:50,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:50,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:50,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 17:27:50,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:51,078 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 39 [2018-11-28 17:27:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 20 proven. 203 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 17:27:51,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:27:51,104 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:27:51,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 17:27:51,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 17:27:51,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 17:27:51,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:27:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 20 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:51,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:27:51,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-11-28 17:27:51,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 17:27:51,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 17:27:51,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-11-28 17:27:51,534 INFO L87 Difference]: Start difference. First operand 256 states and 358 transitions. Second operand 21 states. [2018-11-28 17:27:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:52,181 INFO L93 Difference]: Finished difference Result 277 states and 387 transitions. [2018-11-28 17:27:52,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 17:27:52,181 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 112 [2018-11-28 17:27:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:52,183 INFO L225 Difference]: With dead ends: 277 [2018-11-28 17:27:52,183 INFO L226 Difference]: Without dead ends: 274 [2018-11-28 17:27:52,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-11-28 17:27:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-28 17:27:52,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-11-28 17:27:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-28 17:27:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 383 transitions. [2018-11-28 17:27:52,194 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 383 transitions. Word has length 112 [2018-11-28 17:27:52,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:52,194 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 383 transitions. [2018-11-28 17:27:52,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 17:27:52,194 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 383 transitions. [2018-11-28 17:27:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-28 17:27:52,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:52,198 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-11-28 17:27:52,198 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:52,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:52,200 INFO L82 PathProgramCache]: Analyzing trace with hash -495672722, now seen corresponding path program 2 times [2018-11-28 17:27:52,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:52,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:52,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:52,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 17:27:52,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 22 proven. 248 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 17:27:53,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:27:53,123 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:27:53,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 17:27:53,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 17:27:53,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 17:27:53,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:27:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 22 proven. 248 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 17:27:53,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:27:53,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-28 17:27:53,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 17:27:53,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 17:27:53,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 17:27:53,368 INFO L87 Difference]: Start difference. First operand 274 states and 383 transitions. Second operand 9 states. [2018-11-28 17:27:53,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:53,779 INFO L93 Difference]: Finished difference Result 298 states and 414 transitions. [2018-11-28 17:27:53,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 17:27:53,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2018-11-28 17:27:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:53,785 INFO L225 Difference]: With dead ends: 298 [2018-11-28 17:27:53,785 INFO L226 Difference]: Without dead ends: 295 [2018-11-28 17:27:53,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 17:27:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-28 17:27:53,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2018-11-28 17:27:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-28 17:27:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 408 transitions. [2018-11-28 17:27:53,794 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 408 transitions. Word has length 121 [2018-11-28 17:27:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:53,794 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 408 transitions. [2018-11-28 17:27:53,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 17:27:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 408 transitions. [2018-11-28 17:27:53,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-28 17:27:53,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:53,796 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:53,796 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:53,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:53,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2006984672, now seen corresponding path program 2 times [2018-11-28 17:27:53,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:53,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:53,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:53,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 17:27:53,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:54,290 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 17:27:54,478 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-28 17:27:55,098 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 37 [2018-11-28 17:27:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 22 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:55,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:27:55,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:27:55,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 17:27:55,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 17:27:55,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 17:27:55,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:27:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 22 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:55,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:27:55,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-28 17:27:55,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 17:27:55,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 17:27:55,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-28 17:27:55,528 INFO L87 Difference]: Start difference. First operand 292 states and 408 transitions. Second operand 15 states. [2018-11-28 17:27:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:56,036 INFO L93 Difference]: Finished difference Result 295 states and 411 transitions. [2018-11-28 17:27:56,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 17:27:56,038 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 124 [2018-11-28 17:27:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:56,040 INFO L225 Difference]: With dead ends: 295 [2018-11-28 17:27:56,040 INFO L226 Difference]: Without dead ends: 293 [2018-11-28 17:27:56,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-28 17:27:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-11-28 17:27:56,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-11-28 17:27:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-28 17:27:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 409 transitions. [2018-11-28 17:27:56,052 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 409 transitions. Word has length 124 [2018-11-28 17:27:56,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:56,052 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 409 transitions. [2018-11-28 17:27:56,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 17:27:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 409 transitions. [2018-11-28 17:27:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-28 17:27:56,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:56,054 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:56,057 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:56,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1858751879, now seen corresponding path program 2 times [2018-11-28 17:27:56,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:56,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:56,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:56,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 17:27:56,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 318 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 17:27:56,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:27:56,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:27:56,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 17:27:56,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 17:27:56,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 17:27:56,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:27:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 339 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:27:57,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:27:57,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2018-11-28 17:27:57,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 17:27:57,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 17:27:57,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-11-28 17:27:57,054 INFO L87 Difference]: Start difference. First operand 293 states and 409 transitions. Second operand 21 states. [2018-11-28 17:27:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:27:57,448 INFO L93 Difference]: Finished difference Result 336 states and 469 transitions. [2018-11-28 17:27:57,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 17:27:57,449 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 135 [2018-11-28 17:27:57,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:27:57,452 INFO L225 Difference]: With dead ends: 336 [2018-11-28 17:27:57,452 INFO L226 Difference]: Without dead ends: 332 [2018-11-28 17:27:57,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-11-28 17:27:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-11-28 17:27:57,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2018-11-28 17:27:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-28 17:27:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 460 transitions. [2018-11-28 17:27:57,465 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 460 transitions. Word has length 135 [2018-11-28 17:27:57,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:27:57,465 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 460 transitions. [2018-11-28 17:27:57,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 17:27:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 460 transitions. [2018-11-28 17:27:57,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-28 17:27:57,468 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:27:57,468 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 17:27:57,468 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:27:57,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:27:57,470 INFO L82 PathProgramCache]: Analyzing trace with hash 624796254, now seen corresponding path program 3 times [2018-11-28 17:27:57,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:27:57,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:27:57,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:57,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 17:27:57,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:27:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:27:57,891 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 17:27:58,066 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 17:27:58,566 WARN L180 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-11-28 17:27:58,771 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-28 17:27:59,651 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 39 [2018-11-28 17:28:00,128 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 36 [2018-11-28 17:28:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 26 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:28:00,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:28:00,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:28:00,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 17:28:00,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-28 17:28:00,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 17:28:00,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:28:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 208 proven. 26 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-11-28 17:28:00,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:28:00,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 23 [2018-11-28 17:28:00,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 17:28:00,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 17:28:00,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-11-28 17:28:00,753 INFO L87 Difference]: Start difference. First operand 329 states and 460 transitions. Second operand 23 states. [2018-11-28 17:28:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:28:02,443 INFO L93 Difference]: Finished difference Result 349 states and 481 transitions. [2018-11-28 17:28:02,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-28 17:28:02,444 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 145 [2018-11-28 17:28:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:28:02,445 INFO L225 Difference]: With dead ends: 349 [2018-11-28 17:28:02,446 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 17:28:02,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=197, Invalid=2059, Unknown=0, NotChecked=0, Total=2256 [2018-11-28 17:28:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 17:28:02,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 17:28:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 17:28:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 17:28:02,450 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2018-11-28 17:28:02,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:28:02,450 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 17:28:02,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 17:28:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 17:28:02,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 17:28:02,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 17:28:02,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 17:28:02,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 17:28:02,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 17:28:02,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 17:28:02,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 17:28:02,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 17:28:02,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 17:28:02,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 17:28:02,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 17:28:02,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 17:28:02,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 17:28:02,801 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 28 [2018-11-28 17:28:03,249 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 44 [2018-11-28 17:28:03,258 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 17:28:03,258 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-28 17:28:03,258 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 17:28:03,258 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 17:28:03,258 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 17:28:03,258 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 17:28:03,258 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 17:28:03,258 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed. [2018-11-28 17:28:03,258 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2018-11-28 17:28:03,259 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-11-28 17:28:03,259 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-11-28 17:28:03,259 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed. [2018-11-28 17:28:03,259 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2018-11-28 17:28:03,259 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2018-11-28 17:28:03,259 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2018-11-28 17:28:03,259 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2018-11-28 17:28:03,259 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2018-11-28 17:28:03,259 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2018-11-28 17:28:03,259 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2018-11-28 17:28:03,259 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2018-11-28 17:28:03,260 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2018-11-28 17:28:03,260 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2018-11-28 17:28:03,260 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-11-28 17:28:03,260 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2018-11-28 17:28:03,260 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2018-11-28 17:28:03,260 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2018-11-28 17:28:03,260 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2018-11-28 17:28:03,260 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-11-28 17:28:03,260 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2018-11-28 17:28:03,260 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2018-11-28 17:28:03,260 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2018-11-28 17:28:03,261 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2018-11-28 17:28:03,261 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2018-11-28 17:28:03,261 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2018-11-28 17:28:03,261 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2018-11-28 17:28:03,261 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2018-11-28 17:28:03,261 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2018-11-28 17:28:03,261 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2018-11-28 17:28:03,261 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-28 17:28:03,261 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-11-28 17:28:03,261 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2018-11-28 17:28:03,261 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2018-11-28 17:28:03,262 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2018-11-28 17:28:03,262 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-11-28 17:28:03,262 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2018-11-28 17:28:03,262 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2018-11-28 17:28:03,262 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2018-11-28 17:28:03,262 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2018-11-28 17:28:03,262 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2018-11-28 17:28:03,262 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2018-11-28 17:28:03,262 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2018-11-28 17:28:03,262 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2018-11-28 17:28:03,262 INFO L448 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2018-11-28 17:28:03,262 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-11-28 17:28:03,263 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2018-11-28 17:28:03,263 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2018-11-28 17:28:03,263 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-28 17:28:03,263 INFO L448 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-11-28 17:28:03,263 INFO L444 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2018-11-28 17:28:03,263 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2018-11-28 17:28:03,263 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-28 17:28:03,263 INFO L448 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2018-11-28 17:28:03,263 INFO L444 ceAbstractionStarter]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= main_~this_expect~0 0) (<= 0 main_~this_expect~0) (= main_~q~0 0) .cse0 .cse1) (and (exists ((main_~P1~0 Int)) (let ((.cse2 (mod main_~P1~0 2))) (and (= .cse2 0) (= .cse2 (mod main_~this_expect~0 2))))) (<= 5 main_~q~0) (<= 0 (+ main_~P8~0 2147483648)) (<= main_~P8~0 2147483647) .cse0 .cse1))) [2018-11-28 17:28:03,263 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2018-11-28 17:28:03,264 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2018-11-28 17:28:03,264 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2018-11-28 17:28:03,264 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2018-11-28 17:28:03,264 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2018-11-28 17:28:03,264 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2018-11-28 17:28:03,264 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2018-11-28 17:28:03,264 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2018-11-28 17:28:03,264 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2018-11-28 17:28:03,264 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2018-11-28 17:28:03,264 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2018-11-28 17:28:03,264 INFO L448 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2018-11-28 17:28:03,265 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2018-11-28 17:28:03,265 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2018-11-28 17:28:03,265 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-11-28 17:28:03,265 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2018-11-28 17:28:03,265 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2018-11-28 17:28:03,265 INFO L444 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse0 (exists ((main_~P1~0 Int)) (let ((.cse9 (mod main_~P1~0 2))) (and (= .cse9 0) (= .cse9 (mod (+ main_~this_expect~0 1) 2)))))) (.cse6 (<= main_~this_buffer_empty~0 1)) (.cse7 (<= 1 main_~this_buffer_empty~0)) (.cse5 (exists ((main_~P1~0 Int)) (let ((.cse8 (mod main_~P1~0 2))) (and (= .cse8 0) (= .cse8 (mod main_~this_expect~0 2)))))) (.cse1 (<= 0 (+ main_~P8~0 2147483648))) (.cse2 (<= main_~P8~0 2147483647)) (.cse3 (<= main_~this_buffer_empty~0 0)) (.cse4 (<= 0 main_~this_buffer_empty~0))) (or (and .cse0 .cse1 (= main_~q~0 3) .cse2 .cse3 .cse4) (and .cse5 (= main_~q~0 1) .cse6 .cse1 .cse7 .cse2) (and .cse0 .cse6 .cse1 (= main_~q~0 4) .cse7 .cse2) (and .cse5 (<= 5 main_~q~0) .cse1 .cse2 .cse3 .cse4) (and (<= main_~this_expect~0 0) (= main_~q~0 0) (<= 0 main_~this_expect~0) .cse3 .cse4))) [2018-11-28 17:28:03,265 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2018-11-28 17:28:03,265 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2018-11-28 17:28:03,265 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2018-11-28 17:28:03,266 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2018-11-28 17:28:03,266 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2018-11-28 17:28:03,266 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2018-11-28 17:28:03,266 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2018-11-28 17:28:03,266 INFO L448 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2018-11-28 17:28:03,266 INFO L448 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2018-11-28 17:28:03,266 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2018-11-28 17:28:03,266 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2018-11-28 17:28:03,266 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2018-11-28 17:28:03,266 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2018-11-28 17:28:03,266 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true [2018-11-28 17:28:03,266 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2018-11-28 17:28:03,267 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2018-11-28 17:28:03,267 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2018-11-28 17:28:03,267 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-11-28 17:28:03,267 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2018-11-28 17:28:03,267 INFO L448 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2018-11-28 17:28:03,267 INFO L448 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2018-11-28 17:28:03,267 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2018-11-28 17:28:03,267 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2018-11-28 17:28:03,267 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2018-11-28 17:28:03,267 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2018-11-28 17:28:03,267 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2018-11-28 17:28:03,268 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-28 17:28:03,268 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-11-28 17:28:03,268 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2018-11-28 17:28:03,268 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2018-11-28 17:28:03,268 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2018-11-28 17:28:03,268 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2018-11-28 17:28:03,268 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-11-28 17:28:03,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,275 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,283 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,283 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,285 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,285 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,285 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:28:03 BoogieIcfgContainer [2018-11-28 17:28:03,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 17:28:03,293 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 17:28:03,293 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 17:28:03,294 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 17:28:03,294 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:27:22" (3/4) ... [2018-11-28 17:28:03,298 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 17:28:03,305 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 17:28:03,305 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 17:28:03,315 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 17:28:03,316 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 17:28:03,363 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) [2018-11-28 17:28:03,381 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 17:28:03,381 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 17:28:03,383 INFO L168 Benchmark]: Toolchain (without parser) took 43684.81 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 447.2 MB). Free memory was 948.7 MB in the beginning and 904.1 MB in the end (delta: 44.5 MB). Peak memory consumption was 491.8 MB. Max. memory is 11.5 GB. [2018-11-28 17:28:03,385 INFO L168 Benchmark]: CDTParser took 0.67 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 17:28:03,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.64 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 927.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 17:28:03,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.70 ms. Allocated memory is still 1.0 GB. Free memory was 927.2 MB in the beginning and 921.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 17:28:03,386 INFO L168 Benchmark]: Boogie Preprocessor took 170.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -204.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-28 17:28:03,388 INFO L168 Benchmark]: RCFGBuilder took 1855.45 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: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. [2018-11-28 17:28:03,389 INFO L168 Benchmark]: TraceAbstraction took 41008.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 306.7 MB). Free memory was 1.1 GB in the beginning and 904.1 MB in the end (delta: 169.9 MB). Peak memory consumption was 476.6 MB. Max. memory is 11.5 GB. [2018-11-28 17:28:03,389 INFO L168 Benchmark]: Witness Printer took 88.15 ms. Allocated memory is still 1.5 GB. Free memory is still 904.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 17:28:03,395 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.67 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 521.64 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 927.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.70 ms. Allocated memory is still 1.0 GB. Free memory was 927.2 MB in the beginning and 921.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 170.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -204.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1855.45 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: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41008.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 306.7 MB). Free memory was 1.1 GB in the beginning and 904.1 MB in the end (delta: 169.9 MB). Peak memory consumption was 476.6 MB. Max. memory is 11.5 GB. * Witness Printer took 88.15 ms. Allocated memory is still 1.5 GB. Free memory is still 904.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] * 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: 24]: Loop Invariant [2018-11-28 17:28:03,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - InvariantResult [Line: 24]: Loop Invariant [2018-11-28 17:28:03,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-28 17:28:03,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: (((((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && 0 <= P8 + 2147483648) && q == 3) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && q == 1) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && q == 4) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || ((((this_expect <= 0 && q == 0) && 0 <= this_expect) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 40.9s OverallTime, 25 OverallIterations, 14 TraceHistogramMax, 11.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 4868 SDtfs, 3639 SDslu, 26546 SDs, 0 SdLazy, 3565 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1536 GetRequests, 1303 SyntacticMatches, 27 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 23.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 98 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 49 NumberOfFragments, 203 HoareAnnotationTreeSize, 7 FomulaSimplifications, 3029 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 783 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 24.6s InterpolantComputationTime, 2852 NumberOfCodeBlocks, 2768 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2811 ConstructedInterpolants, 42 QuantifiedInterpolants, 2653149 SizeOfPredicates, 58 NumberOfNonLiveVariables, 8173 ConjunctsInSsa, 452 ConjunctsInUnsatCore, 41 InterpolantComputations, 10 PerfectInterpolantSequences, 1038/4848 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...