/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_13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:06:21,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:06:21,849 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:06:21,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:06:21,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:06:21,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:06:21,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:06:21,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:06:21,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:06:21,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:06:21,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:06:21,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:06:21,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:06:21,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:06:21,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:06:21,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:06:21,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:06:21,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:06:21,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:06:21,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:06:21,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:06:21,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:06:21,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:06:21,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:06:21,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:06:21,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:06:21,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:06:21,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:06:21,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:06:21,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:06:21,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:06:21,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:06:21,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:06:21,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:06:21,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:06:21,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:06:21,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:06:21,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:06:21,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:06:21,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:06:21,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:06:21,909 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:21,922 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:06:21,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:06:21,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:06:21,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:06:21,924 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:06:21,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:06:21,925 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:06:21,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:06:21,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:06:21,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:06:21,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:06:21,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:06:21,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:06:21,926 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:06:21,926 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:06:21,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:06:21,927 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:06:21,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:06:21,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:06:21,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:06:21,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:06:21,928 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:06:21,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:06:21,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:06:21,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:06:21,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:06:21,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:06:21,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:06:21,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:06:21,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:06:22,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:06:22,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:06:22,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:06:22,220 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:06:22,220 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:06:22,221 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2019-11-23 22:06:22,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2c94203/298f8271bb0147d481a11acab23acf88/FLAGcbe5c4032 [2019-11-23 22:06:22,770 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:06:22,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2019-11-23 22:06:22,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2c94203/298f8271bb0147d481a11acab23acf88/FLAGcbe5c4032 [2019-11-23 22:06:23,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2c94203/298f8271bb0147d481a11acab23acf88 [2019-11-23 22:06:23,162 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:06:23,164 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:06:23,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:23,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:06:23,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:06:23,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:23" (1/1) ... [2019-11-23 22:06:23,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a725cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:23, skipping insertion in model container [2019-11-23 22:06:23,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:23" (1/1) ... [2019-11-23 22:06:23,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:06:23,203 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:06:23,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:23,385 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:06:23,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:23,512 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:06:23,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:23 WrapperNode [2019-11-23 22:06:23,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:23,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:23,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:06:23,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:06:23,520 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:23" (1/1) ... [2019-11-23 22:06:23,525 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:23" (1/1) ... [2019-11-23 22:06:23,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:23,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:06:23,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:06:23,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:06:23,562 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:23" (1/1) ... [2019-11-23 22:06:23,563 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:23" (1/1) ... [2019-11-23 22:06:23,564 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:23" (1/1) ... [2019-11-23 22:06:23,565 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:23" (1/1) ... [2019-11-23 22:06:23,568 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:23" (1/1) ... [2019-11-23 22:06:23,576 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:23" (1/1) ... [2019-11-23 22:06:23,578 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:23" (1/1) ... [2019-11-23 22:06:23,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:06:23,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:06:23,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:06:23,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:06:23,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:23" (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:23,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:06:23,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:06:24,018 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:06:24,019 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-23 22:06:24,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:24 BoogieIcfgContainer [2019-11-23 22:06:24,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:06:24,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:06:24,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:06:24,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:06:24,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:06:23" (1/3) ... [2019-11-23 22:06:24,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@620c8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:24, skipping insertion in model container [2019-11-23 22:06:24,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:23" (2/3) ... [2019-11-23 22:06:24,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@620c8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:24, skipping insertion in model container [2019-11-23 22:06:24,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:24" (3/3) ... [2019-11-23 22:06:24,028 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-11-23 22:06:24,036 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:06:24,041 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:06:24,051 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:06:24,076 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:06:24,076 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:06:24,076 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:06:24,076 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:06:24,076 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:06:24,077 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:06:24,077 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:06:24,077 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:06:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-11-23 22:06:24,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:24,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:24,096 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:24,096 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:24,101 INFO L82 PathProgramCache]: Analyzing trace with hash -677951942, now seen corresponding path program 1 times [2019-11-23 22:06:24,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:24,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442164702] [2019-11-23 22:06:24,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:24,320 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,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442164702] [2019-11-23 22:06:24,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:24,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:24,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343040039] [2019-11-23 22:06:24,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:24,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:24,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:24,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:24,346 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2019-11-23 22:06:24,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:24,422 INFO L93 Difference]: Finished difference Result 100 states and 180 transitions. [2019-11-23 22:06:24,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:24,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:24,450 INFO L225 Difference]: With dead ends: 100 [2019-11-23 22:06:24,450 INFO L226 Difference]: Without dead ends: 86 [2019-11-23 22:06:24,456 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,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-23 22:06:24,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 58. [2019-11-23 22:06:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-23 22:06:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 109 transitions. [2019-11-23 22:06:24,539 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 109 transitions. Word has length 19 [2019-11-23 22:06:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:24,540 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 109 transitions. [2019-11-23 22:06:24,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 109 transitions. [2019-11-23 22:06:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:24,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:24,542 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:24,543 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:24,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:24,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1699020296, now seen corresponding path program 1 times [2019-11-23 22:06:24,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:24,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524932923] [2019-11-23 22:06:24,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:24,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:24,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524932923] [2019-11-23 22:06:24,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:24,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:24,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481855897] [2019-11-23 22:06:24,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:24,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:24,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:24,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:24,662 INFO L87 Difference]: Start difference. First operand 58 states and 109 transitions. Second operand 3 states. [2019-11-23 22:06:24,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:24,699 INFO L93 Difference]: Finished difference Result 143 states and 268 transitions. [2019-11-23 22:06:24,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:24,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:24,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:24,702 INFO L225 Difference]: With dead ends: 143 [2019-11-23 22:06:24,702 INFO L226 Difference]: Without dead ends: 86 [2019-11-23 22:06:24,704 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,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-23 22:06:24,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-11-23 22:06:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-23 22:06:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 157 transitions. [2019-11-23 22:06:24,726 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 157 transitions. Word has length 19 [2019-11-23 22:06:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:24,726 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 157 transitions. [2019-11-23 22:06:24,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 157 transitions. [2019-11-23 22:06:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:24,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:24,728 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:24,728 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:24,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:24,729 INFO L82 PathProgramCache]: Analyzing trace with hash 458538653, now seen corresponding path program 1 times [2019-11-23 22:06:24,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:24,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621089811] [2019-11-23 22:06:24,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:24,793 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,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621089811] [2019-11-23 22:06:24,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:24,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:24,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046661436] [2019-11-23 22:06:24,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:24,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:24,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:24,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:24,798 INFO L87 Difference]: Start difference. First operand 84 states and 157 transitions. Second operand 3 states. [2019-11-23 22:06:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:24,831 INFO L93 Difference]: Finished difference Result 131 states and 239 transitions. [2019-11-23 22:06:24,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:24,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:24,835 INFO L225 Difference]: With dead ends: 131 [2019-11-23 22:06:24,835 INFO L226 Difference]: Without dead ends: 89 [2019-11-23 22:06:24,838 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,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-23 22:06:24,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-11-23 22:06:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-23 22:06:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 159 transitions. [2019-11-23 22:06:24,849 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 159 transitions. Word has length 20 [2019-11-23 22:06:24,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:24,849 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 159 transitions. [2019-11-23 22:06:24,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 159 transitions. [2019-11-23 22:06:24,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:24,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:24,850 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:24,851 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:24,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:24,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1129809249, now seen corresponding path program 1 times [2019-11-23 22:06:24,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:24,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457465983] [2019-11-23 22:06:24,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:24,896 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,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457465983] [2019-11-23 22:06:24,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:24,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:24,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468099167] [2019-11-23 22:06:24,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:24,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:24,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:24,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:24,899 INFO L87 Difference]: Start difference. First operand 87 states and 159 transitions. Second operand 3 states. [2019-11-23 22:06:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:24,919 INFO L93 Difference]: Finished difference Result 168 states and 308 transitions. [2019-11-23 22:06:24,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:24,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:24,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:24,922 INFO L225 Difference]: With dead ends: 168 [2019-11-23 22:06:24,922 INFO L226 Difference]: Without dead ends: 166 [2019-11-23 22:06:24,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:24,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-23 22:06:24,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 116. [2019-11-23 22:06:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-23 22:06:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 212 transitions. [2019-11-23 22:06:24,935 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 212 transitions. Word has length 20 [2019-11-23 22:06:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:24,936 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 212 transitions. [2019-11-23 22:06:24,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 212 transitions. [2019-11-23 22:06:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:24,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:24,937 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:24,938 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:24,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:24,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2144089693, now seen corresponding path program 1 times [2019-11-23 22:06:24,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:24,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701436709] [2019-11-23 22:06:24,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:24,989 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,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701436709] [2019-11-23 22:06:24,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:24,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:24,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566508687] [2019-11-23 22:06:24,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:24,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:24,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:24,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:24,993 INFO L87 Difference]: Start difference. First operand 116 states and 212 transitions. Second operand 3 states. [2019-11-23 22:06:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:25,017 INFO L93 Difference]: Finished difference Result 280 states and 514 transitions. [2019-11-23 22:06:25,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:25,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:25,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:25,020 INFO L225 Difference]: With dead ends: 280 [2019-11-23 22:06:25,020 INFO L226 Difference]: Without dead ends: 168 [2019-11-23 22:06:25,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:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-23 22:06:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2019-11-23 22:06:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-23 22:06:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 302 transitions. [2019-11-23 22:06:25,035 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 302 transitions. Word has length 20 [2019-11-23 22:06:25,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:25,035 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 302 transitions. [2019-11-23 22:06:25,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 302 transitions. [2019-11-23 22:06:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:25,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:25,037 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:25,037 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:25,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:25,038 INFO L82 PathProgramCache]: Analyzing trace with hash -664135635, now seen corresponding path program 1 times [2019-11-23 22:06:25,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:25,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085104503] [2019-11-23 22:06:25,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:25,097 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,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085104503] [2019-11-23 22:06:25,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:25,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:25,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633279502] [2019-11-23 22:06:25,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:25,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:25,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:25,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:25,100 INFO L87 Difference]: Start difference. First operand 166 states and 302 transitions. Second operand 3 states. [2019-11-23 22:06:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:25,122 INFO L93 Difference]: Finished difference Result 251 states and 453 transitions. [2019-11-23 22:06:25,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:25,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:25,125 INFO L225 Difference]: With dead ends: 251 [2019-11-23 22:06:25,125 INFO L226 Difference]: Without dead ends: 170 [2019-11-23 22:06:25,126 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,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-23 22:06:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2019-11-23 22:06:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-23 22:06:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 302 transitions. [2019-11-23 22:06:25,149 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 302 transitions. Word has length 21 [2019-11-23 22:06:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:25,150 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 302 transitions. [2019-11-23 22:06:25,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 302 transitions. [2019-11-23 22:06:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:25,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:25,151 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:25,153 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:25,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:25,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2042483759, now seen corresponding path program 1 times [2019-11-23 22:06:25,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:25,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945725871] [2019-11-23 22:06:25,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:25,227 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,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945725871] [2019-11-23 22:06:25,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:25,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:25,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183523111] [2019-11-23 22:06:25,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:25,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:25,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:25,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:25,230 INFO L87 Difference]: Start difference. First operand 168 states and 302 transitions. Second operand 3 states. [2019-11-23 22:06:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:25,254 INFO L93 Difference]: Finished difference Result 488 states and 880 transitions. [2019-11-23 22:06:25,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:25,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:25,257 INFO L225 Difference]: With dead ends: 488 [2019-11-23 22:06:25,257 INFO L226 Difference]: Without dead ends: 326 [2019-11-23 22:06:25,258 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,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-23 22:06:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2019-11-23 22:06:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-23 22:06:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 578 transitions. [2019-11-23 22:06:25,269 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 578 transitions. Word has length 21 [2019-11-23 22:06:25,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:25,269 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 578 transitions. [2019-11-23 22:06:25,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:25,270 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 578 transitions. [2019-11-23 22:06:25,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:25,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:25,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:25,272 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:25,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1231415183, now seen corresponding path program 1 times [2019-11-23 22:06:25,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:25,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405169243] [2019-11-23 22:06:25,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:25,303 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,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405169243] [2019-11-23 22:06:25,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:25,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:25,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596423933] [2019-11-23 22:06:25,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:25,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:25,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:25,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:25,305 INFO L87 Difference]: Start difference. First operand 324 states and 578 transitions. Second operand 3 states. [2019-11-23 22:06:25,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:25,329 INFO L93 Difference]: Finished difference Result 416 states and 748 transitions. [2019-11-23 22:06:25,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:25,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:25,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:25,336 INFO L225 Difference]: With dead ends: 416 [2019-11-23 22:06:25,336 INFO L226 Difference]: Without dead ends: 414 [2019-11-23 22:06:25,337 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,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-11-23 22:06:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 324. [2019-11-23 22:06:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-23 22:06:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 574 transitions. [2019-11-23 22:06:25,348 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 574 transitions. Word has length 21 [2019-11-23 22:06:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:25,349 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 574 transitions. [2019-11-23 22:06:25,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 574 transitions. [2019-11-23 22:06:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:25,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:25,350 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:25,351 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:25,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:25,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1107299854, now seen corresponding path program 1 times [2019-11-23 22:06:25,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:25,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42097190] [2019-11-23 22:06:25,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:25,390 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,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42097190] [2019-11-23 22:06:25,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:25,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:25,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654401765] [2019-11-23 22:06:25,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:25,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:25,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:25,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:25,394 INFO L87 Difference]: Start difference. First operand 324 states and 574 transitions. Second operand 3 states. [2019-11-23 22:06:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:25,426 INFO L93 Difference]: Finished difference Result 612 states and 1096 transitions. [2019-11-23 22:06:25,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:25,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:25,430 INFO L225 Difference]: With dead ends: 612 [2019-11-23 22:06:25,430 INFO L226 Difference]: Without dead ends: 610 [2019-11-23 22:06:25,431 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,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-11-23 22:06:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 448. [2019-11-23 22:06:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-23 22:06:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 782 transitions. [2019-11-23 22:06:25,462 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 782 transitions. Word has length 22 [2019-11-23 22:06:25,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:25,463 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 782 transitions. [2019-11-23 22:06:25,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 782 transitions. [2019-11-23 22:06:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:25,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:25,466 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:25,466 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:25,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:25,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2128368208, now seen corresponding path program 1 times [2019-11-23 22:06:25,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:25,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597386122] [2019-11-23 22:06:25,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:25,519 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,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597386122] [2019-11-23 22:06:25,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:25,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:25,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133490203] [2019-11-23 22:06:25,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:25,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:25,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:25,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:25,522 INFO L87 Difference]: Start difference. First operand 448 states and 782 transitions. Second operand 3 states. [2019-11-23 22:06:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:25,556 INFO L93 Difference]: Finished difference Result 1076 states and 1888 transitions. [2019-11-23 22:06:25,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:25,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:25,561 INFO L225 Difference]: With dead ends: 1076 [2019-11-23 22:06:25,561 INFO L226 Difference]: Without dead ends: 634 [2019-11-23 22:06:25,562 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,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-11-23 22:06:25,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2019-11-23 22:06:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-11-23 22:06:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1098 transitions. [2019-11-23 22:06:25,582 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1098 transitions. Word has length 22 [2019-11-23 22:06:25,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:25,582 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 1098 transitions. [2019-11-23 22:06:25,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:25,582 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1098 transitions. [2019-11-23 22:06:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:25,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:25,584 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:25,584 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:25,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:25,584 INFO L82 PathProgramCache]: Analyzing trace with hash 33656292, now seen corresponding path program 1 times [2019-11-23 22:06:25,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:25,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324294446] [2019-11-23 22:06:25,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:25,612 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,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324294446] [2019-11-23 22:06:25,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:25,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:25,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311278684] [2019-11-23 22:06:25,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:25,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:25,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:25,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:25,614 INFO L87 Difference]: Start difference. First operand 632 states and 1098 transitions. Second operand 3 states. [2019-11-23 22:06:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:25,640 INFO L93 Difference]: Finished difference Result 956 states and 1656 transitions. [2019-11-23 22:06:25,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:25,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:25,644 INFO L225 Difference]: With dead ends: 956 [2019-11-23 22:06:25,644 INFO L226 Difference]: Without dead ends: 646 [2019-11-23 22:06:25,645 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,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-11-23 22:06:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 644. [2019-11-23 22:06:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-11-23 22:06:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1106 transitions. [2019-11-23 22:06:25,663 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1106 transitions. Word has length 23 [2019-11-23 22:06:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:25,663 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 1106 transitions. [2019-11-23 22:06:25,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1106 transitions. [2019-11-23 22:06:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:25,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:25,664 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:25,665 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:25,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:25,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1554691610, now seen corresponding path program 1 times [2019-11-23 22:06:25,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:25,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749740986] [2019-11-23 22:06:25,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:25,688 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,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749740986] [2019-11-23 22:06:25,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:25,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:25,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597619657] [2019-11-23 22:06:25,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:25,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:25,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:25,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:25,690 INFO L87 Difference]: Start difference. First operand 644 states and 1106 transitions. Second operand 3 states. [2019-11-23 22:06:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:25,717 INFO L93 Difference]: Finished difference Result 1192 states and 2076 transitions. [2019-11-23 22:06:25,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:25,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:25,725 INFO L225 Difference]: With dead ends: 1192 [2019-11-23 22:06:25,725 INFO L226 Difference]: Without dead ends: 1190 [2019-11-23 22:06:25,726 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,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2019-11-23 22:06:25,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 900. [2019-11-23 22:06:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-11-23 22:06:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1514 transitions. [2019-11-23 22:06:25,757 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1514 transitions. Word has length 23 [2019-11-23 22:06:25,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:25,758 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1514 transitions. [2019-11-23 22:06:25,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:25,758 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1514 transitions. [2019-11-23 22:06:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:25,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:25,760 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:25,760 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:25,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:25,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1719207332, now seen corresponding path program 1 times [2019-11-23 22:06:25,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:25,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060040980] [2019-11-23 22:06:25,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:25,785 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,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060040980] [2019-11-23 22:06:25,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:25,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:25,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071321557] [2019-11-23 22:06:25,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:25,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:25,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:25,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:25,787 INFO L87 Difference]: Start difference. First operand 900 states and 1514 transitions. Second operand 3 states. [2019-11-23 22:06:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:25,821 INFO L93 Difference]: Finished difference Result 2136 states and 3612 transitions. [2019-11-23 22:06:25,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:25,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:25,828 INFO L225 Difference]: With dead ends: 2136 [2019-11-23 22:06:25,828 INFO L226 Difference]: Without dead ends: 1254 [2019-11-23 22:06:25,830 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,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2019-11-23 22:06:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1252. [2019-11-23 22:06:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2019-11-23 22:06:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 2098 transitions. [2019-11-23 22:06:25,871 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 2098 transitions. Word has length 23 [2019-11-23 22:06:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:25,872 INFO L462 AbstractCegarLoop]: Abstraction has 1252 states and 2098 transitions. [2019-11-23 22:06:25,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:25,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 2098 transitions. [2019-11-23 22:06:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:25,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:25,874 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:25,874 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:25,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:25,875 INFO L82 PathProgramCache]: Analyzing trace with hash -950585915, now seen corresponding path program 1 times [2019-11-23 22:06:25,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:25,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479385362] [2019-11-23 22:06:25,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:25,902 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,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479385362] [2019-11-23 22:06:25,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:25,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:25,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135969255] [2019-11-23 22:06:25,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:25,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:25,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:25,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:25,905 INFO L87 Difference]: Start difference. First operand 1252 states and 2098 transitions. Second operand 3 states. [2019-11-23 22:06:25,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:25,934 INFO L93 Difference]: Finished difference Result 1880 states and 3140 transitions. [2019-11-23 22:06:25,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:25,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:25,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:25,941 INFO L225 Difference]: With dead ends: 1880 [2019-11-23 22:06:25,941 INFO L226 Difference]: Without dead ends: 1270 [2019-11-23 22:06:25,943 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,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-11-23 22:06:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1268. [2019-11-23 22:06:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2019-11-23 22:06:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 2098 transitions. [2019-11-23 22:06:25,993 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 2098 transitions. Word has length 24 [2019-11-23 22:06:25,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:25,993 INFO L462 AbstractCegarLoop]: Abstraction has 1268 states and 2098 transitions. [2019-11-23 22:06:25,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:25,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 2098 transitions. [2019-11-23 22:06:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:25,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:25,995 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:25,996 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:25,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:25,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1756033479, now seen corresponding path program 1 times [2019-11-23 22:06:25,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:25,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168275069] [2019-11-23 22:06:25,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:26,019 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,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168275069] [2019-11-23 22:06:26,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:26,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:26,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510609154] [2019-11-23 22:06:26,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:26,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:26,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:26,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:26,022 INFO L87 Difference]: Start difference. First operand 1268 states and 2098 transitions. Second operand 3 states. [2019-11-23 22:06:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:26,055 INFO L93 Difference]: Finished difference Result 2312 states and 3892 transitions. [2019-11-23 22:06:26,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:26,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:26,071 INFO L225 Difference]: With dead ends: 2312 [2019-11-23 22:06:26,071 INFO L226 Difference]: Without dead ends: 2310 [2019-11-23 22:06:26,073 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,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-11-23 22:06:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1796. [2019-11-23 22:06:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2019-11-23 22:06:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2898 transitions. [2019-11-23 22:06:26,134 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2898 transitions. Word has length 24 [2019-11-23 22:06:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:26,134 INFO L462 AbstractCegarLoop]: Abstraction has 1796 states and 2898 transitions. [2019-11-23 22:06:26,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2898 transitions. [2019-11-23 22:06:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:26,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:26,137 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:26,138 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:26,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:26,138 INFO L82 PathProgramCache]: Analyzing trace with hash 734965125, now seen corresponding path program 1 times [2019-11-23 22:06:26,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:26,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200575140] [2019-11-23 22:06:26,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:26,161 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,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200575140] [2019-11-23 22:06:26,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:26,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:26,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39045095] [2019-11-23 22:06:26,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:26,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:26,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:26,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:26,163 INFO L87 Difference]: Start difference. First operand 1796 states and 2898 transitions. Second operand 3 states. [2019-11-23 22:06:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:26,216 INFO L93 Difference]: Finished difference Result 4232 states and 6868 transitions. [2019-11-23 22:06:26,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:26,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:26,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:26,227 INFO L225 Difference]: With dead ends: 4232 [2019-11-23 22:06:26,228 INFO L226 Difference]: Without dead ends: 2470 [2019-11-23 22:06:26,230 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,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2019-11-23 22:06:26,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2468. [2019-11-23 22:06:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2468 states. [2019-11-23 22:06:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3970 transitions. [2019-11-23 22:06:26,309 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3970 transitions. Word has length 24 [2019-11-23 22:06:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:26,309 INFO L462 AbstractCegarLoop]: Abstraction has 2468 states and 3970 transitions. [2019-11-23 22:06:26,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3970 transitions. [2019-11-23 22:06:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:26,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:26,313 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:26,313 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:26,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:26,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1397322919, now seen corresponding path program 1 times [2019-11-23 22:06:26,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:26,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275337704] [2019-11-23 22:06:26,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:26,338 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,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275337704] [2019-11-23 22:06:26,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:26,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:26,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736796510] [2019-11-23 22:06:26,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:26,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:26,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:26,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:26,340 INFO L87 Difference]: Start difference. First operand 2468 states and 3970 transitions. Second operand 3 states. [2019-11-23 22:06:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:26,382 INFO L93 Difference]: Finished difference Result 3704 states and 5940 transitions. [2019-11-23 22:06:26,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:26,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:26,395 INFO L225 Difference]: With dead ends: 3704 [2019-11-23 22:06:26,395 INFO L226 Difference]: Without dead ends: 2502 [2019-11-23 22:06:26,397 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,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-11-23 22:06:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 2500. [2019-11-23 22:06:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2019-11-23 22:06:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3970 transitions. [2019-11-23 22:06:26,464 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3970 transitions. Word has length 25 [2019-11-23 22:06:26,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:26,464 INFO L462 AbstractCegarLoop]: Abstraction has 2500 states and 3970 transitions. [2019-11-23 22:06:26,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3970 transitions. [2019-11-23 22:06:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:26,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:26,468 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:26,468 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:26,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:26,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1309296475, now seen corresponding path program 1 times [2019-11-23 22:06:26,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:26,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780321969] [2019-11-23 22:06:26,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:26,489 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,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780321969] [2019-11-23 22:06:26,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:26,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:26,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845864177] [2019-11-23 22:06:26,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:26,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:26,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:26,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:26,491 INFO L87 Difference]: Start difference. First operand 2500 states and 3970 transitions. Second operand 3 states. [2019-11-23 22:06:26,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:26,580 INFO L93 Difference]: Finished difference Result 4488 states and 7268 transitions. [2019-11-23 22:06:26,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:26,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:26,605 INFO L225 Difference]: With dead ends: 4488 [2019-11-23 22:06:26,605 INFO L226 Difference]: Without dead ends: 4486 [2019-11-23 22:06:26,607 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,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-11-23 22:06:26,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 3588. [2019-11-23 22:06:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-11-23 22:06:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5538 transitions. [2019-11-23 22:06:26,727 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5538 transitions. Word has length 25 [2019-11-23 22:06:26,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:26,728 INFO L462 AbstractCegarLoop]: Abstraction has 3588 states and 5538 transitions. [2019-11-23 22:06:26,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5538 transitions. [2019-11-23 22:06:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:26,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:26,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:26,734 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:26,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:26,734 INFO L82 PathProgramCache]: Analyzing trace with hash 288228121, now seen corresponding path program 1 times [2019-11-23 22:06:26,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:26,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730015471] [2019-11-23 22:06:26,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:26,755 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,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730015471] [2019-11-23 22:06:26,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:26,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:26,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984692760] [2019-11-23 22:06:26,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:26,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:26,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:26,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:26,757 INFO L87 Difference]: Start difference. First operand 3588 states and 5538 transitions. Second operand 3 states. [2019-11-23 22:06:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:26,840 INFO L93 Difference]: Finished difference Result 8392 states and 13028 transitions. [2019-11-23 22:06:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:26,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:26,863 INFO L225 Difference]: With dead ends: 8392 [2019-11-23 22:06:26,863 INFO L226 Difference]: Without dead ends: 4870 [2019-11-23 22:06:26,868 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,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2019-11-23 22:06:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 4868. [2019-11-23 22:06:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4868 states. [2019-11-23 22:06:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 7490 transitions. [2019-11-23 22:06:27,008 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 7490 transitions. Word has length 25 [2019-11-23 22:06:27,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:27,008 INFO L462 AbstractCegarLoop]: Abstraction has 4868 states and 7490 transitions. [2019-11-23 22:06:27,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 7490 transitions. [2019-11-23 22:06:27,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:06:27,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:27,014 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,014 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:27,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:27,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1933699482, now seen corresponding path program 1 times [2019-11-23 22:06:27,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:27,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890971865] [2019-11-23 22:06:27,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:27,032 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,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890971865] [2019-11-23 22:06:27,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:27,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:27,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311132644] [2019-11-23 22:06:27,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:27,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:27,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:27,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:27,034 INFO L87 Difference]: Start difference. First operand 4868 states and 7490 transitions. Second operand 3 states. [2019-11-23 22:06:27,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:27,143 INFO L93 Difference]: Finished difference Result 7304 states and 11204 transitions. [2019-11-23 22:06:27,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:27,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:06:27,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:27,168 INFO L225 Difference]: With dead ends: 7304 [2019-11-23 22:06:27,168 INFO L226 Difference]: Without dead ends: 4934 [2019-11-23 22:06:27,173 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:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2019-11-23 22:06:27,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4932. [2019-11-23 22:06:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4932 states. [2019-11-23 22:06:27,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 7490 transitions. [2019-11-23 22:06:27,293 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 7490 transitions. Word has length 26 [2019-11-23 22:06:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:27,294 INFO L462 AbstractCegarLoop]: Abstraction has 4932 states and 7490 transitions. [2019-11-23 22:06:27,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 7490 transitions. [2019-11-23 22:06:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:06:27,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:27,300 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,300 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:27,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:27,300 INFO L82 PathProgramCache]: Analyzing trace with hash 345351580, now seen corresponding path program 1 times [2019-11-23 22:06:27,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:27,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28387046] [2019-11-23 22:06:27,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:27,322 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,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28387046] [2019-11-23 22:06:27,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:27,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:27,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595987563] [2019-11-23 22:06:27,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:27,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:27,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:27,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:27,325 INFO L87 Difference]: Start difference. First operand 4932 states and 7490 transitions. Second operand 3 states. [2019-11-23 22:06:27,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:27,412 INFO L93 Difference]: Finished difference Result 8712 states and 13508 transitions. [2019-11-23 22:06:27,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:27,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:06:27,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:27,429 INFO L225 Difference]: With dead ends: 8712 [2019-11-23 22:06:27,430 INFO L226 Difference]: Without dead ends: 8710 [2019-11-23 22:06:27,433 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:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2019-11-23 22:06:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 7172. [2019-11-23 22:06:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7172 states. [2019-11-23 22:06:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 10562 transitions. [2019-11-23 22:06:27,668 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 10562 transitions. Word has length 26 [2019-11-23 22:06:27,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:27,668 INFO L462 AbstractCegarLoop]: Abstraction has 7172 states and 10562 transitions. [2019-11-23 22:06:27,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:27,669 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 10562 transitions. [2019-11-23 22:06:27,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:06:27,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:27,684 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,684 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:27,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash -675716774, now seen corresponding path program 1 times [2019-11-23 22:06:27,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:27,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141536202] [2019-11-23 22:06:27,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:27,772 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,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141536202] [2019-11-23 22:06:27,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:27,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:27,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747980711] [2019-11-23 22:06:27,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:27,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:27,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:27,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:27,775 INFO L87 Difference]: Start difference. First operand 7172 states and 10562 transitions. Second operand 3 states. [2019-11-23 22:06:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:27,892 INFO L93 Difference]: Finished difference Result 16648 states and 24644 transitions. [2019-11-23 22:06:27,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:27,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:06:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:27,911 INFO L225 Difference]: With dead ends: 16648 [2019-11-23 22:06:27,911 INFO L226 Difference]: Without dead ends: 9606 [2019-11-23 22:06:27,921 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:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9606 states. [2019-11-23 22:06:28,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9606 to 9604. [2019-11-23 22:06:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9604 states. [2019-11-23 22:06:28,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9604 states to 9604 states and 14082 transitions. [2019-11-23 22:06:28,145 INFO L78 Accepts]: Start accepts. Automaton has 9604 states and 14082 transitions. Word has length 26 [2019-11-23 22:06:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:28,145 INFO L462 AbstractCegarLoop]: Abstraction has 9604 states and 14082 transitions. [2019-11-23 22:06:28,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:28,146 INFO L276 IsEmpty]: Start isEmpty. Operand 9604 states and 14082 transitions. [2019-11-23 22:06:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:06:28,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:28,155 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,158 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:28,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2116179150, now seen corresponding path program 1 times [2019-11-23 22:06:28,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:28,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473969125] [2019-11-23 22:06:28,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:28,178 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,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473969125] [2019-11-23 22:06:28,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:28,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:28,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654495066] [2019-11-23 22:06:28,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:28,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:28,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:28,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:28,180 INFO L87 Difference]: Start difference. First operand 9604 states and 14082 transitions. Second operand 3 states. [2019-11-23 22:06:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:28,344 INFO L93 Difference]: Finished difference Result 14408 states and 21060 transitions. [2019-11-23 22:06:28,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:28,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:06:28,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:28,363 INFO L225 Difference]: With dead ends: 14408 [2019-11-23 22:06:28,364 INFO L226 Difference]: Without dead ends: 9734 [2019-11-23 22:06:28,370 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,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9734 states. [2019-11-23 22:06:28,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9734 to 9732. [2019-11-23 22:06:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9732 states. [2019-11-23 22:06:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9732 states to 9732 states and 14082 transitions. [2019-11-23 22:06:28,579 INFO L78 Accepts]: Start accepts. Automaton has 9732 states and 14082 transitions. Word has length 27 [2019-11-23 22:06:28,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:28,580 INFO L462 AbstractCegarLoop]: Abstraction has 9732 states and 14082 transitions. [2019-11-23 22:06:28,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 9732 states and 14082 transitions. [2019-11-23 22:06:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:06:28,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:28,590 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,590 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:28,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:28,590 INFO L82 PathProgramCache]: Analyzing trace with hash 527831248, now seen corresponding path program 1 times [2019-11-23 22:06:28,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:28,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443437941] [2019-11-23 22:06:28,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:28,609 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,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443437941] [2019-11-23 22:06:28,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:28,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:28,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791817004] [2019-11-23 22:06:28,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:28,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:28,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:28,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:28,611 INFO L87 Difference]: Start difference. First operand 9732 states and 14082 transitions. Second operand 3 states. [2019-11-23 22:06:28,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:28,773 INFO L93 Difference]: Finished difference Result 16904 states and 24964 transitions. [2019-11-23 22:06:28,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:28,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:06:28,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:28,804 INFO L225 Difference]: With dead ends: 16904 [2019-11-23 22:06:28,804 INFO L226 Difference]: Without dead ends: 16902 [2019-11-23 22:06:28,811 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,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16902 states. [2019-11-23 22:06:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16902 to 14340. [2019-11-23 22:06:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14340 states. [2019-11-23 22:06:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 20098 transitions. [2019-11-23 22:06:29,185 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 20098 transitions. Word has length 27 [2019-11-23 22:06:29,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:29,185 INFO L462 AbstractCegarLoop]: Abstraction has 14340 states and 20098 transitions. [2019-11-23 22:06:29,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 20098 transitions. [2019-11-23 22:06:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:06:29,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:29,203 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:29,203 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:29,204 INFO L82 PathProgramCache]: Analyzing trace with hash -493237106, now seen corresponding path program 1 times [2019-11-23 22:06:29,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:29,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607065703] [2019-11-23 22:06:29,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:29,223 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:29,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607065703] [2019-11-23 22:06:29,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:29,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:29,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934577183] [2019-11-23 22:06:29,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:29,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:29,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:29,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:29,225 INFO L87 Difference]: Start difference. First operand 14340 states and 20098 transitions. Second operand 3 states. [2019-11-23 22:06:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:29,417 INFO L93 Difference]: Finished difference Result 33032 states and 46468 transitions. [2019-11-23 22:06:29,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:29,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:06:29,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:29,450 INFO L225 Difference]: With dead ends: 33032 [2019-11-23 22:06:29,450 INFO L226 Difference]: Without dead ends: 18950 [2019-11-23 22:06:29,469 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,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18950 states. [2019-11-23 22:06:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18950 to 18948. [2019-11-23 22:06:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18948 states. [2019-11-23 22:06:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18948 states to 18948 states and 26370 transitions. [2019-11-23 22:06:30,291 INFO L78 Accepts]: Start accepts. Automaton has 18948 states and 26370 transitions. Word has length 27 [2019-11-23 22:06:30,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:30,291 INFO L462 AbstractCegarLoop]: Abstraction has 18948 states and 26370 transitions. [2019-11-23 22:06:30,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:30,291 INFO L276 IsEmpty]: Start isEmpty. Operand 18948 states and 26370 transitions. [2019-11-23 22:06:30,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:06:30,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:30,311 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, 1] [2019-11-23 22:06:30,311 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:30,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:30,311 INFO L82 PathProgramCache]: Analyzing trace with hash -816885393, now seen corresponding path program 1 times [2019-11-23 22:06:30,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:30,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254683684] [2019-11-23 22:06:30,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:30,335 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:30,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254683684] [2019-11-23 22:06:30,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:30,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:30,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828037552] [2019-11-23 22:06:30,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:30,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:30,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:30,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:30,337 INFO L87 Difference]: Start difference. First operand 18948 states and 26370 transitions. Second operand 3 states. [2019-11-23 22:06:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:30,508 INFO L93 Difference]: Finished difference Result 28424 states and 39428 transitions. [2019-11-23 22:06:30,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:30,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:06:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:30,542 INFO L225 Difference]: With dead ends: 28424 [2019-11-23 22:06:30,542 INFO L226 Difference]: Without dead ends: 19206 [2019-11-23 22:06:30,555 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:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19206 states. [2019-11-23 22:06:30,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19206 to 19204. [2019-11-23 22:06:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19204 states. [2019-11-23 22:06:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19204 states to 19204 states and 26370 transitions. [2019-11-23 22:06:30,973 INFO L78 Accepts]: Start accepts. Automaton has 19204 states and 26370 transitions. Word has length 28 [2019-11-23 22:06:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:30,973 INFO L462 AbstractCegarLoop]: Abstraction has 19204 states and 26370 transitions. [2019-11-23 22:06:30,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 19204 states and 26370 transitions. [2019-11-23 22:06:30,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:06:30,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:30,996 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, 1] [2019-11-23 22:06:30,996 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:30,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:30,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1889734001, now seen corresponding path program 1 times [2019-11-23 22:06:30,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:30,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903976932] [2019-11-23 22:06:30,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:31,014 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,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903976932] [2019-11-23 22:06:31,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:31,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:31,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942418110] [2019-11-23 22:06:31,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:31,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:31,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:31,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:31,016 INFO L87 Difference]: Start difference. First operand 19204 states and 26370 transitions. Second operand 3 states. [2019-11-23 22:06:31,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:31,274 INFO L93 Difference]: Finished difference Result 32776 states and 45828 transitions. [2019-11-23 22:06:31,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:31,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:06:31,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:31,334 INFO L225 Difference]: With dead ends: 32776 [2019-11-23 22:06:31,334 INFO L226 Difference]: Without dead ends: 32774 [2019-11-23 22:06:31,343 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:31,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32774 states. [2019-11-23 22:06:31,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32774 to 28676. [2019-11-23 22:06:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28676 states. [2019-11-23 22:06:31,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28676 states to 28676 states and 38146 transitions. [2019-11-23 22:06:31,977 INFO L78 Accepts]: Start accepts. Automaton has 28676 states and 38146 transitions. Word has length 28 [2019-11-23 22:06:31,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:31,977 INFO L462 AbstractCegarLoop]: Abstraction has 28676 states and 38146 transitions. [2019-11-23 22:06:31,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:31,977 INFO L276 IsEmpty]: Start isEmpty. Operand 28676 states and 38146 transitions. [2019-11-23 22:06:32,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:06:32,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:32,015 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, 1] [2019-11-23 22:06:32,015 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:32,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:32,015 INFO L82 PathProgramCache]: Analyzing trace with hash 868665647, now seen corresponding path program 1 times [2019-11-23 22:06:32,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:32,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128158472] [2019-11-23 22:06:32,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:32,038 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:32,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128158472] [2019-11-23 22:06:32,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:32,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:32,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329964216] [2019-11-23 22:06:32,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:32,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:32,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:32,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:32,041 INFO L87 Difference]: Start difference. First operand 28676 states and 38146 transitions. Second operand 3 states. [2019-11-23 22:06:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:32,950 INFO L93 Difference]: Finished difference Result 65544 states and 87300 transitions. [2019-11-23 22:06:32,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:32,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:06:32,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:33,004 INFO L225 Difference]: With dead ends: 65544 [2019-11-23 22:06:33,005 INFO L226 Difference]: Without dead ends: 37382 [2019-11-23 22:06:33,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:33,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37382 states. [2019-11-23 22:06:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37382 to 37380. [2019-11-23 22:06:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37380 states. [2019-11-23 22:06:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37380 states to 37380 states and 49154 transitions. [2019-11-23 22:06:33,784 INFO L78 Accepts]: Start accepts. Automaton has 37380 states and 49154 transitions. Word has length 28 [2019-11-23 22:06:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:33,784 INFO L462 AbstractCegarLoop]: Abstraction has 37380 states and 49154 transitions. [2019-11-23 22:06:33,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:33,784 INFO L276 IsEmpty]: Start isEmpty. Operand 37380 states and 49154 transitions. [2019-11-23 22:06:33,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:06:33,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:33,809 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, 1, 1] [2019-11-23 22:06:33,809 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:33,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:33,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1547572669, now seen corresponding path program 1 times [2019-11-23 22:06:33,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:33,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605656673] [2019-11-23 22:06:33,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:33,826 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,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605656673] [2019-11-23 22:06:33,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:33,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:33,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579115457] [2019-11-23 22:06:33,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:33,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:33,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:33,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:33,828 INFO L87 Difference]: Start difference. First operand 37380 states and 49154 transitions. Second operand 3 states. [2019-11-23 22:06:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:34,145 INFO L93 Difference]: Finished difference Result 56072 states and 73476 transitions. [2019-11-23 22:06:34,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:34,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 22:06:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:34,213 INFO L225 Difference]: With dead ends: 56072 [2019-11-23 22:06:34,213 INFO L226 Difference]: Without dead ends: 37894 [2019-11-23 22:06:34,230 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:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37894 states. [2019-11-23 22:06:34,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37894 to 37892. [2019-11-23 22:06:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37892 states. [2019-11-23 22:06:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37892 states to 37892 states and 49154 transitions. [2019-11-23 22:06:34,783 INFO L78 Accepts]: Start accepts. Automaton has 37892 states and 49154 transitions. Word has length 29 [2019-11-23 22:06:34,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:34,783 INFO L462 AbstractCegarLoop]: Abstraction has 37892 states and 49154 transitions. [2019-11-23 22:06:34,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:34,783 INFO L276 IsEmpty]: Start isEmpty. Operand 37892 states and 49154 transitions. [2019-11-23 22:06:34,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:06:34,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:34,810 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, 1, 1] [2019-11-23 22:06:34,810 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:34,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:34,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1159046725, now seen corresponding path program 1 times [2019-11-23 22:06:34,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:34,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876170178] [2019-11-23 22:06:34,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:34,832 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:34,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876170178] [2019-11-23 22:06:34,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:34,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:34,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8634147] [2019-11-23 22:06:34,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:34,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:34,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:34,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:34,834 INFO L87 Difference]: Start difference. First operand 37892 states and 49154 transitions. Second operand 3 states. [2019-11-23 22:06:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:35,567 INFO L93 Difference]: Finished difference Result 110600 states and 141316 transitions. [2019-11-23 22:06:35,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:35,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 22:06:35,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:35,642 INFO L225 Difference]: With dead ends: 110600 [2019-11-23 22:06:35,642 INFO L226 Difference]: Without dead ends: 73734 [2019-11-23 22:06:35,674 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:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73734 states. [2019-11-23 22:06:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73734 to 73732. [2019-11-23 22:06:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73732 states. [2019-11-23 22:06:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 92162 transitions. [2019-11-23 22:06:36,721 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 92162 transitions. Word has length 29 [2019-11-23 22:06:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:36,721 INFO L462 AbstractCegarLoop]: Abstraction has 73732 states and 92162 transitions. [2019-11-23 22:06:36,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 92162 transitions. [2019-11-23 22:06:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:06:36,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:36,754 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, 1, 1] [2019-11-23 22:06:36,755 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:36,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:36,755 INFO L82 PathProgramCache]: Analyzing trace with hash -2114852217, now seen corresponding path program 1 times [2019-11-23 22:06:36,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:36,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238218808] [2019-11-23 22:06:36,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:36,776 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:36,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238218808] [2019-11-23 22:06:36,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:36,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:36,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530814982] [2019-11-23 22:06:36,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:36,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:36,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:36,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:36,778 INFO L87 Difference]: Start difference. First operand 73732 states and 92162 transitions. Second operand 3 states. [2019-11-23 22:06:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:38,293 INFO L93 Difference]: Finished difference Result 79880 states and 102404 transitions. [2019-11-23 22:06:38,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:38,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 22:06:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:38,363 INFO L225 Difference]: With dead ends: 79880 [2019-11-23 22:06:38,364 INFO L226 Difference]: Without dead ends: 79878 [2019-11-23 22:06:38,376 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:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79878 states. [2019-11-23 22:06:39,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79878 to 73732. [2019-11-23 22:06:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73732 states. [2019-11-23 22:06:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 91138 transitions. [2019-11-23 22:06:39,326 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 91138 transitions. Word has length 29 [2019-11-23 22:06:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:39,327 INFO L462 AbstractCegarLoop]: Abstraction has 73732 states and 91138 transitions. [2019-11-23 22:06:39,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 91138 transitions. [2019-11-23 22:06:39,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:06:39,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:39,360 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, 1, 1, 1] [2019-11-23 22:06:39,360 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:39,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:39,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1570925892, now seen corresponding path program 1 times [2019-11-23 22:06:39,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:39,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100074261] [2019-11-23 22:06:39,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:39,377 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:39,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100074261] [2019-11-23 22:06:39,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:39,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:39,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995905271] [2019-11-23 22:06:39,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:39,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:39,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:39,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,379 INFO L87 Difference]: Start difference. First operand 73732 states and 91138 transitions. Second operand 3 states. [2019-11-23 22:06:39,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:39,998 INFO L93 Difference]: Finished difference Result 121864 states and 151556 transitions. [2019-11-23 22:06:39,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:39,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-23 22:06:39,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:40,090 INFO L225 Difference]: With dead ends: 121864 [2019-11-23 22:06:40,090 INFO L226 Difference]: Without dead ends: 121862 [2019-11-23 22:06:40,112 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:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121862 states. [2019-11-23 22:06:41,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121862 to 113668. [2019-11-23 22:06:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113668 states. [2019-11-23 22:06:43,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113668 states to 113668 states and 137218 transitions. [2019-11-23 22:06:43,822 INFO L78 Accepts]: Start accepts. Automaton has 113668 states and 137218 transitions. Word has length 30 [2019-11-23 22:06:43,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:43,822 INFO L462 AbstractCegarLoop]: Abstraction has 113668 states and 137218 transitions. [2019-11-23 22:06:43,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:43,822 INFO L276 IsEmpty]: Start isEmpty. Operand 113668 states and 137218 transitions. [2019-11-23 22:06:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:06:43,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:43,878 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, 1, 1, 1] [2019-11-23 22:06:43,878 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:43,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash 549857538, now seen corresponding path program 1 times [2019-11-23 22:06:43,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:43,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760326107] [2019-11-23 22:06:43,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:43,894 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:43,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760326107] [2019-11-23 22:06:43,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:43,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:43,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457932842] [2019-11-23 22:06:43,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:43,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:43,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:43,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:43,896 INFO L87 Difference]: Start difference. First operand 113668 states and 137218 transitions. Second operand 3 states. [2019-11-23 22:06:44,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:44,926 INFO L93 Difference]: Finished difference Result 257032 states and 309252 transitions. [2019-11-23 22:06:44,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:44,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-23 22:06:44,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:45,063 INFO L225 Difference]: With dead ends: 257032 [2019-11-23 22:06:45,064 INFO L226 Difference]: Without dead ends: 144390 [2019-11-23 22:06:45,123 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:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144390 states. [2019-11-23 22:06:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144390 to 144388. [2019-11-23 22:06:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144388 states. [2019-11-23 22:06:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144388 states to 144388 states and 169986 transitions. [2019-11-23 22:06:50,178 INFO L78 Accepts]: Start accepts. Automaton has 144388 states and 169986 transitions. Word has length 30 [2019-11-23 22:06:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:50,179 INFO L462 AbstractCegarLoop]: Abstraction has 144388 states and 169986 transitions. [2019-11-23 22:06:50,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 144388 states and 169986 transitions. [2019-11-23 22:06:50,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:06:50,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:50,237 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, 1, 1, 1, 1] [2019-11-23 22:06:50,237 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:50,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:50,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1454278522, now seen corresponding path program 1 times [2019-11-23 22:06:50,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:50,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535370042] [2019-11-23 22:06:50,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:50,264 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:50,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535370042] [2019-11-23 22:06:50,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:50,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:50,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29201431] [2019-11-23 22:06:50,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:50,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:50,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:50,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,266 INFO L87 Difference]: Start difference. First operand 144388 states and 169986 transitions. Second operand 3 states. [2019-11-23 22:06:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:51,128 INFO L93 Difference]: Finished difference Result 218120 states and 257028 transitions. [2019-11-23 22:06:51,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:51,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 22:06:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:51,267 INFO L225 Difference]: With dead ends: 218120 [2019-11-23 22:06:51,267 INFO L226 Difference]: Without dead ends: 147462 [2019-11-23 22:06:51,312 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:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147462 states. [2019-11-23 22:06:53,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147462 to 147460. [2019-11-23 22:06:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147460 states. [2019-11-23 22:06:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147460 states to 147460 states and 172034 transitions. [2019-11-23 22:06:53,360 INFO L78 Accepts]: Start accepts. Automaton has 147460 states and 172034 transitions. Word has length 31 [2019-11-23 22:06:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:53,360 INFO L462 AbstractCegarLoop]: Abstraction has 147460 states and 172034 transitions. [2019-11-23 22:06:53,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 147460 states and 172034 transitions. [2019-11-23 22:06:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:06:53,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:53,419 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, 1, 1, 1, 1] [2019-11-23 22:06:53,419 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:53,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash -134069380, now seen corresponding path program 1 times [2019-11-23 22:06:53,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:53,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640383478] [2019-11-23 22:06:53,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:53,451 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:53,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640383478] [2019-11-23 22:06:53,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:53,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:53,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030804629] [2019-11-23 22:06:53,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:53,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:53,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:53,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:53,453 INFO L87 Difference]: Start difference. First operand 147460 states and 172034 transitions. Second operand 3 states. [2019-11-23 22:06:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:55,334 INFO L93 Difference]: Finished difference Result 237574 states and 274435 transitions. [2019-11-23 22:06:55,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:55,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 22:06:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:55,596 INFO L225 Difference]: With dead ends: 237574 [2019-11-23 22:06:55,597 INFO L226 Difference]: Without dead ends: 237572 [2019-11-23 22:06:55,622 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:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237572 states. [2019-11-23 22:07:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237572 to 229380. [2019-11-23 22:07:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229380 states. [2019-11-23 22:07:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229380 states to 229380 states and 262146 transitions. [2019-11-23 22:07:01,171 INFO L78 Accepts]: Start accepts. Automaton has 229380 states and 262146 transitions. Word has length 31 [2019-11-23 22:07:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:01,171 INFO L462 AbstractCegarLoop]: Abstraction has 229380 states and 262146 transitions. [2019-11-23 22:07:01,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 229380 states and 262146 transitions. [2019-11-23 22:07:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:07:01,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:01,293 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, 1, 1, 1, 1] [2019-11-23 22:07:01,293 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:01,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1155137734, now seen corresponding path program 1 times [2019-11-23 22:07:01,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:01,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37667621] [2019-11-23 22:07:01,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:01,308 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:07:01,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37667621] [2019-11-23 22:07:01,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:01,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:01,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525647756] [2019-11-23 22:07:01,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:01,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:01,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:01,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:01,310 INFO L87 Difference]: Start difference. First operand 229380 states and 262146 transitions. Second operand 3 states. [2019-11-23 22:07:03,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:03,192 INFO L93 Difference]: Finished difference Result 512004 states and 577538 transitions. [2019-11-23 22:07:03,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:03,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 22:07:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:03,192 INFO L225 Difference]: With dead ends: 512004 [2019-11-23 22:07:03,192 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:07:03,317 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:07:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:07:03,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:07:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:07:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:07:03,317 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-11-23 22:07:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:03,318 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:07:03,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:07:03,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:07:03,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:07:03,355 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-23 22:07:03,355 INFO L444 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,355 INFO L447 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2019-11-23 22:07:03,355 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,356 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:07:03,356 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,356 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-23 22:07:03,356 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-23 22:07:03,356 INFO L444 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,356 INFO L444 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,356 INFO L447 ceAbstractionStarter]: At program point L204(lines 4 205) the Hoare annotation is: true [2019-11-23 22:07:03,356 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-23 22:07:03,356 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,356 INFO L444 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,357 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,357 INFO L444 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-23 22:07:03,357 INFO L444 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,357 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:07:03,357 INFO L444 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,357 INFO L444 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-23 22:07:03,357 INFO L444 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-11-23 22:07:03,357 INFO L444 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,357 INFO L444 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,358 INFO L444 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,358 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,358 INFO L444 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-11-23 22:07:03,358 INFO L444 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,358 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:07:03,358 INFO L444 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-11-23 22:07:03,358 INFO L444 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,358 INFO L447 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2019-11-23 22:07:03,358 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,359 INFO L444 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-11-23 22:07:03,359 INFO L444 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,359 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-23 22:07:03,359 INFO L440 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2019-11-23 22:07:03,359 INFO L444 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,359 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,359 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2019-11-23 22:07:03,359 INFO L444 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,360 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2019-11-23 22:07:03,360 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-23 22:07:03,360 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,360 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2019-11-23 22:07:03,360 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-23 22:07:03,360 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,360 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,360 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2019-11-23 22:07:03,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:07:03 BoogieIcfgContainer [2019-11-23 22:07:03,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:07:03,372 INFO L168 Benchmark]: Toolchain (without parser) took 40207.99 ms. Allocated memory was 144.2 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 100.9 MB in the beginning and 423.1 MB in the end (delta: -322.2 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-11-23 22:07:03,373 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 22:07:03,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.00 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 180.1 MB in the end (delta: -79.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:07:03,374 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.56 ms. Allocated memory is still 201.3 MB. Free memory was 180.1 MB in the beginning and 178.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:07:03,374 INFO L168 Benchmark]: Boogie Preprocessor took 30.93 ms. Allocated memory is still 201.3 MB. Free memory was 178.1 MB in the beginning and 175.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:07:03,375 INFO L168 Benchmark]: RCFGBuilder took 435.98 ms. Allocated memory is still 201.3 MB. Free memory was 175.8 MB in the beginning and 154.9 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:07:03,375 INFO L168 Benchmark]: TraceAbstraction took 39348.67 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 154.3 MB in the beginning and 423.1 MB in the end (delta: -268.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-11-23 22:07:03,378 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.49 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 348.00 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 180.1 MB in the end (delta: -79.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.56 ms. Allocated memory is still 201.3 MB. Free memory was 180.1 MB in the beginning and 178.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.93 ms. Allocated memory is still 201.3 MB. Free memory was 178.1 MB in the beginning and 175.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 435.98 ms. Allocated memory is still 201.3 MB. Free memory was 175.8 MB in the beginning and 154.9 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39348.67 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 154.3 MB in the beginning and 423.1 MB in the end (delta: -268.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: 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: 48]: 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, 48 locations, 1 error locations. Result: SAFE, OverallTime: 39.2s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3765 SDtfs, 1926 SDslu, 2532 SDs, 0 SdLazy, 191 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229380occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 32806 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8201 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, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 868 ConstructedInterpolants, 0 QuantifiedInterpolants, 47768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...