/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/locks/test_locks_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:06:17,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:06:17,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:06:17,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:06:17,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:06:17,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:06:17,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:06:17,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:06:17,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:06:17,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:06:17,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:06:17,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:06:17,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:06:17,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:06:17,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:06:17,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:06:17,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:06:17,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:06:17,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:06:17,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:06:17,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:06:17,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:06:17,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:06:17,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:06:17,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:06:17,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:06:17,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:06:17,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:06:17,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:06:17,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:06:17,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:06:17,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:06:17,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:06:17,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:06:17,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:06:17,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:06:17,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:06:17,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:06:17,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:06:17,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:06:17,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:06:17,605 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:06:17,619 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:06:17,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:06:17,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:06:17,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:06:17,621 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:06:17,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:06:17,622 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:06:17,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:06:17,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:06:17,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:06:17,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:06:17,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:06:17,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:06:17,623 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:06:17,623 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:06:17,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:06:17,624 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:06:17,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:06:17,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:06:17,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:06:17,624 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:06:17,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:06:17,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:06:17,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:06:17,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:06:17,625 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:06:17,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:06:17,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:06:17,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:06:17,626 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:06:17,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:06:17,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:06:17,916 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:06:17,917 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:06:17,918 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:06:17,918 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2019-11-23 22:06:17,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79564b868/8dc2c4d2b3394318bd9b2883c36bd281/FLAGf3fa8c748 [2019-11-23 22:06:18,401 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:06:18,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2019-11-23 22:06:18,409 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79564b868/8dc2c4d2b3394318bd9b2883c36bd281/FLAGf3fa8c748 [2019-11-23 22:06:18,806 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79564b868/8dc2c4d2b3394318bd9b2883c36bd281 [2019-11-23 22:06:18,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:06:18,819 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:06:18,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:18,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:06:18,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:06:18,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:18" (1/1) ... [2019-11-23 22:06:18,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9ac29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:18, skipping insertion in model container [2019-11-23 22:06:18,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:18" (1/1) ... [2019-11-23 22:06:18,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:06:18,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:06:19,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:19,079 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:06:19,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:19,130 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:06:19,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:19 WrapperNode [2019-11-23 22:06:19,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:19,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:19,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:06:19,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:06:19,222 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:06:19" (1/1) ... [2019-11-23 22:06:19,232 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:06:19" (1/1) ... [2019-11-23 22:06:19,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:19,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:06:19,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:06:19,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:06:19,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:19" (1/1) ... [2019-11-23 22:06:19,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:19" (1/1) ... [2019-11-23 22:06:19,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:19" (1/1) ... [2019-11-23 22:06:19,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:19" (1/1) ... [2019-11-23 22:06:19,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:19" (1/1) ... [2019-11-23 22:06:19,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:19" (1/1) ... [2019-11-23 22:06:19,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:19" (1/1) ... [2019-11-23 22:06:19,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:06:19,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:06:19,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:06:19,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:06:19,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:19" (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:06:19,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:06:19,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:06:19,751 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:06:19,751 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-23 22:06:19,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:19 BoogieIcfgContainer [2019-11-23 22:06:19,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:06:19,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:06:19,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:06:19,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:06:19,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:06:18" (1/3) ... [2019-11-23 22:06:19,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85e7615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:19, skipping insertion in model container [2019-11-23 22:06:19,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:19" (2/3) ... [2019-11-23 22:06:19,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85e7615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:19, skipping insertion in model container [2019-11-23 22:06:19,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:19" (3/3) ... [2019-11-23 22:06:19,762 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-11-23 22:06:19,772 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:06:19,783 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:06:19,799 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:06:19,824 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:06:19,825 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:06:19,825 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:06:19,825 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:06:19,825 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:06:19,825 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:06:19,826 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:06:19,826 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:06:19,839 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-11-23 22:06:19,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:06:19,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:19,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:19,846 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:19,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:19,851 INFO L82 PathProgramCache]: Analyzing trace with hash -233107426, now seen corresponding path program 1 times [2019-11-23 22:06:19,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:19,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624189569] [2019-11-23 22:06:19,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:20,056 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:06:20,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624189569] [2019-11-23 22:06:20,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:20,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:20,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769730627] [2019-11-23 22:06:20,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:20,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:20,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:20,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:20,088 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-11-23 22:06:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:20,175 INFO L93 Difference]: Finished difference Result 88 states and 156 transitions. [2019-11-23 22:06:20,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:20,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-23 22:06:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:20,193 INFO L225 Difference]: With dead ends: 88 [2019-11-23 22:06:20,193 INFO L226 Difference]: Without dead ends: 74 [2019-11-23 22:06:20,196 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:06:20,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-23 22:06:20,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2019-11-23 22:06:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-23 22:06:20,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 93 transitions. [2019-11-23 22:06:20,242 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 93 transitions. Word has length 17 [2019-11-23 22:06:20,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:20,242 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 93 transitions. [2019-11-23 22:06:20,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 93 transitions. [2019-11-23 22:06:20,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:06:20,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:20,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:20,244 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:20,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:20,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1244224676, now seen corresponding path program 1 times [2019-11-23 22:06:20,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:20,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880726006] [2019-11-23 22:06:20,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:20,318 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:06:20,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880726006] [2019-11-23 22:06:20,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:20,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:20,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690457406] [2019-11-23 22:06:20,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:20,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:20,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:20,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:20,322 INFO L87 Difference]: Start difference. First operand 50 states and 93 transitions. Second operand 3 states. [2019-11-23 22:06:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:20,363 INFO L93 Difference]: Finished difference Result 123 states and 228 transitions. [2019-11-23 22:06:20,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:20,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-23 22:06:20,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:20,365 INFO L225 Difference]: With dead ends: 123 [2019-11-23 22:06:20,366 INFO L226 Difference]: Without dead ends: 74 [2019-11-23 22:06:20,367 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:06:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-23 22:06:20,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-11-23 22:06:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-23 22:06:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 133 transitions. [2019-11-23 22:06:20,380 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 133 transitions. Word has length 17 [2019-11-23 22:06:20,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:20,381 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 133 transitions. [2019-11-23 22:06:20,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:20,382 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 133 transitions. [2019-11-23 22:06:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:06:20,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:20,382 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:20,383 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:20,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:20,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817409, now seen corresponding path program 1 times [2019-11-23 22:06:20,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:20,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921392664] [2019-11-23 22:06:20,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:20,437 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:06:20,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921392664] [2019-11-23 22:06:20,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:20,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:20,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472682746] [2019-11-23 22:06:20,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:20,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:20,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:20,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:20,441 INFO L87 Difference]: Start difference. First operand 72 states and 133 transitions. Second operand 3 states. [2019-11-23 22:06:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:20,467 INFO L93 Difference]: Finished difference Result 113 states and 203 transitions. [2019-11-23 22:06:20,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:20,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 22:06:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:20,470 INFO L225 Difference]: With dead ends: 113 [2019-11-23 22:06:20,470 INFO L226 Difference]: Without dead ends: 77 [2019-11-23 22:06:20,471 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:06:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-23 22:06:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-11-23 22:06:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-23 22:06:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 135 transitions. [2019-11-23 22:06:20,485 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 135 transitions. Word has length 18 [2019-11-23 22:06:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:20,485 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 135 transitions. [2019-11-23 22:06:20,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 135 transitions. [2019-11-23 22:06:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:06:20,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:20,487 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:20,487 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:20,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:20,488 INFO L82 PathProgramCache]: Analyzing trace with hash 83953731, now seen corresponding path program 1 times [2019-11-23 22:06:20,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:20,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912558623] [2019-11-23 22:06:20,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:20,562 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:06:20,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912558623] [2019-11-23 22:06:20,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:20,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:20,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111199573] [2019-11-23 22:06:20,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:20,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:20,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:20,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:20,565 INFO L87 Difference]: Start difference. First operand 75 states and 135 transitions. Second operand 3 states. [2019-11-23 22:06:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:20,586 INFO L93 Difference]: Finished difference Result 144 states and 260 transitions. [2019-11-23 22:06:20,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:20,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 22:06:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:20,588 INFO L225 Difference]: With dead ends: 144 [2019-11-23 22:06:20,588 INFO L226 Difference]: Without dead ends: 142 [2019-11-23 22:06:20,589 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:06:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-23 22:06:20,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 100. [2019-11-23 22:06:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-23 22:06:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 180 transitions. [2019-11-23 22:06:20,600 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 180 transitions. Word has length 18 [2019-11-23 22:06:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:20,600 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 180 transitions. [2019-11-23 22:06:20,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 180 transitions. [2019-11-23 22:06:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:06:20,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:20,602 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:20,602 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash -927163519, now seen corresponding path program 1 times [2019-11-23 22:06:20,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:20,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167236043] [2019-11-23 22:06:20,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:20,653 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:06:20,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167236043] [2019-11-23 22:06:20,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:20,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:20,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066130780] [2019-11-23 22:06:20,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:20,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:20,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:20,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:20,656 INFO L87 Difference]: Start difference. First operand 100 states and 180 transitions. Second operand 3 states. [2019-11-23 22:06:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:20,677 INFO L93 Difference]: Finished difference Result 240 states and 434 transitions. [2019-11-23 22:06:20,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:20,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 22:06:20,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:20,679 INFO L225 Difference]: With dead ends: 240 [2019-11-23 22:06:20,679 INFO L226 Difference]: Without dead ends: 144 [2019-11-23 22:06:20,680 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:06:20,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-23 22:06:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-11-23 22:06:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-23 22:06:20,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 254 transitions. [2019-11-23 22:06:20,693 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 254 transitions. Word has length 18 [2019-11-23 22:06:20,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:20,693 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 254 transitions. [2019-11-23 22:06:20,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:20,694 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 254 transitions. [2019-11-23 22:06:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:20,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:20,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:20,695 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:20,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:20,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1692188271, now seen corresponding path program 1 times [2019-11-23 22:06:20,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:20,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304397840] [2019-11-23 22:06:20,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:20,737 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:06:20,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304397840] [2019-11-23 22:06:20,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:20,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:20,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120813145] [2019-11-23 22:06:20,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:20,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:20,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:20,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:20,740 INFO L87 Difference]: Start difference. First operand 142 states and 254 transitions. Second operand 3 states. [2019-11-23 22:06:20,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:20,771 INFO L93 Difference]: Finished difference Result 215 states and 381 transitions. [2019-11-23 22:06:20,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:20,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:20,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:20,773 INFO L225 Difference]: With dead ends: 215 [2019-11-23 22:06:20,773 INFO L226 Difference]: Without dead ends: 146 [2019-11-23 22:06:20,774 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:06:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-23 22:06:20,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-11-23 22:06:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-23 22:06:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 254 transitions. [2019-11-23 22:06:20,799 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 254 transitions. Word has length 19 [2019-11-23 22:06:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:20,800 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 254 transitions. [2019-11-23 22:06:20,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 254 transitions. [2019-11-23 22:06:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:20,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:20,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:20,803 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:20,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1322915347, now seen corresponding path program 1 times [2019-11-23 22:06:20,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:20,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455713122] [2019-11-23 22:06:20,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:20,871 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:06:20,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455713122] [2019-11-23 22:06:20,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:20,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:20,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137926294] [2019-11-23 22:06:20,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:20,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:20,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:20,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:20,874 INFO L87 Difference]: Start difference. First operand 144 states and 254 transitions. Second operand 3 states. [2019-11-23 22:06:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:20,921 INFO L93 Difference]: Finished difference Result 416 states and 736 transitions. [2019-11-23 22:06:20,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:20,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:20,923 INFO L225 Difference]: With dead ends: 416 [2019-11-23 22:06:20,923 INFO L226 Difference]: Without dead ends: 278 [2019-11-23 22:06:20,924 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:06:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-23 22:06:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-11-23 22:06:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-23 22:06:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 482 transitions. [2019-11-23 22:06:20,938 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 482 transitions. Word has length 19 [2019-11-23 22:06:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:20,938 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 482 transitions. [2019-11-23 22:06:20,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 482 transitions. [2019-11-23 22:06:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:20,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:20,940 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:20,940 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:20,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:20,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1960934699, now seen corresponding path program 1 times [2019-11-23 22:06:20,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:20,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789405033] [2019-11-23 22:06:20,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:20,984 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:06:20,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789405033] [2019-11-23 22:06:20,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:20,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:20,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377279612] [2019-11-23 22:06:20,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:20,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:20,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:20,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:20,987 INFO L87 Difference]: Start difference. First operand 276 states and 482 transitions. Second operand 3 states. [2019-11-23 22:06:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:21,017 INFO L93 Difference]: Finished difference Result 352 states and 620 transitions. [2019-11-23 22:06:21,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:21,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:21,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:21,020 INFO L225 Difference]: With dead ends: 352 [2019-11-23 22:06:21,020 INFO L226 Difference]: Without dead ends: 350 [2019-11-23 22:06:21,021 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:06:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-11-23 22:06:21,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 276. [2019-11-23 22:06:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-23 22:06:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 478 transitions. [2019-11-23 22:06:21,033 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 478 transitions. Word has length 19 [2019-11-23 22:06:21,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:21,033 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 478 transitions. [2019-11-23 22:06:21,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 478 transitions. [2019-11-23 22:06:21,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:21,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:21,035 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:21,036 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:21,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:21,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1939083498, now seen corresponding path program 1 times [2019-11-23 22:06:21,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:21,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232911654] [2019-11-23 22:06:21,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:21,076 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:06:21,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232911654] [2019-11-23 22:06:21,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:21,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:21,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804868521] [2019-11-23 22:06:21,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:21,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:21,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:21,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:21,080 INFO L87 Difference]: Start difference. First operand 276 states and 478 transitions. Second operand 3 states. [2019-11-23 22:06:21,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:21,107 INFO L93 Difference]: Finished difference Result 516 states and 904 transitions. [2019-11-23 22:06:21,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:21,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:21,113 INFO L225 Difference]: With dead ends: 516 [2019-11-23 22:06:21,113 INFO L226 Difference]: Without dead ends: 514 [2019-11-23 22:06:21,114 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:06:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-23 22:06:21,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 384. [2019-11-23 22:06:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-23 22:06:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 654 transitions. [2019-11-23 22:06:21,136 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 654 transitions. Word has length 20 [2019-11-23 22:06:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:21,136 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 654 transitions. [2019-11-23 22:06:21,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 654 transitions. [2019-11-23 22:06:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:21,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:21,140 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:21,143 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:21,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:21,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1344766548, now seen corresponding path program 1 times [2019-11-23 22:06:21,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:21,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833831020] [2019-11-23 22:06:21,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:21,194 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:06:21,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833831020] [2019-11-23 22:06:21,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:21,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:21,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840168830] [2019-11-23 22:06:21,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:21,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:21,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:21,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:21,199 INFO L87 Difference]: Start difference. First operand 384 states and 654 transitions. Second operand 3 states. [2019-11-23 22:06:21,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:21,229 INFO L93 Difference]: Finished difference Result 916 states and 1568 transitions. [2019-11-23 22:06:21,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:21,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:21,232 INFO L225 Difference]: With dead ends: 916 [2019-11-23 22:06:21,232 INFO L226 Difference]: Without dead ends: 538 [2019-11-23 22:06:21,234 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:06:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-23 22:06:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2019-11-23 22:06:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-23 22:06:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 906 transitions. [2019-11-23 22:06:21,261 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 906 transitions. Word has length 20 [2019-11-23 22:06:21,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:21,269 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 906 transitions. [2019-11-23 22:06:21,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 906 transitions. [2019-11-23 22:06:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:21,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:21,271 INFO L410 BasicCegarLoop]: trace histogram [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:06:21,271 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:21,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:21,271 INFO L82 PathProgramCache]: Analyzing trace with hash 18167752, now seen corresponding path program 1 times [2019-11-23 22:06:21,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:21,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868016372] [2019-11-23 22:06:21,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:21,318 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:06:21,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868016372] [2019-11-23 22:06:21,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:21,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:21,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578715147] [2019-11-23 22:06:21,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:21,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:21,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:21,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:21,321 INFO L87 Difference]: Start difference. First operand 536 states and 906 transitions. Second operand 3 states. [2019-11-23 22:06:21,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:21,358 INFO L93 Difference]: Finished difference Result 812 states and 1368 transitions. [2019-11-23 22:06:21,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:21,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:21,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:21,362 INFO L225 Difference]: With dead ends: 812 [2019-11-23 22:06:21,362 INFO L226 Difference]: Without dead ends: 550 [2019-11-23 22:06:21,363 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:06:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-23 22:06:21,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2019-11-23 22:06:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-11-23 22:06:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 914 transitions. [2019-11-23 22:06:21,383 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 914 transitions. Word has length 21 [2019-11-23 22:06:21,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:21,383 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 914 transitions. [2019-11-23 22:06:21,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 914 transitions. [2019-11-23 22:06:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:21,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:21,385 INFO L410 BasicCegarLoop]: trace histogram [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:06:21,385 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:21,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:21,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1261695926, now seen corresponding path program 1 times [2019-11-23 22:06:21,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:21,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336283293] [2019-11-23 22:06:21,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:21,409 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:06:21,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336283293] [2019-11-23 22:06:21,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:21,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:21,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004965173] [2019-11-23 22:06:21,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:21,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:21,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:21,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:21,413 INFO L87 Difference]: Start difference. First operand 548 states and 914 transitions. Second operand 3 states. [2019-11-23 22:06:21,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:21,436 INFO L93 Difference]: Finished difference Result 1000 states and 1692 transitions. [2019-11-23 22:06:21,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:21,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:21,442 INFO L225 Difference]: With dead ends: 1000 [2019-11-23 22:06:21,442 INFO L226 Difference]: Without dead ends: 998 [2019-11-23 22:06:21,443 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:06:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-11-23 22:06:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 772. [2019-11-23 22:06:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-11-23 22:06:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1258 transitions. [2019-11-23 22:06:21,465 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1258 transitions. Word has length 21 [2019-11-23 22:06:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:21,465 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1258 transitions. [2019-11-23 22:06:21,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1258 transitions. [2019-11-23 22:06:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:21,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:21,467 INFO L410 BasicCegarLoop]: trace histogram [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:06:21,468 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:21,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:21,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2022154120, now seen corresponding path program 1 times [2019-11-23 22:06:21,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:21,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951848546] [2019-11-23 22:06:21,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:21,508 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:06:21,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951848546] [2019-11-23 22:06:21,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:21,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:21,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344611894] [2019-11-23 22:06:21,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:21,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:21,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:21,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:21,510 INFO L87 Difference]: Start difference. First operand 772 states and 1258 transitions. Second operand 3 states. [2019-11-23 22:06:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:21,542 INFO L93 Difference]: Finished difference Result 1816 states and 2972 transitions. [2019-11-23 22:06:21,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:21,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:21,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:21,548 INFO L225 Difference]: With dead ends: 1816 [2019-11-23 22:06:21,549 INFO L226 Difference]: Without dead ends: 1062 [2019-11-23 22:06:21,550 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:06:21,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-11-23 22:06:21,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1060. [2019-11-23 22:06:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-11-23 22:06:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1714 transitions. [2019-11-23 22:06:21,583 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1714 transitions. Word has length 21 [2019-11-23 22:06:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:21,583 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 1714 transitions. [2019-11-23 22:06:21,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1714 transitions. [2019-11-23 22:06:21,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:21,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:21,586 INFO L410 BasicCegarLoop]: trace histogram [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:06:21,586 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:21,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:21,587 INFO L82 PathProgramCache]: Analyzing trace with hash -457653655, now seen corresponding path program 1 times [2019-11-23 22:06:21,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:21,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003507169] [2019-11-23 22:06:21,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:21,639 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:06:21,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003507169] [2019-11-23 22:06:21,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:21,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:21,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776778567] [2019-11-23 22:06:21,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:21,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:21,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:21,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:21,645 INFO L87 Difference]: Start difference. First operand 1060 states and 1714 transitions. Second operand 3 states. [2019-11-23 22:06:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:21,681 INFO L93 Difference]: Finished difference Result 1592 states and 2564 transitions. [2019-11-23 22:06:21,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:21,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:21,690 INFO L225 Difference]: With dead ends: 1592 [2019-11-23 22:06:21,690 INFO L226 Difference]: Without dead ends: 1078 [2019-11-23 22:06:21,692 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:06:21,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2019-11-23 22:06:21,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1076. [2019-11-23 22:06:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-11-23 22:06:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1714 transitions. [2019-11-23 22:06:21,737 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1714 transitions. Word has length 22 [2019-11-23 22:06:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:21,737 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 1714 transitions. [2019-11-23 22:06:21,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1714 transitions. [2019-11-23 22:06:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:21,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:21,740 INFO L410 BasicCegarLoop]: trace histogram [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:06:21,740 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:21,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:21,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1737517333, now seen corresponding path program 1 times [2019-11-23 22:06:21,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:21,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879709926] [2019-11-23 22:06:21,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:21,778 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:06:21,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879709926] [2019-11-23 22:06:21,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:21,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:21,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33082255] [2019-11-23 22:06:21,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:21,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:21,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:21,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:21,780 INFO L87 Difference]: Start difference. First operand 1076 states and 1714 transitions. Second operand 3 states. [2019-11-23 22:06:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:21,821 INFO L93 Difference]: Finished difference Result 1928 states and 3124 transitions. [2019-11-23 22:06:21,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:21,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:21,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:21,832 INFO L225 Difference]: With dead ends: 1928 [2019-11-23 22:06:21,833 INFO L226 Difference]: Without dead ends: 1926 [2019-11-23 22:06:21,836 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:06:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-11-23 22:06:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1540. [2019-11-23 22:06:21,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2019-11-23 22:06:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2386 transitions. [2019-11-23 22:06:21,896 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2386 transitions. Word has length 22 [2019-11-23 22:06:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:21,897 INFO L462 AbstractCegarLoop]: Abstraction has 1540 states and 2386 transitions. [2019-11-23 22:06:21,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2386 transitions. [2019-11-23 22:06:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:21,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:21,900 INFO L410 BasicCegarLoop]: trace histogram [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:06:21,900 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:21,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:21,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1546332713, now seen corresponding path program 1 times [2019-11-23 22:06:21,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:21,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819694742] [2019-11-23 22:06:21,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:21,926 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:06:21,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819694742] [2019-11-23 22:06:21,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:21,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:21,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862329286] [2019-11-23 22:06:21,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:21,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:21,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:21,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:21,928 INFO L87 Difference]: Start difference. First operand 1540 states and 2386 transitions. Second operand 3 states. [2019-11-23 22:06:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:21,972 INFO L93 Difference]: Finished difference Result 3592 states and 5588 transitions. [2019-11-23 22:06:21,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:21,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:21,983 INFO L225 Difference]: With dead ends: 3592 [2019-11-23 22:06:21,984 INFO L226 Difference]: Without dead ends: 2086 [2019-11-23 22:06:21,986 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:06:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2019-11-23 22:06:22,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2084. [2019-11-23 22:06:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-11-23 22:06:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3202 transitions. [2019-11-23 22:06:22,048 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3202 transitions. Word has length 22 [2019-11-23 22:06:22,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:22,048 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 3202 transitions. [2019-11-23 22:06:22,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:22,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3202 transitions. [2019-11-23 22:06:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:22,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:22,051 INFO L410 BasicCegarLoop]: trace histogram [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:06:22,051 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:22,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:22,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1971752253, now seen corresponding path program 1 times [2019-11-23 22:06:22,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:22,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418965325] [2019-11-23 22:06:22,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:22,081 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:06:22,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418965325] [2019-11-23 22:06:22,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:22,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:22,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940244336] [2019-11-23 22:06:22,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:22,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:22,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:22,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:22,085 INFO L87 Difference]: Start difference. First operand 2084 states and 3202 transitions. Second operand 3 states. [2019-11-23 22:06:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:22,131 INFO L93 Difference]: Finished difference Result 3128 states and 4788 transitions. [2019-11-23 22:06:22,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:22,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:22,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:22,142 INFO L225 Difference]: With dead ends: 3128 [2019-11-23 22:06:22,143 INFO L226 Difference]: Without dead ends: 2118 [2019-11-23 22:06:22,146 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:06:22,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-11-23 22:06:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2116. [2019-11-23 22:06:22,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2116 states. [2019-11-23 22:06:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 3202 transitions. [2019-11-23 22:06:22,208 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 3202 transitions. Word has length 23 [2019-11-23 22:06:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:22,208 INFO L462 AbstractCegarLoop]: Abstraction has 2116 states and 3202 transitions. [2019-11-23 22:06:22,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 3202 transitions. [2019-11-23 22:06:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:22,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:22,212 INFO L410 BasicCegarLoop]: trace histogram [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:06:22,212 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:22,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:22,213 INFO L82 PathProgramCache]: Analyzing trace with hash 691888575, now seen corresponding path program 1 times [2019-11-23 22:06:22,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:22,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323963342] [2019-11-23 22:06:22,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:22,234 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:06:22,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323963342] [2019-11-23 22:06:22,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:22,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:22,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723983215] [2019-11-23 22:06:22,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:22,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:22,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:22,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:22,236 INFO L87 Difference]: Start difference. First operand 2116 states and 3202 transitions. Second operand 3 states. [2019-11-23 22:06:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:22,295 INFO L93 Difference]: Finished difference Result 3720 states and 5732 transitions. [2019-11-23 22:06:22,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:22,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:22,312 INFO L225 Difference]: With dead ends: 3720 [2019-11-23 22:06:22,312 INFO L226 Difference]: Without dead ends: 3718 [2019-11-23 22:06:22,314 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:06:22,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-11-23 22:06:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3076. [2019-11-23 22:06:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3076 states. [2019-11-23 22:06:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4514 transitions. [2019-11-23 22:06:22,424 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4514 transitions. Word has length 23 [2019-11-23 22:06:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:22,424 INFO L462 AbstractCegarLoop]: Abstraction has 3076 states and 4514 transitions. [2019-11-23 22:06:22,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4514 transitions. [2019-11-23 22:06:22,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:22,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:22,429 INFO L410 BasicCegarLoop]: trace histogram [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:06:22,430 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:22,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:22,430 INFO L82 PathProgramCache]: Analyzing trace with hash -319228675, now seen corresponding path program 1 times [2019-11-23 22:06:22,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:22,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611700001] [2019-11-23 22:06:22,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:22,463 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:06:22,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611700001] [2019-11-23 22:06:22,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:22,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:22,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270747624] [2019-11-23 22:06:22,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:22,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:22,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:22,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:22,465 INFO L87 Difference]: Start difference. First operand 3076 states and 4514 transitions. Second operand 3 states. [2019-11-23 22:06:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:22,546 INFO L93 Difference]: Finished difference Result 7112 states and 10468 transitions. [2019-11-23 22:06:22,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:22,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:22,565 INFO L225 Difference]: With dead ends: 7112 [2019-11-23 22:06:22,566 INFO L226 Difference]: Without dead ends: 4102 [2019-11-23 22:06:22,570 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:06:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-11-23 22:06:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 4100. [2019-11-23 22:06:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4100 states. [2019-11-23 22:06:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 5954 transitions. [2019-11-23 22:06:22,724 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 5954 transitions. Word has length 23 [2019-11-23 22:06:22,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:22,725 INFO L462 AbstractCegarLoop]: Abstraction has 4100 states and 5954 transitions. [2019-11-23 22:06:22,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:22,725 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 5954 transitions. [2019-11-23 22:06:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:22,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:22,733 INFO L410 BasicCegarLoop]: trace histogram [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:06:22,733 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:22,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash -26075586, now seen corresponding path program 1 times [2019-11-23 22:06:22,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:22,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545768139] [2019-11-23 22:06:22,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:22,775 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:06:22,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545768139] [2019-11-23 22:06:22,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:22,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:22,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047936436] [2019-11-23 22:06:22,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:22,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:22,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:22,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:22,780 INFO L87 Difference]: Start difference. First operand 4100 states and 5954 transitions. Second operand 3 states. [2019-11-23 22:06:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:22,869 INFO L93 Difference]: Finished difference Result 6152 states and 8900 transitions. [2019-11-23 22:06:22,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:22,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:22,919 INFO L225 Difference]: With dead ends: 6152 [2019-11-23 22:06:22,920 INFO L226 Difference]: Without dead ends: 4166 [2019-11-23 22:06:22,929 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:06:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2019-11-23 22:06:23,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 4164. [2019-11-23 22:06:23,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4164 states. [2019-11-23 22:06:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 5954 transitions. [2019-11-23 22:06:23,093 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 5954 transitions. Word has length 24 [2019-11-23 22:06:23,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:23,093 INFO L462 AbstractCegarLoop]: Abstraction has 4164 states and 5954 transitions. [2019-11-23 22:06:23,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 5954 transitions. [2019-11-23 22:06:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:23,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:23,099 INFO L410 BasicCegarLoop]: trace histogram [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:06:23,099 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:23,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1305939264, now seen corresponding path program 1 times [2019-11-23 22:06:23,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:23,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036140133] [2019-11-23 22:06:23,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:23,124 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:06:23,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036140133] [2019-11-23 22:06:23,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:23,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:23,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918373414] [2019-11-23 22:06:23,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:23,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:23,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:23,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:23,128 INFO L87 Difference]: Start difference. First operand 4164 states and 5954 transitions. Second operand 3 states. [2019-11-23 22:06:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:23,231 INFO L93 Difference]: Finished difference Result 7176 states and 10436 transitions. [2019-11-23 22:06:23,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:23,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:23,249 INFO L225 Difference]: With dead ends: 7176 [2019-11-23 22:06:23,249 INFO L226 Difference]: Without dead ends: 7174 [2019-11-23 22:06:23,252 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:06:23,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7174 states. [2019-11-23 22:06:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7174 to 6148. [2019-11-23 22:06:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6148 states. [2019-11-23 22:06:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 8514 transitions. [2019-11-23 22:06:23,388 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 8514 transitions. Word has length 24 [2019-11-23 22:06:23,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:23,389 INFO L462 AbstractCegarLoop]: Abstraction has 6148 states and 8514 transitions. [2019-11-23 22:06:23,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 8514 transitions. [2019-11-23 22:06:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:23,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:23,397 INFO L410 BasicCegarLoop]: trace histogram [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:06:23,398 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:23,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:23,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1977910782, now seen corresponding path program 1 times [2019-11-23 22:06:23,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:23,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997179351] [2019-11-23 22:06:23,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:23,421 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:06:23,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997179351] [2019-11-23 22:06:23,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:23,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:23,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034781304] [2019-11-23 22:06:23,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:23,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:23,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:23,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:23,424 INFO L87 Difference]: Start difference. First operand 6148 states and 8514 transitions. Second operand 3 states. [2019-11-23 22:06:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:23,531 INFO L93 Difference]: Finished difference Result 14088 states and 19524 transitions. [2019-11-23 22:06:23,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:23,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:23,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:23,547 INFO L225 Difference]: With dead ends: 14088 [2019-11-23 22:06:23,548 INFO L226 Difference]: Without dead ends: 8070 [2019-11-23 22:06:23,556 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:06:23,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8070 states. [2019-11-23 22:06:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8070 to 8068. [2019-11-23 22:06:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8068 states. [2019-11-23 22:06:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8068 states to 8068 states and 11010 transitions. [2019-11-23 22:06:23,815 INFO L78 Accepts]: Start accepts. Automaton has 8068 states and 11010 transitions. Word has length 24 [2019-11-23 22:06:23,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:23,815 INFO L462 AbstractCegarLoop]: Abstraction has 8068 states and 11010 transitions. [2019-11-23 22:06:23,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 8068 states and 11010 transitions. [2019-11-23 22:06:23,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:23,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:23,825 INFO L410 BasicCegarLoop]: trace histogram [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:06:23,829 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:23,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:23,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1829196110, now seen corresponding path program 1 times [2019-11-23 22:06:23,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:23,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370825316] [2019-11-23 22:06:23,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:23,850 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:06:23,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370825316] [2019-11-23 22:06:23,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:23,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:23,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26349501] [2019-11-23 22:06:23,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:23,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:23,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:23,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:23,853 INFO L87 Difference]: Start difference. First operand 8068 states and 11010 transitions. Second operand 3 states. [2019-11-23 22:06:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:23,951 INFO L93 Difference]: Finished difference Result 12104 states and 16452 transitions. [2019-11-23 22:06:23,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:23,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:23,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:23,966 INFO L225 Difference]: With dead ends: 12104 [2019-11-23 22:06:23,967 INFO L226 Difference]: Without dead ends: 8198 [2019-11-23 22:06:23,973 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:06:23,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8198 states. [2019-11-23 22:06:24,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8198 to 8196. [2019-11-23 22:06:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-11-23 22:06:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 11010 transitions. [2019-11-23 22:06:24,234 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 11010 transitions. Word has length 25 [2019-11-23 22:06:24,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:24,235 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 11010 transitions. [2019-11-23 22:06:24,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 11010 transitions. [2019-11-23 22:06:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:24,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:24,245 INFO L410 BasicCegarLoop]: trace histogram [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:06:24,245 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:24,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:24,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1185907508, now seen corresponding path program 1 times [2019-11-23 22:06:24,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:24,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836050790] [2019-11-23 22:06:24,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:24,263 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:06:24,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836050790] [2019-11-23 22:06:24,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:24,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:24,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150344194] [2019-11-23 22:06:24,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:24,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:24,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:24,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:24,265 INFO L87 Difference]: Start difference. First operand 8196 states and 11010 transitions. Second operand 3 states. [2019-11-23 22:06:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:24,447 INFO L93 Difference]: Finished difference Result 13832 states and 18820 transitions. [2019-11-23 22:06:24,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:24,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:24,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:24,472 INFO L225 Difference]: With dead ends: 13832 [2019-11-23 22:06:24,472 INFO L226 Difference]: Without dead ends: 13830 [2019-11-23 22:06:24,476 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:06:24,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13830 states. [2019-11-23 22:06:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13830 to 12292. [2019-11-23 22:06:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12292 states. [2019-11-23 22:06:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12292 states to 12292 states and 16002 transitions. [2019-11-23 22:06:24,716 INFO L78 Accepts]: Start accepts. Automaton has 12292 states and 16002 transitions. Word has length 25 [2019-11-23 22:06:24,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:24,717 INFO L462 AbstractCegarLoop]: Abstraction has 12292 states and 16002 transitions. [2019-11-23 22:06:24,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:24,717 INFO L276 IsEmpty]: Start isEmpty. Operand 12292 states and 16002 transitions. [2019-11-23 22:06:24,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:24,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:24,734 INFO L410 BasicCegarLoop]: trace histogram [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:06:24,734 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:24,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:24,735 INFO L82 PathProgramCache]: Analyzing trace with hash 174790258, now seen corresponding path program 1 times [2019-11-23 22:06:24,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:24,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460011425] [2019-11-23 22:06:24,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:24,754 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:06:24,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460011425] [2019-11-23 22:06:24,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:24,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:24,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291662158] [2019-11-23 22:06:24,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:24,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:24,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:24,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:24,757 INFO L87 Difference]: Start difference. First operand 12292 states and 16002 transitions. Second operand 3 states. [2019-11-23 22:06:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:25,016 INFO L93 Difference]: Finished difference Result 27912 states and 36228 transitions. [2019-11-23 22:06:25,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:25,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:25,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:25,043 INFO L225 Difference]: With dead ends: 27912 [2019-11-23 22:06:25,043 INFO L226 Difference]: Without dead ends: 15878 [2019-11-23 22:06:25,058 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:06:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2019-11-23 22:06:25,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 15876. [2019-11-23 22:06:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15876 states. [2019-11-23 22:06:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15876 states to 15876 states and 20226 transitions. [2019-11-23 22:06:25,875 INFO L78 Accepts]: Start accepts. Automaton has 15876 states and 20226 transitions. Word has length 25 [2019-11-23 22:06:25,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:25,875 INFO L462 AbstractCegarLoop]: Abstraction has 15876 states and 20226 transitions. [2019-11-23 22:06:25,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 15876 states and 20226 transitions. [2019-11-23 22:06:25,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:06:25,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:25,891 INFO L410 BasicCegarLoop]: trace histogram [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:06:25,891 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:25,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:25,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1891357165, now seen corresponding path program 1 times [2019-11-23 22:06:25,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:25,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180063935] [2019-11-23 22:06:25,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:25,907 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:06:25,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180063935] [2019-11-23 22:06:25,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:25,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:25,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503331271] [2019-11-23 22:06:25,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:25,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:25,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:25,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:25,909 INFO L87 Difference]: Start difference. First operand 15876 states and 20226 transitions. Second operand 3 states. [2019-11-23 22:06:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:26,059 INFO L93 Difference]: Finished difference Result 23816 states and 30212 transitions. [2019-11-23 22:06:26,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:26,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:06:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:26,086 INFO L225 Difference]: With dead ends: 23816 [2019-11-23 22:06:26,086 INFO L226 Difference]: Without dead ends: 16134 [2019-11-23 22:06:26,098 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:06:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16134 states. [2019-11-23 22:06:26,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16134 to 16132. [2019-11-23 22:06:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16132 states. [2019-11-23 22:06:26,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16132 states to 16132 states and 20226 transitions. [2019-11-23 22:06:26,392 INFO L78 Accepts]: Start accepts. Automaton has 16132 states and 20226 transitions. Word has length 26 [2019-11-23 22:06:26,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:26,392 INFO L462 AbstractCegarLoop]: Abstraction has 16132 states and 20226 transitions. [2019-11-23 22:06:26,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:26,392 INFO L276 IsEmpty]: Start isEmpty. Operand 16132 states and 20226 transitions. [2019-11-23 22:06:26,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:06:26,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:26,412 INFO L410 BasicCegarLoop]: trace histogram [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:06:26,412 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:26,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:26,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1123746453, now seen corresponding path program 1 times [2019-11-23 22:06:26,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:26,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528538231] [2019-11-23 22:06:26,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:26,495 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:06:26,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528538231] [2019-11-23 22:06:26,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:26,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:26,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575365830] [2019-11-23 22:06:26,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:26,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:26,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:26,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:26,497 INFO L87 Difference]: Start difference. First operand 16132 states and 20226 transitions. Second operand 3 states. [2019-11-23 22:06:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:26,731 INFO L93 Difference]: Finished difference Result 26632 states and 33540 transitions. [2019-11-23 22:06:26,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:26,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:06:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:26,779 INFO L225 Difference]: With dead ends: 26632 [2019-11-23 22:06:26,779 INFO L226 Difference]: Without dead ends: 26630 [2019-11-23 22:06:26,787 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:06:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26630 states. [2019-11-23 22:06:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26630 to 24580. [2019-11-23 22:06:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24580 states. [2019-11-23 22:06:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24580 states to 24580 states and 29954 transitions. [2019-11-23 22:06:27,556 INFO L78 Accepts]: Start accepts. Automaton has 24580 states and 29954 transitions. Word has length 26 [2019-11-23 22:06:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:27,556 INFO L462 AbstractCegarLoop]: Abstraction has 24580 states and 29954 transitions. [2019-11-23 22:06:27,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 24580 states and 29954 transitions. [2019-11-23 22:06:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:06:27,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:27,597 INFO L410 BasicCegarLoop]: trace histogram [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:06:27,597 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash 112629203, now seen corresponding path program 1 times [2019-11-23 22:06:27,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:27,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175784146] [2019-11-23 22:06:27,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:27,616 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:06:27,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175784146] [2019-11-23 22:06:27,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:27,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:27,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772318535] [2019-11-23 22:06:27,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:27,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:27,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:27,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:27,618 INFO L87 Difference]: Start difference. First operand 24580 states and 29954 transitions. Second operand 3 states. [2019-11-23 22:06:27,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:27,947 INFO L93 Difference]: Finished difference Result 55304 states and 66820 transitions. [2019-11-23 22:06:27,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:27,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:06:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:28,000 INFO L225 Difference]: With dead ends: 55304 [2019-11-23 22:06:28,001 INFO L226 Difference]: Without dead ends: 31238 [2019-11-23 22:06:28,030 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:06:28,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31238 states. [2019-11-23 22:06:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31238 to 31236. [2019-11-23 22:06:28,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31236 states. [2019-11-23 22:06:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31236 states to 31236 states and 36866 transitions. [2019-11-23 22:06:28,824 INFO L78 Accepts]: Start accepts. Automaton has 31236 states and 36866 transitions. Word has length 26 [2019-11-23 22:06:28,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:28,825 INFO L462 AbstractCegarLoop]: Abstraction has 31236 states and 36866 transitions. [2019-11-23 22:06:28,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:28,825 INFO L276 IsEmpty]: Start isEmpty. Operand 31236 states and 36866 transitions. [2019-11-23 22:06:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:06:28,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:28,843 INFO L410 BasicCegarLoop]: trace histogram [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:06:28,843 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:28,844 INFO L82 PathProgramCache]: Analyzing trace with hash 476617767, now seen corresponding path program 1 times [2019-11-23 22:06:28,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:28,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178557278] [2019-11-23 22:06:28,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:28,865 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:06:28,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178557278] [2019-11-23 22:06:28,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:28,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:28,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407020760] [2019-11-23 22:06:28,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:28,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:28,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:28,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:28,867 INFO L87 Difference]: Start difference. First operand 31236 states and 36866 transitions. Second operand 3 states. [2019-11-23 22:06:29,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:29,239 INFO L93 Difference]: Finished difference Result 46856 states and 55044 transitions. [2019-11-23 22:06:29,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:29,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:06:29,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:29,297 INFO L225 Difference]: With dead ends: 46856 [2019-11-23 22:06:29,298 INFO L226 Difference]: Without dead ends: 31750 [2019-11-23 22:06:29,318 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:06:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31750 states. [2019-11-23 22:06:30,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31750 to 31748. [2019-11-23 22:06:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2019-11-23 22:06:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 36866 transitions. [2019-11-23 22:06:31,017 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 36866 transitions. Word has length 27 [2019-11-23 22:06:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:31,018 INFO L462 AbstractCegarLoop]: Abstraction has 31748 states and 36866 transitions. [2019-11-23 22:06:31,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 36866 transitions. [2019-11-23 22:06:31,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:06:31,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:31,039 INFO L410 BasicCegarLoop]: trace histogram [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:06:31,039 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:31,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:31,040 INFO L82 PathProgramCache]: Analyzing trace with hash -803245911, now seen corresponding path program 1 times [2019-11-23 22:06:31,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:31,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347143402] [2019-11-23 22:06:31,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:31,066 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:06:31,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347143402] [2019-11-23 22:06:31,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:31,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:31,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737508578] [2019-11-23 22:06:31,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:31,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:31,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:31,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:31,073 INFO L87 Difference]: Start difference. First operand 31748 states and 36866 transitions. Second operand 3 states. [2019-11-23 22:06:32,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:32,063 INFO L93 Difference]: Finished difference Result 92166 states and 104451 transitions. [2019-11-23 22:06:32,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:32,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:06:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:32,134 INFO L225 Difference]: With dead ends: 92166 [2019-11-23 22:06:32,135 INFO L226 Difference]: Without dead ends: 31748 [2019-11-23 22:06:32,179 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:06:32,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31748 states. [2019-11-23 22:06:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31748 to 31748. [2019-11-23 22:06:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2019-11-23 22:06:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 34818 transitions. [2019-11-23 22:06:32,951 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 34818 transitions. Word has length 27 [2019-11-23 22:06:32,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:32,951 INFO L462 AbstractCegarLoop]: Abstraction has 31748 states and 34818 transitions. [2019-11-23 22:06:32,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 34818 transitions. [2019-11-23 22:06:32,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:06:32,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:32,974 INFO L410 BasicCegarLoop]: trace histogram [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:06:32,975 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:32,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:32,975 INFO L82 PathProgramCache]: Analyzing trace with hash 207871339, now seen corresponding path program 1 times [2019-11-23 22:06:32,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:32,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464942116] [2019-11-23 22:06:32,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:33,016 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:06:33,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464942116] [2019-11-23 22:06:33,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:33,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:33,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360966336] [2019-11-23 22:06:33,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:33,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:33,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:33,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:33,019 INFO L87 Difference]: Start difference. First operand 31748 states and 34818 transitions. Second operand 3 states. [2019-11-23 22:06:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:33,364 INFO L93 Difference]: Finished difference Result 31748 states and 34818 transitions. [2019-11-23 22:06:33,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:33,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:06:33,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:33,631 INFO L225 Difference]: With dead ends: 31748 [2019-11-23 22:06:33,631 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:06:33,644 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:06:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:06:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:06:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:06:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:06:33,645 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-11-23 22:06:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:33,645 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:06:33,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:06:33,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:06:33,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:06:33,672 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-23 22:06:33,672 INFO L447 ceAbstractionStarter]: At program point L176(lines 4 177) the Hoare annotation is: true [2019-11-23 22:06:33,672 INFO L444 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-11-23 22:06:33,673 INFO L444 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-11-23 22:06:33,673 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-23 22:06:33,673 INFO L440 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-11-23 22:06:33,673 INFO L444 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,673 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:06:33,673 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:06:33,673 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,673 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,674 INFO L444 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,674 INFO L444 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-11-23 22:06:33,674 INFO L444 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,674 INFO L444 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-23 22:06:33,674 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,674 INFO L444 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,674 INFO L444 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,674 INFO L444 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-11-23 22:06:33,675 INFO L444 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,675 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,675 INFO L444 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-23 22:06:33,675 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-23 22:06:33,675 INFO L444 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,675 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,675 INFO L444 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-23 22:06:33,675 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-11-23 22:06:33,676 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-23 22:06:33,676 INFO L447 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-11-23 22:06:33,676 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,676 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,676 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,676 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:06:33,676 INFO L444 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,676 INFO L444 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,677 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,677 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,677 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-23 22:06:33,677 INFO L444 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-11-23 22:06:33,677 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,677 INFO L444 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-11-23 22:06:33,677 INFO L447 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-11-23 22:06:33,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:06:33 BoogieIcfgContainer [2019-11-23 22:06:33,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:06:33,688 INFO L168 Benchmark]: Toolchain (without parser) took 14869.61 ms. Allocated memory was 137.9 MB in the beginning and 1.1 GB in the end (delta: 938.0 MB). Free memory was 102.3 MB in the beginning and 851.5 MB in the end (delta: -749.2 MB). Peak memory consumption was 188.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:33,689 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 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:06:33,690 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.20 ms. Allocated memory is still 137.9 MB. Free memory was 102.1 MB in the beginning and 91.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:33,690 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.96 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 91.1 MB in the beginning and 179.7 MB in the end (delta: -88.6 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:33,691 INFO L168 Benchmark]: Boogie Preprocessor took 53.88 ms. Allocated memory is still 201.9 MB. Free memory was 179.7 MB in the beginning and 178.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:33,691 INFO L168 Benchmark]: RCFGBuilder took 427.27 ms. Allocated memory is still 201.9 MB. Free memory was 178.0 MB in the beginning and 157.8 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:33,692 INFO L168 Benchmark]: TraceAbstraction took 13932.04 ms. Allocated memory was 201.9 MB in the beginning and 1.1 GB in the end (delta: 874.0 MB). Free memory was 157.8 MB in the beginning and 851.5 MB in the end (delta: -693.7 MB). Peak memory consumption was 180.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:33,694 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 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 312.20 ms. Allocated memory is still 137.9 MB. Free memory was 102.1 MB in the beginning and 91.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 138.96 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 91.1 MB in the beginning and 179.7 MB in the end (delta: -88.6 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.88 ms. Allocated memory is still 201.9 MB. Free memory was 179.7 MB in the beginning and 178.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 427.27 ms. Allocated memory is still 201.9 MB. Free memory was 178.0 MB in the beginning and 157.8 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13932.04 ms. Allocated memory was 201.9 MB in the beginning and 1.1 GB in the end (delta: 874.0 MB). Free memory was 157.8 MB in the beginning and 851.5 MB in the end (delta: -693.7 MB). Peak memory consumption was 180.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Result: SAFE, OverallTime: 13.8s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2722 SDtfs, 1400 SDslu, 1804 SDs, 0 SdLazy, 163 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31748occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 6176 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 2057 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 31360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 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...