/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:24:42,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:24:42,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:24:42,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:24:42,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:24:42,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:24:42,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:24:42,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:24:42,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:24:42,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:24:42,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:24:42,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:24:42,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:24:42,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:24:42,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:24:42,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:24:42,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:24:42,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:24:42,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:24:42,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:24:42,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:24:42,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:24:42,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:24:42,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:24:42,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:24:42,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:24:42,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:24:42,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:24:42,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:24:42,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:24:42,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:24:42,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:24:42,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:24:42,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:24:42,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:24:42,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:24:42,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:24:42,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:24:42,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:24:42,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:24:42,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:24:42,570 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:24:42,599 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:24:42,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:24:42,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:24:42,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:24:42,602 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:24:42,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:24:42,602 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:24:42,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:24:42,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:24:42,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:24:42,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:24:42,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:24:42,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:24:42,604 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:24:42,604 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:24:42,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:24:42,604 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:24:42,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:24:42,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:24:42,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:24:42,605 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:24:42,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:24:42,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:24:42,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:24:42,607 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:24:42,607 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:24:42,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:24:42,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:24:42,608 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:24:42,608 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:24:42,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:24:42,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:24:42,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:24:42,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:24:42,920 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:24:42,921 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-11-23 22:24:42,986 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5abf7bbcc/2627b76662be4e8e8e632dd0e9cc77dc/FLAGae8fcc164 [2019-11-23 22:24:43,491 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:24:43,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-11-23 22:24:43,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5abf7bbcc/2627b76662be4e8e8e632dd0e9cc77dc/FLAGae8fcc164 [2019-11-23 22:24:43,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5abf7bbcc/2627b76662be4e8e8e632dd0e9cc77dc [2019-11-23 22:24:43,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:24:43,869 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:24:43,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:24:43,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:24:43,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:24:43,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:24:43" (1/1) ... [2019-11-23 22:24:43,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66da9fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:43, skipping insertion in model container [2019-11-23 22:24:43,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:24:43" (1/1) ... [2019-11-23 22:24:43,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:24:43,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:24:44,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:24:44,346 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:24:44,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:24:44,474 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:24:44,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44 WrapperNode [2019-11-23 22:24:44,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:24:44,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:24:44,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:24:44,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:24:44,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:24:44,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:24:44,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:24:44,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:24:44,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... [2019-11-23 22:24:44,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:24:44,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:24:44,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:24:44,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:24:44,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:24:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:24:44,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:24:45,654 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:24:45,654 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-23 22:24:45,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:24:45 BoogieIcfgContainer [2019-11-23 22:24:45,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:24:45,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:24:45,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:24:45,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:24:45,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:24:43" (1/3) ... [2019-11-23 22:24:45,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193a05ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:24:45, skipping insertion in model container [2019-11-23 22:24:45,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:44" (2/3) ... [2019-11-23 22:24:45,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193a05ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:24:45, skipping insertion in model container [2019-11-23 22:24:45,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:24:45" (3/3) ... [2019-11-23 22:24:45,664 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2019-11-23 22:24:45,674 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:24:45,682 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:24:45,693 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:24:45,720 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:24:45,720 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:24:45,720 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:24:45,721 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:24:45,721 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:24:45,721 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:24:45,722 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:24:45,722 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:24:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2019-11-23 22:24:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 22:24:45,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:45,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:45,753 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:45,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:45,758 INFO L82 PathProgramCache]: Analyzing trace with hash 352571511, now seen corresponding path program 1 times [2019-11-23 22:24:45,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:45,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602318806] [2019-11-23 22:24:45,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:45,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602318806] [2019-11-23 22:24:45,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:45,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:24:45,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112589844] [2019-11-23 22:24:45,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 22:24:45,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:45,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 22:24:45,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 22:24:45,923 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 2 states. [2019-11-23 22:24:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:45,954 INFO L93 Difference]: Finished difference Result 216 states and 416 transitions. [2019-11-23 22:24:45,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 22:24:45,956 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-23 22:24:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:45,969 INFO L225 Difference]: With dead ends: 216 [2019-11-23 22:24:45,969 INFO L226 Difference]: Without dead ends: 100 [2019-11-23 22:24:45,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 22:24:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-23 22:24:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-23 22:24:46,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-23 22:24:46,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 165 transitions. [2019-11-23 22:24:46,021 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 165 transitions. Word has length 9 [2019-11-23 22:24:46,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:46,021 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 165 transitions. [2019-11-23 22:24:46,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 22:24:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 165 transitions. [2019-11-23 22:24:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-23 22:24:46,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:46,023 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:46,023 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:46,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:46,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697561, now seen corresponding path program 1 times [2019-11-23 22:24:46,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:46,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811380387] [2019-11-23 22:24:46,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:46,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811380387] [2019-11-23 22:24:46,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:46,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:46,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646528159] [2019-11-23 22:24:46,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:46,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:46,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:46,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:46,099 INFO L87 Difference]: Start difference. First operand 100 states and 165 transitions. Second operand 3 states. [2019-11-23 22:24:46,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:46,166 INFO L93 Difference]: Finished difference Result 201 states and 332 transitions. [2019-11-23 22:24:46,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:46,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-23 22:24:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:46,168 INFO L225 Difference]: With dead ends: 201 [2019-11-23 22:24:46,168 INFO L226 Difference]: Without dead ends: 103 [2019-11-23 22:24:46,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-23 22:24:46,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-11-23 22:24:46,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-23 22:24:46,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 168 transitions. [2019-11-23 22:24:46,181 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 168 transitions. Word has length 10 [2019-11-23 22:24:46,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:46,181 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 168 transitions. [2019-11-23 22:24:46,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 168 transitions. [2019-11-23 22:24:46,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:24:46,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:46,183 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:46,184 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:46,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:46,184 INFO L82 PathProgramCache]: Analyzing trace with hash 658032730, now seen corresponding path program 1 times [2019-11-23 22:24:46,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:46,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174304444] [2019-11-23 22:24:46,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:46,749 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 32 [2019-11-23 22:24:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:46,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174304444] [2019-11-23 22:24:46,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:46,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:24:46,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870786515] [2019-11-23 22:24:46,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:24:46,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:46,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:24:46,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:24:46,760 INFO L87 Difference]: Start difference. First operand 103 states and 168 transitions. Second operand 4 states. [2019-11-23 22:24:47,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:47,232 INFO L93 Difference]: Finished difference Result 205 states and 334 transitions. [2019-11-23 22:24:47,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:47,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-23 22:24:47,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:47,235 INFO L225 Difference]: With dead ends: 205 [2019-11-23 22:24:47,237 INFO L226 Difference]: Without dead ends: 186 [2019-11-23 22:24:47,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:24:47,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-23 22:24:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2019-11-23 22:24:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-23 22:24:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 281 transitions. [2019-11-23 22:24:47,267 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 281 transitions. Word has length 15 [2019-11-23 22:24:47,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:47,267 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 281 transitions. [2019-11-23 22:24:47,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:24:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 281 transitions. [2019-11-23 22:24:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:24:47,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:47,274 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:47,274 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:47,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:47,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1675425412, now seen corresponding path program 1 times [2019-11-23 22:24:47,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:47,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838467822] [2019-11-23 22:24:47,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:47,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838467822] [2019-11-23 22:24:47,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:47,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:47,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503765285] [2019-11-23 22:24:47,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:47,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:47,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:47,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:47,329 INFO L87 Difference]: Start difference. First operand 172 states and 281 transitions. Second operand 3 states. [2019-11-23 22:24:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:47,358 INFO L93 Difference]: Finished difference Result 293 states and 477 transitions. [2019-11-23 22:24:47,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:47,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-23 22:24:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:47,360 INFO L225 Difference]: With dead ends: 293 [2019-11-23 22:24:47,360 INFO L226 Difference]: Without dead ends: 124 [2019-11-23 22:24:47,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:47,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-23 22:24:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-11-23 22:24:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-23 22:24:47,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2019-11-23 22:24:47,369 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 16 [2019-11-23 22:24:47,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:47,369 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2019-11-23 22:24:47,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2019-11-23 22:24:47,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:24:47,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:47,372 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:47,372 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:47,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:47,373 INFO L82 PathProgramCache]: Analyzing trace with hash -843118083, now seen corresponding path program 1 times [2019-11-23 22:24:47,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:47,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345851242] [2019-11-23 22:24:47,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:24:47,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345851242] [2019-11-23 22:24:47,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:47,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:47,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152928193] [2019-11-23 22:24:47,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:47,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:47,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:47,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:47,416 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand 3 states. [2019-11-23 22:24:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:47,446 INFO L93 Difference]: Finished difference Result 226 states and 358 transitions. [2019-11-23 22:24:47,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:47,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:24:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:47,448 INFO L225 Difference]: With dead ends: 226 [2019-11-23 22:24:47,448 INFO L226 Difference]: Without dead ends: 107 [2019-11-23 22:24:47,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-23 22:24:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-11-23 22:24:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-23 22:24:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 163 transitions. [2019-11-23 22:24:47,456 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 163 transitions. Word has length 21 [2019-11-23 22:24:47,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:47,457 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 163 transitions. [2019-11-23 22:24:47,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 163 transitions. [2019-11-23 22:24:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:24:47,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:47,458 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:47,459 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:47,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:47,459 INFO L82 PathProgramCache]: Analyzing trace with hash -671640130, now seen corresponding path program 1 times [2019-11-23 22:24:47,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:47,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139187091] [2019-11-23 22:24:47,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:51,777 WARN L192 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 80 DAG size of output: 27 [2019-11-23 22:24:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:51,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139187091] [2019-11-23 22:24:51,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446062118] [2019-11-23 22:24:51,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:51,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 22:24:51,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:52,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:52,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-23 22:24:52,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273661905] [2019-11-23 22:24:52,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:24:52,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:52,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:24:52,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:24:52,011 INFO L87 Difference]: Start difference. First operand 105 states and 163 transitions. Second operand 7 states. [2019-11-23 22:24:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:52,641 INFO L93 Difference]: Finished difference Result 359 states and 564 transitions. [2019-11-23 22:24:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:24:52,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-23 22:24:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:52,644 INFO L225 Difference]: With dead ends: 359 [2019-11-23 22:24:52,645 INFO L226 Difference]: Without dead ends: 319 [2019-11-23 22:24:52,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:24:52,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-11-23 22:24:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 275. [2019-11-23 22:24:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-23 22:24:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 434 transitions. [2019-11-23 22:24:52,672 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 434 transitions. Word has length 23 [2019-11-23 22:24:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:52,672 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 434 transitions. [2019-11-23 22:24:52,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:24:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 434 transitions. [2019-11-23 22:24:52,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:24:52,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:52,677 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:52,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:52,886 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:52,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:52,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1800121285, now seen corresponding path program 1 times [2019-11-23 22:24:52,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:52,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137164448] [2019-11-23 22:24:52,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:24:52,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137164448] [2019-11-23 22:24:52,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:52,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:52,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355076941] [2019-11-23 22:24:52,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:52,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:52,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:52,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:52,923 INFO L87 Difference]: Start difference. First operand 275 states and 434 transitions. Second operand 3 states. [2019-11-23 22:24:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:52,959 INFO L93 Difference]: Finished difference Result 548 states and 861 transitions. [2019-11-23 22:24:52,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:52,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:24:52,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:52,961 INFO L225 Difference]: With dead ends: 548 [2019-11-23 22:24:52,962 INFO L226 Difference]: Without dead ends: 297 [2019-11-23 22:24:52,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:52,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-23 22:24:52,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2019-11-23 22:24:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-23 22:24:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 454 transitions. [2019-11-23 22:24:52,978 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 454 transitions. Word has length 25 [2019-11-23 22:24:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:52,978 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 454 transitions. [2019-11-23 22:24:52,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 454 transitions. [2019-11-23 22:24:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:24:52,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:52,982 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:52,982 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:52,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:52,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2124865792, now seen corresponding path program 1 times [2019-11-23 22:24:52,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:52,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839376252] [2019-11-23 22:24:52,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:53,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839376252] [2019-11-23 22:24:53,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28412082] [2019-11-23 22:24:53,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:53,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 22:24:53,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:24:53,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:24:53,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-11-23 22:24:53,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33533389] [2019-11-23 22:24:53,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:53,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:53,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:53,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:24:53,366 INFO L87 Difference]: Start difference. First operand 295 states and 454 transitions. Second operand 3 states. [2019-11-23 22:24:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:53,388 INFO L93 Difference]: Finished difference Result 298 states and 456 transitions. [2019-11-23 22:24:53,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:53,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:24:53,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:53,391 INFO L225 Difference]: With dead ends: 298 [2019-11-23 22:24:53,391 INFO L226 Difference]: Without dead ends: 292 [2019-11-23 22:24:53,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:24:53,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-23 22:24:53,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2019-11-23 22:24:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-23 22:24:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 442 transitions. [2019-11-23 22:24:53,401 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 442 transitions. Word has length 27 [2019-11-23 22:24:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:53,403 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 442 transitions. [2019-11-23 22:24:53,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 442 transitions. [2019-11-23 22:24:53,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:24:53,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:53,406 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:53,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:53,613 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:53,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:53,614 INFO L82 PathProgramCache]: Analyzing trace with hash -917092134, now seen corresponding path program 1 times [2019-11-23 22:24:53,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:53,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202514622] [2019-11-23 22:24:53,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 22:24:53,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202514622] [2019-11-23 22:24:53,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:53,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:53,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597536817] [2019-11-23 22:24:53,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:53,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:53,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:53,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:53,661 INFO L87 Difference]: Start difference. First operand 291 states and 442 transitions. Second operand 3 states. [2019-11-23 22:24:53,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:53,696 INFO L93 Difference]: Finished difference Result 510 states and 775 transitions. [2019-11-23 22:24:53,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:53,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-23 22:24:53,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:53,699 INFO L225 Difference]: With dead ends: 510 [2019-11-23 22:24:53,699 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 22:24:53,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:53,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 22:24:53,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2019-11-23 22:24:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-23 22:24:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 361 transitions. [2019-11-23 22:24:53,709 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 361 transitions. Word has length 33 [2019-11-23 22:24:53,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:53,709 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 361 transitions. [2019-11-23 22:24:53,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:53,710 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 361 transitions. [2019-11-23 22:24:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:24:53,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:53,711 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:53,711 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:53,711 INFO L82 PathProgramCache]: Analyzing trace with hash 272165387, now seen corresponding path program 1 times [2019-11-23 22:24:53,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:53,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861388287] [2019-11-23 22:24:53,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 22:24:53,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861388287] [2019-11-23 22:24:53,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:53,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:53,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036186511] [2019-11-23 22:24:53,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:53,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:53,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:53,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:53,747 INFO L87 Difference]: Start difference. First operand 241 states and 361 transitions. Second operand 3 states. [2019-11-23 22:24:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:53,795 INFO L93 Difference]: Finished difference Result 424 states and 632 transitions. [2019-11-23 22:24:53,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:53,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-23 22:24:53,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:53,797 INFO L225 Difference]: With dead ends: 424 [2019-11-23 22:24:53,797 INFO L226 Difference]: Without dead ends: 225 [2019-11-23 22:24:53,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:53,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-23 22:24:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2019-11-23 22:24:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-23 22:24:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 324 transitions. [2019-11-23 22:24:53,806 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 324 transitions. Word has length 37 [2019-11-23 22:24:53,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:53,807 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 324 transitions. [2019-11-23 22:24:53,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 324 transitions. [2019-11-23 22:24:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-23 22:24:53,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:53,809 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:53,809 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:53,809 INFO L82 PathProgramCache]: Analyzing trace with hash -140510671, now seen corresponding path program 1 times [2019-11-23 22:24:53,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:53,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833833728] [2019-11-23 22:24:53,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-23 22:24:53,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833833728] [2019-11-23 22:24:53,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:24:53,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:24:53,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385914233] [2019-11-23 22:24:53,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:24:53,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:53,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:24:53,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:53,880 INFO L87 Difference]: Start difference. First operand 223 states and 324 transitions. Second operand 3 states. [2019-11-23 22:24:53,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:53,908 INFO L93 Difference]: Finished difference Result 305 states and 442 transitions. [2019-11-23 22:24:53,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:24:53,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-23 22:24:53,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:53,910 INFO L225 Difference]: With dead ends: 305 [2019-11-23 22:24:53,910 INFO L226 Difference]: Without dead ends: 143 [2019-11-23 22:24:53,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:24:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-23 22:24:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-11-23 22:24:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-23 22:24:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 199 transitions. [2019-11-23 22:24:53,916 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 199 transitions. Word has length 46 [2019-11-23 22:24:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:53,917 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 199 transitions. [2019-11-23 22:24:53,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:24:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 199 transitions. [2019-11-23 22:24:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-23 22:24:53,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:53,918 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:53,918 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:53,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:53,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1014660280, now seen corresponding path program 1 times [2019-11-23 22:24:53,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:53,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152916448] [2019-11-23 22:24:53,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 22:24:54,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152916448] [2019-11-23 22:24:54,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501878445] [2019-11-23 22:24:54,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:54,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 22:24:54,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:54,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:54,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-23 22:24:54,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905665321] [2019-11-23 22:24:54,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:24:54,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:54,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:24:54,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:24:54,289 INFO L87 Difference]: Start difference. First operand 141 states and 199 transitions. Second operand 10 states. [2019-11-23 22:24:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:54,426 INFO L93 Difference]: Finished difference Result 167 states and 233 transitions. [2019-11-23 22:24:54,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:24:54,427 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-11-23 22:24:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:54,428 INFO L225 Difference]: With dead ends: 167 [2019-11-23 22:24:54,429 INFO L226 Difference]: Without dead ends: 160 [2019-11-23 22:24:54,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:24:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-23 22:24:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-11-23 22:24:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-23 22:24:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 220 transitions. [2019-11-23 22:24:54,436 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 220 transitions. Word has length 47 [2019-11-23 22:24:54,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:54,436 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 220 transitions. [2019-11-23 22:24:54,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:24:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 220 transitions. [2019-11-23 22:24:54,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:24:54,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:54,437 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:54,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:54,642 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:54,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:54,643 INFO L82 PathProgramCache]: Analyzing trace with hash 751253453, now seen corresponding path program 1 times [2019-11-23 22:24:54,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:54,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710578155] [2019-11-23 22:24:54,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:55,206 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 31 [2019-11-23 22:24:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:55,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710578155] [2019-11-23 22:24:55,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413892398] [2019-11-23 22:24:55,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:55,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 22:24:55,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:55,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 22:24:55,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:24:55,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:24:55,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:24:55,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:24:55,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:24:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:55,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:55,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-23 22:24:55,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18088571] [2019-11-23 22:24:55,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:24:55,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:55,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:24:55,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:24:55,510 INFO L87 Difference]: Start difference. First operand 158 states and 220 transitions. Second operand 10 states. [2019-11-23 22:24:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:55,896 INFO L93 Difference]: Finished difference Result 177 states and 246 transitions. [2019-11-23 22:24:55,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:24:55,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-11-23 22:24:55,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:55,898 INFO L225 Difference]: With dead ends: 177 [2019-11-23 22:24:55,898 INFO L226 Difference]: Without dead ends: 175 [2019-11-23 22:24:55,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:24:55,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-23 22:24:55,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-11-23 22:24:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-23 22:24:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 243 transitions. [2019-11-23 22:24:55,905 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 243 transitions. Word has length 57 [2019-11-23 22:24:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:55,906 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 243 transitions. [2019-11-23 22:24:55,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:24:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 243 transitions. [2019-11-23 22:24:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 22:24:55,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:55,907 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:56,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:56,118 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:56,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:56,118 INFO L82 PathProgramCache]: Analyzing trace with hash 384172331, now seen corresponding path program 1 times [2019-11-23 22:24:56,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:56,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127781522] [2019-11-23 22:24:56,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:56,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127781522] [2019-11-23 22:24:56,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032837507] [2019-11-23 22:24:56,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:56,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-23 22:24:56,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:24:56,692 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:24:56,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:24:56,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2019-11-23 22:24:56,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545155429] [2019-11-23 22:24:56,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:24:56,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:24:56,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:24:56,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:24:56,694 INFO L87 Difference]: Start difference. First operand 174 states and 243 transitions. Second operand 9 states. [2019-11-23 22:24:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:24:56,806 INFO L93 Difference]: Finished difference Result 194 states and 270 transitions. [2019-11-23 22:24:56,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:24:56,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-23 22:24:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:24:56,808 INFO L225 Difference]: With dead ends: 194 [2019-11-23 22:24:56,808 INFO L226 Difference]: Without dead ends: 192 [2019-11-23 22:24:56,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:24:56,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-23 22:24:56,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-11-23 22:24:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-23 22:24:56,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 268 transitions. [2019-11-23 22:24:56,815 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 268 transitions. Word has length 66 [2019-11-23 22:24:56,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:24:56,816 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 268 transitions. [2019-11-23 22:24:56,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:24:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 268 transitions. [2019-11-23 22:24:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 22:24:56,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:24:56,817 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:24:57,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:24:57,021 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:24:57,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:24:57,022 INFO L82 PathProgramCache]: Analyzing trace with hash -2057891779, now seen corresponding path program 1 times [2019-11-23 22:24:57,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:24:57,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550633447] [2019-11-23 22:24:57,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:24:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:24:59,565 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 74 DAG size of output: 21 [2019-11-23 22:25:03,906 WARN L192 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 169 DAG size of output: 31 [2019-11-23 22:25:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 90 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 22:25:03,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550633447] [2019-11-23 22:25:03,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171376875] [2019-11-23 22:25:03,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:25:04,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-23 22:25:04,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:25:04,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:25:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:25:04,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:25:04,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-11-23 22:25:04,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456609232] [2019-11-23 22:25:04,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 22:25:04,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:25:04,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 22:25:04,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-11-23 22:25:04,311 INFO L87 Difference]: Start difference. First operand 192 states and 268 transitions. Second operand 16 states. [2019-11-23 22:25:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:25:04,499 INFO L93 Difference]: Finished difference Result 211 states and 295 transitions. [2019-11-23 22:25:04,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 22:25:04,499 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 78 [2019-11-23 22:25:04,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:25:04,500 INFO L225 Difference]: With dead ends: 211 [2019-11-23 22:25:04,500 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:25:04,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-11-23 22:25:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:25:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:25:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:25:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:25:04,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-11-23 22:25:04,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:25:04,502 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:25:04,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 22:25:04,502 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:25:04,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:25:04,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:25:04,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:25:04,952 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-11-23 22:25:05,027 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2019-11-23 22:25:05,027 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-11-23 22:25:05,028 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-23 22:25:05,028 INFO L444 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2019-11-23 22:25:05,028 INFO L444 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2019-11-23 22:25:05,028 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2019-11-23 22:25:05,028 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2019-11-23 22:25:05,028 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2019-11-23 22:25:05,028 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2019-11-23 22:25:05,028 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2019-11-23 22:25:05,029 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2019-11-23 22:25:05,029 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2019-11-23 22:25:05,029 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2019-11-23 22:25:05,029 INFO L444 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2019-11-23 22:25:05,029 INFO L444 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2019-11-23 22:25:05,029 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2019-11-23 22:25:05,029 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2019-11-23 22:25:05,030 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2019-11-23 22:25:05,030 INFO L444 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2019-11-23 22:25:05,030 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2019-11-23 22:25:05,030 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2019-11-23 22:25:05,030 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2019-11-23 22:25:05,030 INFO L444 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2019-11-23 22:25:05,031 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2019-11-23 22:25:05,031 INFO L444 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2019-11-23 22:25:05,031 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2019-11-23 22:25:05,031 INFO L444 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2019-11-23 22:25:05,031 INFO L444 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2019-11-23 22:25:05,031 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2019-11-23 22:25:05,031 INFO L444 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-11-23 22:25:05,032 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-11-23 22:25:05,032 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2019-11-23 22:25:05,032 INFO L444 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2019-11-23 22:25:05,032 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2019-11-23 22:25:05,032 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2019-11-23 22:25:05,032 INFO L447 ceAbstractionStarter]: At program point L14(lines 14 566) the Hoare annotation is: true [2019-11-23 22:25:05,032 INFO L444 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2019-11-23 22:25:05,032 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2019-11-23 22:25:05,033 INFO L444 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2019-11-23 22:25:05,033 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2019-11-23 22:25:05,033 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2019-11-23 22:25:05,033 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-11-23 22:25:05,033 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2019-11-23 22:25:05,033 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2019-11-23 22:25:05,033 INFO L444 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-23 22:25:05,033 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-11-23 22:25:05,033 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2019-11-23 22:25:05,034 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2019-11-23 22:25:05,034 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-23 22:25:05,034 INFO L444 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-11-23 22:25:05,034 INFO L440 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2019-11-23 22:25:05,034 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2019-11-23 22:25:05,034 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-11-23 22:25:05,034 INFO L444 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2019-11-23 22:25:05,034 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:25:05,034 INFO L440 ceAbstractionStarter]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~this_buffer_empty~0 0))) (or (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 2)) 2)) 2)) (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648)) (<= ULTIMATE.start_main_~P8~0 2147483647)) (and .cse0 (<= 0 ULTIMATE.start_main_~this_expect~0) (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0)))) [2019-11-23 22:25:05,035 INFO L444 ceAbstractionStarter]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2019-11-23 22:25:05,035 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:25:05,035 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2019-11-23 22:25:05,035 INFO L444 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2019-11-23 22:25:05,035 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2019-11-23 22:25:05,035 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2019-11-23 22:25:05,035 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2019-11-23 22:25:05,035 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2019-11-23 22:25:05,035 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2019-11-23 22:25:05,035 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2019-11-23 22:25:05,035 INFO L444 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2019-11-23 22:25:05,035 INFO L444 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2019-11-23 22:25:05,035 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2019-11-23 22:25:05,035 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2019-11-23 22:25:05,036 INFO L444 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-11-23 22:25:05,036 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2019-11-23 22:25:05,036 INFO L444 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2019-11-23 22:25:05,036 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:25:05,036 INFO L440 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 2)) 2)) 2))) (.cse0 (= ULTIMATE.start_main_~this_buffer_empty~0 0)) (.cse5 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 1)) 2)) 1))) (.cse4 (= ULTIMATE.start_main_~this_buffer_empty~0 1)) (.cse2 (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648))) (.cse3 (<= ULTIMATE.start_main_~P8~0 2147483647))) (or (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_main_~q~0 1) .cse1 .cse4 .cse2 .cse3) (and (= ULTIMATE.start_main_~q~0 3) .cse0 .cse5 .cse2 .cse3) (and .cse0 (<= 0 ULTIMATE.start_main_~this_expect~0) (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0)) (and .cse5 (= ULTIMATE.start_main_~q~0 4) .cse4 .cse2 .cse3))) [2019-11-23 22:25:05,036 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2019-11-23 22:25:05,036 INFO L444 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2019-11-23 22:25:05,036 INFO L444 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2019-11-23 22:25:05,036 INFO L444 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2019-11-23 22:25:05,036 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2019-11-23 22:25:05,036 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2019-11-23 22:25:05,036 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2019-11-23 22:25:05,037 INFO L444 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2019-11-23 22:25:05,037 INFO L444 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2019-11-23 22:25:05,037 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2019-11-23 22:25:05,037 INFO L444 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2019-11-23 22:25:05,037 INFO L444 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2019-11-23 22:25:05,037 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2019-11-23 22:25:05,037 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2019-11-23 22:25:05,037 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2019-11-23 22:25:05,037 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2019-11-23 22:25:05,037 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2019-11-23 22:25:05,038 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2019-11-23 22:25:05,038 INFO L444 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2019-11-23 22:25:05,038 INFO L444 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2019-11-23 22:25:05,038 INFO L444 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2019-11-23 22:25:05,038 INFO L444 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2019-11-23 22:25:05,038 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 22:25:05,038 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2019-11-23 22:25:05,038 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-23 22:25:05,038 INFO L444 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2019-11-23 22:25:05,038 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2019-11-23 22:25:05,038 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-11-23 22:25:05,039 INFO L444 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2019-11-23 22:25:05,039 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2019-11-23 22:25:05,039 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2019-11-23 22:25:05,039 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2019-11-23 22:25:05,039 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-11-23 22:25:05,039 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-11-23 22:25:05,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:25:05 BoogieIcfgContainer [2019-11-23 22:25:05,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:25:05,058 INFO L168 Benchmark]: Toolchain (without parser) took 21189.48 ms. Allocated memory was 138.4 MB in the beginning and 319.3 MB in the end (delta: 180.9 MB). Free memory was 102.6 MB in the beginning and 246.3 MB in the end (delta: -143.7 MB). Peak memory consumption was 199.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:25:05,059 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 22:25:05,060 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.26 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 102.3 MB in the beginning and 173.7 MB in the end (delta: -71.4 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:25:05,060 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.62 ms. Allocated memory is still 201.9 MB. Free memory was 173.7 MB in the beginning and 168.1 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-11-23 22:25:05,061 INFO L168 Benchmark]: Boogie Preprocessor took 52.67 ms. Allocated memory is still 201.9 MB. Free memory was 168.1 MB in the beginning and 165.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:25:05,062 INFO L168 Benchmark]: RCFGBuilder took 1049.79 ms. Allocated memory is still 201.9 MB. Free memory was 165.4 MB in the beginning and 111.6 MB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:25:05,063 INFO L168 Benchmark]: TraceAbstraction took 19399.36 ms. Allocated memory was 201.9 MB in the beginning and 319.3 MB in the end (delta: 117.4 MB). Free memory was 111.6 MB in the beginning and 246.3 MB in the end (delta: -134.6 MB). Peak memory consumption was 145.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:25:05,067 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 605.26 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 102.3 MB in the beginning and 173.7 MB in the end (delta: -71.4 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.62 ms. Allocated memory is still 201.9 MB. Free memory was 173.7 MB in the beginning and 168.1 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.67 ms. Allocated memory is still 201.9 MB. Free memory was 168.1 MB in the beginning and 165.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1049.79 ms. Allocated memory is still 201.9 MB. Free memory was 165.4 MB in the beginning and 111.6 MB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19399.36 ms. Allocated memory was 201.9 MB in the beginning and 319.3 MB in the end (delta: 117.4 MB). Free memory was 111.6 MB in the beginning and 246.3 MB in the end (delta: -134.6 MB). Peak memory consumption was 145.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((5 <= q && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || ((((q == 1 && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || ((((q == 3 && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -1) / 2) + 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || (((this_buffer_empty == 0 && 0 <= this_expect) && this_expect <= 0) && q == 0)) || ((((this_expect <= 2 * ((this_expect + -1) / 2) + 1 && q == 4) && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((5 <= q && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || (((this_buffer_empty == 0 && 0 <= this_expect) && this_expect <= 0) && q == 0) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 1 error locations. Result: SAFE, OverallTime: 19.3s, OverallIterations: 15, TraceHistogramMax: 8, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 2279 SDtfs, 1913 SDslu, 5120 SDs, 0 SdLazy, 831 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 306 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 74 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 20 NumberOfFragments, 160 HoareAnnotationTreeSize, 4 FomulaSimplifications, 983 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 257 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 501405 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2024 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 215/668 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...