/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/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:34:15,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:34:15,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:34:15,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:34:15,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:34:15,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:34:15,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:34:15,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:34:15,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:34:15,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:34:15,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:34:15,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:34:15,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:34:15,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:34:15,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:34:15,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:34:15,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:34:15,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:34:15,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:34:15,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:34:15,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:34:15,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:34:15,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:34:15,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:34:15,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:34:15,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:34:15,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:34:15,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:34:15,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:34:15,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:34:15,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:34:15,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:34:15,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:34:15,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:34:15,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:34:15,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:34:15,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:34:15,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:34:15,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:34:15,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:34:15,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:34:15,145 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:34:15,165 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:34:15,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:34:15,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:34:15,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:34:15,167 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:34:15,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:34:15,168 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:34:15,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:34:15,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:34:15,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:34:15,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:34:15,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:34:15,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:34:15,170 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:34:15,170 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:34:15,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:34:15,170 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:34:15,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:34:15,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:34:15,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:34:15,171 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:34:15,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:34:15,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:34:15,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:34:15,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:34:15,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:34:15,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:34:15,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:34:15,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:34:15,174 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:34:15,481 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:34:15,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:34:15,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:34:15,504 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:34:15,504 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:34:15,506 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-11-23 22:34:15,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0bf5a98f/d16f6f33031240e3bf0af11aaea87779/FLAG78156f53f [2019-11-23 22:34:16,083 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:34:16,083 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-11-23 22:34:16,098 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0bf5a98f/d16f6f33031240e3bf0af11aaea87779/FLAG78156f53f [2019-11-23 22:34:16,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0bf5a98f/d16f6f33031240e3bf0af11aaea87779 [2019-11-23 22:34:16,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:34:16,367 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:34:16,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:34:16,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:34:16,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:34:16,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:34:16" (1/1) ... [2019-11-23 22:34:16,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@579deee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:16, skipping insertion in model container [2019-11-23 22:34:16,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:34:16" (1/1) ... [2019-11-23 22:34:16,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:34:16,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:34:16,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:34:16,841 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:34:16,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:34:16,942 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:34:16,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:16 WrapperNode [2019-11-23 22:34:16,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:34:16,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:34:16,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:34:16,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:34:16,951 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:34:16" (1/1) ... [2019-11-23 22:34:16,963 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:34:16" (1/1) ... [2019-11-23 22:34:17,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:34:17,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:34:17,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:34:17,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:34:17,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:16" (1/1) ... [2019-11-23 22:34:17,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:16" (1/1) ... [2019-11-23 22:34:17,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:16" (1/1) ... [2019-11-23 22:34:17,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:16" (1/1) ... [2019-11-23 22:34:17,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:16" (1/1) ... [2019-11-23 22:34:17,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:16" (1/1) ... [2019-11-23 22:34:17,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:16" (1/1) ... [2019-11-23 22:34:17,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:34:17,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:34:17,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:34:17,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:34:17,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:16" (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:34:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:34:17,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:34:18,014 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:34:18,015 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:34:18,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:18 BoogieIcfgContainer [2019-11-23 22:34:18,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:34:18,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:34:18,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:34:18,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:34:18,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:34:16" (1/3) ... [2019-11-23 22:34:18,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29870bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:18, skipping insertion in model container [2019-11-23 22:34:18,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:16" (2/3) ... [2019-11-23 22:34:18,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29870bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:18, skipping insertion in model container [2019-11-23 22:34:18,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:18" (3/3) ... [2019-11-23 22:34:18,025 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-11-23 22:34:18,034 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:34:18,041 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:34:18,052 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:34:18,078 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:34:18,078 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:34:18,078 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:34:18,078 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:34:18,079 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:34:18,079 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:34:18,079 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:34:18,079 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:34:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-11-23 22:34:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:34:18,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:18,110 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, 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:34:18,110 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:18,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:18,115 INFO L82 PathProgramCache]: Analyzing trace with hash -970283638, now seen corresponding path program 1 times [2019-11-23 22:34:18,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:18,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571922058] [2019-11-23 22:34:18,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:18,554 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:34:18,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571922058] [2019-11-23 22:34:18,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:18,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:18,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999777395] [2019-11-23 22:34:18,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:18,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:18,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:18,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:18,585 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2019-11-23 22:34:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:18,742 INFO L93 Difference]: Finished difference Result 335 states and 559 transitions. [2019-11-23 22:34:18,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:18,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-23 22:34:18,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:18,760 INFO L225 Difference]: With dead ends: 335 [2019-11-23 22:34:18,761 INFO L226 Difference]: Without dead ends: 231 [2019-11-23 22:34:18,765 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:34:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-23 22:34:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2019-11-23 22:34:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-23 22:34:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 359 transitions. [2019-11-23 22:34:18,829 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 359 transitions. Word has length 56 [2019-11-23 22:34:18,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:18,830 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 359 transitions. [2019-11-23 22:34:18,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:18,830 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 359 transitions. [2019-11-23 22:34:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-23 22:34:18,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:18,834 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, 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:34:18,834 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:18,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:18,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1615417163, now seen corresponding path program 1 times [2019-11-23 22:34:18,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:18,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409918307] [2019-11-23 22:34:18,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:18,974 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:34:18,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409918307] [2019-11-23 22:34:18,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:18,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:18,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792417240] [2019-11-23 22:34:18,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:18,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:18,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:18,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:18,980 INFO L87 Difference]: Start difference. First operand 228 states and 359 transitions. Second operand 3 states. [2019-11-23 22:34:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:19,047 INFO L93 Difference]: Finished difference Result 566 states and 911 transitions. [2019-11-23 22:34:19,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:19,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-23 22:34:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:19,055 INFO L225 Difference]: With dead ends: 566 [2019-11-23 22:34:19,055 INFO L226 Difference]: Without dead ends: 389 [2019-11-23 22:34:19,060 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:34:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-11-23 22:34:19,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2019-11-23 22:34:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-11-23 22:34:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 614 transitions. [2019-11-23 22:34:19,123 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 614 transitions. Word has length 58 [2019-11-23 22:34:19,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:19,124 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 614 transitions. [2019-11-23 22:34:19,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 614 transitions. [2019-11-23 22:34:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-23 22:34:19,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:19,128 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, 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:34:19,129 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:19,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:19,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1881805132, now seen corresponding path program 1 times [2019-11-23 22:34:19,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:19,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449310312] [2019-11-23 22:34:19,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:19,249 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:34:19,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449310312] [2019-11-23 22:34:19,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:19,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:19,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565646863] [2019-11-23 22:34:19,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:19,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:19,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:19,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:19,253 INFO L87 Difference]: Start difference. First operand 385 states and 614 transitions. Second operand 3 states. [2019-11-23 22:34:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:19,304 INFO L93 Difference]: Finished difference Result 1021 states and 1648 transitions. [2019-11-23 22:34:19,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:19,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-23 22:34:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:19,309 INFO L225 Difference]: With dead ends: 1021 [2019-11-23 22:34:19,309 INFO L226 Difference]: Without dead ends: 687 [2019-11-23 22:34:19,311 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:34:19,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-11-23 22:34:19,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 681. [2019-11-23 22:34:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2019-11-23 22:34:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1090 transitions. [2019-11-23 22:34:19,346 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1090 transitions. Word has length 60 [2019-11-23 22:34:19,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:19,347 INFO L462 AbstractCegarLoop]: Abstraction has 681 states and 1090 transitions. [2019-11-23 22:34:19,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1090 transitions. [2019-11-23 22:34:19,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 22:34:19,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:19,351 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, 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:34:19,351 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:19,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:19,351 INFO L82 PathProgramCache]: Analyzing trace with hash 333047117, now seen corresponding path program 1 times [2019-11-23 22:34:19,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:19,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792122773] [2019-11-23 22:34:19,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:19,525 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:34:19,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792122773] [2019-11-23 22:34:19,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:19,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:34:19,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736533414] [2019-11-23 22:34:19,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:34:19,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:19,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:34:19,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:19,530 INFO L87 Difference]: Start difference. First operand 681 states and 1090 transitions. Second operand 5 states. [2019-11-23 22:34:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:19,854 INFO L93 Difference]: Finished difference Result 2879 states and 4691 transitions. [2019-11-23 22:34:19,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:34:19,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-23 22:34:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:19,871 INFO L225 Difference]: With dead ends: 2879 [2019-11-23 22:34:19,871 INFO L226 Difference]: Without dead ends: 2249 [2019-11-23 22:34:19,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:34:19,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-11-23 22:34:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 1245. [2019-11-23 22:34:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1245 states. [2019-11-23 22:34:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 2000 transitions. [2019-11-23 22:34:19,980 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 2000 transitions. Word has length 62 [2019-11-23 22:34:19,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:19,982 INFO L462 AbstractCegarLoop]: Abstraction has 1245 states and 2000 transitions. [2019-11-23 22:34:19,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:34:19,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 2000 transitions. [2019-11-23 22:34:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 22:34:19,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:19,985 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:19,985 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:19,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:19,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1672021844, now seen corresponding path program 1 times [2019-11-23 22:34:19,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:19,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817276507] [2019-11-23 22:34:19,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:20,110 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:34:20,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817276507] [2019-11-23 22:34:20,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:20,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:20,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068129657] [2019-11-23 22:34:20,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:20,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:20,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:20,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:20,114 INFO L87 Difference]: Start difference. First operand 1245 states and 2000 transitions. Second operand 4 states. [2019-11-23 22:34:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:20,281 INFO L93 Difference]: Finished difference Result 3376 states and 5482 transitions. [2019-11-23 22:34:20,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:20,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-23 22:34:20,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:20,294 INFO L225 Difference]: With dead ends: 3376 [2019-11-23 22:34:20,296 INFO L226 Difference]: Without dead ends: 2182 [2019-11-23 22:34:20,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2019-11-23 22:34:20,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 1835. [2019-11-23 22:34:20,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2019-11-23 22:34:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2961 transitions. [2019-11-23 22:34:20,439 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2961 transitions. Word has length 63 [2019-11-23 22:34:20,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:20,440 INFO L462 AbstractCegarLoop]: Abstraction has 1835 states and 2961 transitions. [2019-11-23 22:34:20,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:20,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2961 transitions. [2019-11-23 22:34:20,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-23 22:34:20,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:20,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:20,442 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:20,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:20,443 INFO L82 PathProgramCache]: Analyzing trace with hash 235123444, now seen corresponding path program 1 times [2019-11-23 22:34:20,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:20,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142054458] [2019-11-23 22:34:20,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:20,522 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:34:20,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142054458] [2019-11-23 22:34:20,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:20,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:20,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174183381] [2019-11-23 22:34:20,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:20,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:20,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:20,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:20,524 INFO L87 Difference]: Start difference. First operand 1835 states and 2961 transitions. Second operand 4 states. [2019-11-23 22:34:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:20,753 INFO L93 Difference]: Finished difference Result 4988 states and 8093 transitions. [2019-11-23 22:34:20,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:20,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-23 22:34:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:20,771 INFO L225 Difference]: With dead ends: 4988 [2019-11-23 22:34:20,771 INFO L226 Difference]: Without dead ends: 3204 [2019-11-23 22:34:20,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2019-11-23 22:34:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 2683. [2019-11-23 22:34:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2019-11-23 22:34:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4326 transitions. [2019-11-23 22:34:20,965 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 4326 transitions. Word has length 64 [2019-11-23 22:34:20,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:20,966 INFO L462 AbstractCegarLoop]: Abstraction has 2683 states and 4326 transitions. [2019-11-23 22:34:20,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:20,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 4326 transitions. [2019-11-23 22:34:20,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-23 22:34:20,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:20,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:20,970 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:20,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:20,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1354495973, now seen corresponding path program 1 times [2019-11-23 22:34:20,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:20,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312653121] [2019-11-23 22:34:20,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:21,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312653121] [2019-11-23 22:34:21,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:21,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:34:21,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108735725] [2019-11-23 22:34:21,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:34:21,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:21,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:34:21,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:34:21,102 INFO L87 Difference]: Start difference. First operand 2683 states and 4326 transitions. Second operand 6 states. [2019-11-23 22:34:21,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:21,875 INFO L93 Difference]: Finished difference Result 11358 states and 18372 transitions. [2019-11-23 22:34:21,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:34:21,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-23 22:34:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:21,921 INFO L225 Difference]: With dead ends: 11358 [2019-11-23 22:34:21,921 INFO L226 Difference]: Without dead ends: 8726 [2019-11-23 22:34:21,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:34:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8726 states. [2019-11-23 22:34:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8726 to 7104. [2019-11-23 22:34:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7104 states. [2019-11-23 22:34:22,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7104 states to 7104 states and 11430 transitions. [2019-11-23 22:34:22,387 INFO L78 Accepts]: Start accepts. Automaton has 7104 states and 11430 transitions. Word has length 65 [2019-11-23 22:34:22,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:22,387 INFO L462 AbstractCegarLoop]: Abstraction has 7104 states and 11430 transitions. [2019-11-23 22:34:22,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:34:22,387 INFO L276 IsEmpty]: Start isEmpty. Operand 7104 states and 11430 transitions. [2019-11-23 22:34:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 22:34:22,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:22,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:22,390 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:22,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:22,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1658042238, now seen corresponding path program 1 times [2019-11-23 22:34:22,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:22,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955978236] [2019-11-23 22:34:22,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:22,449 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:34:22,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955978236] [2019-11-23 22:34:22,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:22,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:22,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718222422] [2019-11-23 22:34:22,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:22,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:22,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:22,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:22,451 INFO L87 Difference]: Start difference. First operand 7104 states and 11430 transitions. Second operand 3 states. [2019-11-23 22:34:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:22,959 INFO L93 Difference]: Finished difference Result 15437 states and 24986 transitions. [2019-11-23 22:34:22,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:22,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-23 22:34:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:23,002 INFO L225 Difference]: With dead ends: 15437 [2019-11-23 22:34:23,002 INFO L226 Difference]: Without dead ends: 10413 [2019-11-23 22:34:23,011 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:34:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10413 states. [2019-11-23 22:34:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10413 to 10411. [2019-11-23 22:34:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10411 states. [2019-11-23 22:34:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10411 states to 10411 states and 16735 transitions. [2019-11-23 22:34:23,560 INFO L78 Accepts]: Start accepts. Automaton has 10411 states and 16735 transitions. Word has length 66 [2019-11-23 22:34:23,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:23,560 INFO L462 AbstractCegarLoop]: Abstraction has 10411 states and 16735 transitions. [2019-11-23 22:34:23,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 10411 states and 16735 transitions. [2019-11-23 22:34:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 22:34:23,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:23,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:23,562 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:23,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:23,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1876407130, now seen corresponding path program 1 times [2019-11-23 22:34:23,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:23,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122766473] [2019-11-23 22:34:23,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:23,606 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:34:23,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122766473] [2019-11-23 22:34:23,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:23,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:23,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715447747] [2019-11-23 22:34:23,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:23,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:23,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:23,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:23,608 INFO L87 Difference]: Start difference. First operand 10411 states and 16735 transitions. Second operand 3 states. [2019-11-23 22:34:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:24,214 INFO L93 Difference]: Finished difference Result 23415 states and 37588 transitions. [2019-11-23 22:34:24,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:24,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-23 22:34:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:24,251 INFO L225 Difference]: With dead ends: 23415 [2019-11-23 22:34:24,251 INFO L226 Difference]: Without dead ends: 15686 [2019-11-23 22:34:24,264 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:34:24,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15686 states. [2019-11-23 22:34:24,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15686 to 15684. [2019-11-23 22:34:24,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15684 states. [2019-11-23 22:34:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15684 states to 15684 states and 25013 transitions. [2019-11-23 22:34:24,969 INFO L78 Accepts]: Start accepts. Automaton has 15684 states and 25013 transitions. Word has length 66 [2019-11-23 22:34:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:24,969 INFO L462 AbstractCegarLoop]: Abstraction has 15684 states and 25013 transitions. [2019-11-23 22:34:24,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 15684 states and 25013 transitions. [2019-11-23 22:34:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 22:34:24,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:24,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:24,970 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:24,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:24,971 INFO L82 PathProgramCache]: Analyzing trace with hash -430026452, now seen corresponding path program 1 times [2019-11-23 22:34:24,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:24,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019286652] [2019-11-23 22:34:24,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:25,007 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:34:25,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019286652] [2019-11-23 22:34:25,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:25,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:25,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946954452] [2019-11-23 22:34:25,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:25,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:25,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:25,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:25,010 INFO L87 Difference]: Start difference. First operand 15684 states and 25013 transitions. Second operand 3 states. [2019-11-23 22:34:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:25,694 INFO L93 Difference]: Finished difference Result 33357 states and 53275 transitions. [2019-11-23 22:34:25,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:25,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-23 22:34:25,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:25,744 INFO L225 Difference]: With dead ends: 33357 [2019-11-23 22:34:25,744 INFO L226 Difference]: Without dead ends: 22252 [2019-11-23 22:34:25,763 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:34:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22252 states. [2019-11-23 22:34:27,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22252 to 22250. [2019-11-23 22:34:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22250 states. [2019-11-23 22:34:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22250 states to 22250 states and 35237 transitions. [2019-11-23 22:34:27,081 INFO L78 Accepts]: Start accepts. Automaton has 22250 states and 35237 transitions. Word has length 66 [2019-11-23 22:34:27,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:27,083 INFO L462 AbstractCegarLoop]: Abstraction has 22250 states and 35237 transitions. [2019-11-23 22:34:27,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:27,083 INFO L276 IsEmpty]: Start isEmpty. Operand 22250 states and 35237 transitions. [2019-11-23 22:34:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:34:27,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:27,084 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:27,085 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:27,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:27,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1812850740, now seen corresponding path program 1 times [2019-11-23 22:34:27,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:27,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316833268] [2019-11-23 22:34:27,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:27,258 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:34:27,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316833268] [2019-11-23 22:34:27,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:27,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:34:27,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865647887] [2019-11-23 22:34:27,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:34:27,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:27,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:34:27,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:27,260 INFO L87 Difference]: Start difference. First operand 22250 states and 35237 transitions. Second operand 5 states. [2019-11-23 22:34:28,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:28,444 INFO L93 Difference]: Finished difference Result 51531 states and 81849 transitions. [2019-11-23 22:34:28,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:34:28,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-23 22:34:28,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:28,494 INFO L225 Difference]: With dead ends: 51531 [2019-11-23 22:34:28,495 INFO L226 Difference]: Without dead ends: 29366 [2019-11-23 22:34:28,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:28,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29366 states. [2019-11-23 22:34:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29366 to 22250. [2019-11-23 22:34:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22250 states. [2019-11-23 22:34:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22250 states to 22250 states and 35112 transitions. [2019-11-23 22:34:30,334 INFO L78 Accepts]: Start accepts. Automaton has 22250 states and 35112 transitions. Word has length 67 [2019-11-23 22:34:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:30,334 INFO L462 AbstractCegarLoop]: Abstraction has 22250 states and 35112 transitions. [2019-11-23 22:34:30,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:34:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 22250 states and 35112 transitions. [2019-11-23 22:34:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-23 22:34:30,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:30,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:30,335 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:30,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:30,335 INFO L82 PathProgramCache]: Analyzing trace with hash 528800646, now seen corresponding path program 1 times [2019-11-23 22:34:30,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:30,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035729519] [2019-11-23 22:34:30,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:30,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:34:30,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035729519] [2019-11-23 22:34:30,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:30,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:34:30,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609480118] [2019-11-23 22:34:30,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:34:30,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:30,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:34:30,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:30,522 INFO L87 Difference]: Start difference. First operand 22250 states and 35112 transitions. Second operand 5 states. [2019-11-23 22:34:32,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:32,005 INFO L93 Difference]: Finished difference Result 66797 states and 105973 transitions. [2019-11-23 22:34:32,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:34:32,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-23 22:34:32,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:32,076 INFO L225 Difference]: With dead ends: 66797 [2019-11-23 22:34:32,076 INFO L226 Difference]: Without dead ends: 44632 [2019-11-23 22:34:32,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44632 states. [2019-11-23 22:34:33,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44632 to 42468. [2019-11-23 22:34:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42468 states. [2019-11-23 22:34:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42468 states to 42468 states and 67130 transitions. [2019-11-23 22:34:33,745 INFO L78 Accepts]: Start accepts. Automaton has 42468 states and 67130 transitions. Word has length 70 [2019-11-23 22:34:33,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:33,746 INFO L462 AbstractCegarLoop]: Abstraction has 42468 states and 67130 transitions. [2019-11-23 22:34:33,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:34:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 42468 states and 67130 transitions. [2019-11-23 22:34:33,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 22:34:33,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:33,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:33,747 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:33,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:33,747 INFO L82 PathProgramCache]: Analyzing trace with hash -788958455, now seen corresponding path program 1 times [2019-11-23 22:34:33,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:33,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330006668] [2019-11-23 22:34:33,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:33,821 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:34:33,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330006668] [2019-11-23 22:34:33,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:33,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:34:33,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654578400] [2019-11-23 22:34:33,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:34:33,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:33,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:34:33,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:33,823 INFO L87 Difference]: Start difference. First operand 42468 states and 67130 transitions. Second operand 5 states. [2019-11-23 22:34:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:37,221 INFO L93 Difference]: Finished difference Result 69211 states and 108912 transitions. [2019-11-23 22:34:37,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:34:37,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-23 22:34:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:37,301 INFO L225 Difference]: With dead ends: 69211 [2019-11-23 22:34:37,301 INFO L226 Difference]: Without dead ends: 69209 [2019-11-23 22:34:37,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:34:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69209 states. [2019-11-23 22:34:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69209 to 43328. [2019-11-23 22:34:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43328 states. [2019-11-23 22:34:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43328 states to 43328 states and 67975 transitions. [2019-11-23 22:34:39,073 INFO L78 Accepts]: Start accepts. Automaton has 43328 states and 67975 transitions. Word has length 71 [2019-11-23 22:34:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:39,074 INFO L462 AbstractCegarLoop]: Abstraction has 43328 states and 67975 transitions. [2019-11-23 22:34:39,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:34:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 43328 states and 67975 transitions. [2019-11-23 22:34:39,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:34:39,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:39,076 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:39,076 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:39,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1288596918, now seen corresponding path program 1 times [2019-11-23 22:34:39,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:39,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832897431] [2019-11-23 22:34:39,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:34:39,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832897431] [2019-11-23 22:34:39,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:39,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:34:39,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941739262] [2019-11-23 22:34:39,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:34:39,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:39,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:34:39,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:39,166 INFO L87 Difference]: Start difference. First operand 43328 states and 67975 transitions. Second operand 5 states. [2019-11-23 22:34:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:42,643 INFO L93 Difference]: Finished difference Result 75966 states and 120155 transitions. [2019-11-23 22:34:42,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:34:42,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-11-23 22:34:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:42,710 INFO L225 Difference]: With dead ends: 75966 [2019-11-23 22:34:42,710 INFO L226 Difference]: Without dead ends: 60652 [2019-11-23 22:34:42,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:42,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60652 states. [2019-11-23 22:34:44,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60652 to 50656. [2019-11-23 22:34:44,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50656 states. [2019-11-23 22:34:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50656 states to 50656 states and 79579 transitions. [2019-11-23 22:34:44,877 INFO L78 Accepts]: Start accepts. Automaton has 50656 states and 79579 transitions. Word has length 97 [2019-11-23 22:34:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:44,878 INFO L462 AbstractCegarLoop]: Abstraction has 50656 states and 79579 transitions. [2019-11-23 22:34:44,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:34:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 50656 states and 79579 transitions. [2019-11-23 22:34:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:34:44,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:44,880 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:44,881 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:44,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:44,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1070232026, now seen corresponding path program 1 times [2019-11-23 22:34:44,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:44,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937729945] [2019-11-23 22:34:44,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:44,965 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-23 22:34:44,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937729945] [2019-11-23 22:34:44,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:44,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:34:44,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484753021] [2019-11-23 22:34:44,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:34:44,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:44,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:34:44,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:44,967 INFO L87 Difference]: Start difference. First operand 50656 states and 79579 transitions. Second operand 5 states. [2019-11-23 22:34:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:47,329 INFO L93 Difference]: Finished difference Result 84595 states and 133528 transitions. [2019-11-23 22:34:47,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:34:47,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-11-23 22:34:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:47,395 INFO L225 Difference]: With dead ends: 84595 [2019-11-23 22:34:47,395 INFO L226 Difference]: Without dead ends: 56381 [2019-11-23 22:34:47,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:34:47,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56381 states. [2019-11-23 22:34:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56381 to 54054. [2019-11-23 22:34:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54054 states. [2019-11-23 22:34:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54054 states to 54054 states and 84938 transitions. [2019-11-23 22:34:51,064 INFO L78 Accepts]: Start accepts. Automaton has 54054 states and 84938 transitions. Word has length 97 [2019-11-23 22:34:51,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:51,065 INFO L462 AbstractCegarLoop]: Abstraction has 54054 states and 84938 transitions. [2019-11-23 22:34:51,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:34:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand 54054 states and 84938 transitions. [2019-11-23 22:34:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:34:51,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:51,067 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:51,067 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:51,068 INFO L82 PathProgramCache]: Analyzing trace with hash 918301688, now seen corresponding path program 1 times [2019-11-23 22:34:51,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:51,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721985148] [2019-11-23 22:34:51,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:34:51,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721985148] [2019-11-23 22:34:51,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:51,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:34:51,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142606901] [2019-11-23 22:34:51,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:34:51,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:51,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:34:51,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:51,156 INFO L87 Difference]: Start difference. First operand 54054 states and 84938 transitions. Second operand 5 states. [2019-11-23 22:34:53,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:53,945 INFO L93 Difference]: Finished difference Result 85644 states and 135398 transitions. [2019-11-23 22:34:53,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:34:53,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-11-23 22:34:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:54,034 INFO L225 Difference]: With dead ends: 85644 [2019-11-23 22:34:54,035 INFO L226 Difference]: Without dead ends: 70418 [2019-11-23 22:34:54,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70418 states. [2019-11-23 22:34:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70418 to 60350. [2019-11-23 22:34:56,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60350 states. [2019-11-23 22:34:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60350 states to 60350 states and 94898 transitions. [2019-11-23 22:34:56,751 INFO L78 Accepts]: Start accepts. Automaton has 60350 states and 94898 transitions. Word has length 97 [2019-11-23 22:34:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:56,752 INFO L462 AbstractCegarLoop]: Abstraction has 60350 states and 94898 transitions. [2019-11-23 22:34:56,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:34:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 60350 states and 94898 transitions. [2019-11-23 22:34:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 22:34:56,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:56,754 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:56,754 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:56,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:56,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1354302985, now seen corresponding path program 1 times [2019-11-23 22:34:56,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:56,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713486612] [2019-11-23 22:34:56,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:56,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713486612] [2019-11-23 22:34:56,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758544417] [2019-11-23 22:34:56,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:34:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:56,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:34:56,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:34:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:34:57,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:34:57,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-23 22:34:57,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215069889] [2019-11-23 22:34:57,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:57,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:57,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:57,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:34:57,048 INFO L87 Difference]: Start difference. First operand 60350 states and 94898 transitions. Second operand 4 states. [2019-11-23 22:35:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:00,925 INFO L93 Difference]: Finished difference Result 87106 states and 137649 transitions. [2019-11-23 22:35:00,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:00,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-23 22:35:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:01,170 INFO L225 Difference]: With dead ends: 87106 [2019-11-23 22:35:01,170 INFO L226 Difference]: Without dead ends: 64464 [2019-11-23 22:35:01,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:35:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64464 states. [2019-11-23 22:35:04,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64464 to 59372. [2019-11-23 22:35:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59372 states. [2019-11-23 22:35:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59372 states to 59372 states and 93154 transitions. [2019-11-23 22:35:04,501 INFO L78 Accepts]: Start accepts. Automaton has 59372 states and 93154 transitions. Word has length 98 [2019-11-23 22:35:04,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:04,502 INFO L462 AbstractCegarLoop]: Abstraction has 59372 states and 93154 transitions. [2019-11-23 22:35:04,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:04,502 INFO L276 IsEmpty]: Start isEmpty. Operand 59372 states and 93154 transitions. [2019-11-23 22:35:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 22:35:04,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:04,505 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:35:04,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:35:04,709 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:04,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:04,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1163404503, now seen corresponding path program 1 times [2019-11-23 22:35:04,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:04,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342409419] [2019-11-23 22:35:04,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:35:04,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342409419] [2019-11-23 22:35:04,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:04,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:04,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984318840] [2019-11-23 22:35:04,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:04,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:04,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:04,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:04,765 INFO L87 Difference]: Start difference. First operand 59372 states and 93154 transitions. Second operand 3 states. [2019-11-23 22:35:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:11,017 INFO L93 Difference]: Finished difference Result 119278 states and 187974 transitions. [2019-11-23 22:35:11,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:11,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-23 22:35:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:11,157 INFO L225 Difference]: With dead ends: 119278 [2019-11-23 22:35:11,158 INFO L226 Difference]: Without dead ends: 100746 [2019-11-23 22:35:11,184 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:35:11,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100746 states. [2019-11-23 22:35:15,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100746 to 100505. [2019-11-23 22:35:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100505 states. [2019-11-23 22:35:15,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100505 states to 100505 states and 157839 transitions. [2019-11-23 22:35:15,807 INFO L78 Accepts]: Start accepts. Automaton has 100505 states and 157839 transitions. Word has length 98 [2019-11-23 22:35:15,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:15,808 INFO L462 AbstractCegarLoop]: Abstraction has 100505 states and 157839 transitions. [2019-11-23 22:35:15,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 100505 states and 157839 transitions. [2019-11-23 22:35:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 22:35:15,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:15,810 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:35:15,810 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:15,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:15,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1010324438, now seen corresponding path program 1 times [2019-11-23 22:35:15,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:15,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096907971] [2019-11-23 22:35:15,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:15,865 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:15,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096907971] [2019-11-23 22:35:15,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:15,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:15,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790987895] [2019-11-23 22:35:15,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:15,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:15,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:15,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:15,868 INFO L87 Difference]: Start difference. First operand 100505 states and 157839 transitions. Second operand 3 states. [2019-11-23 22:35:26,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:26,229 INFO L93 Difference]: Finished difference Result 295598 states and 463738 transitions. [2019-11-23 22:35:26,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:26,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 22:35:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:26,486 INFO L225 Difference]: With dead ends: 295598 [2019-11-23 22:35:26,487 INFO L226 Difference]: Without dead ends: 195178 [2019-11-23 22:35:26,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195178 states.