/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:06:35,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:06:35,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:06:35,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:06:35,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:06:35,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:06:35,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:06:35,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:06:35,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:06:35,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:06:35,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:06:35,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:06:35,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:06:35,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:06:35,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:06:35,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:06:35,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:06:36,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:06:36,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:06:36,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:06:36,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:06:36,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:06:36,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:06:36,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:06:36,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:06:36,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:06:36,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:06:36,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:06:36,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:06:36,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:06:36,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:06:36,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:06:36,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:06:36,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:06:36,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:06:36,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:06:36,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:06:36,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:06:36,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:06:36,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:06:36,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:06:36,022 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:06:36,036 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:06:36,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:06:36,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:06:36,037 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:06:36,037 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:06:36,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:06:36,038 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:06:36,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:06:36,038 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:06:36,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:06:36,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:06:36,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:06:36,039 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:06:36,039 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:06:36,039 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:06:36,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:06:36,040 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:06:36,040 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:06:36,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:06:36,040 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:06:36,041 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:06:36,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:06:36,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:06:36,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:06:36,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:06:36,042 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:06:36,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:06:36,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:06:36,042 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:06:36,042 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:06:36,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:06:36,364 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:06:36,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:06:36,370 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:06:36,371 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:06:36,371 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2019-11-23 22:06:36,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b99011697/1215fe00a66d470eaa82b585eaba7b3e/FLAG57f8f9a54 [2019-11-23 22:06:36,911 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:06:36,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2019-11-23 22:06:36,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b99011697/1215fe00a66d470eaa82b585eaba7b3e/FLAG57f8f9a54 [2019-11-23 22:06:37,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b99011697/1215fe00a66d470eaa82b585eaba7b3e [2019-11-23 22:06:37,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:06:37,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:06:37,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:37,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:06:37,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:06:37,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:37" (1/1) ... [2019-11-23 22:06:37,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ceb8032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:37, skipping insertion in model container [2019-11-23 22:06:37,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:37" (1/1) ... [2019-11-23 22:06:37,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:06:37,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:06:37,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:37,509 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:06:37,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:37,637 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:06:37,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:37 WrapperNode [2019-11-23 22:06:37,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:37,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:37,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:06:37,639 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:06:37,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:37" (1/1) ... [2019-11-23 22:06:37,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:37" (1/1) ... [2019-11-23 22:06:37,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:37,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:06:37,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:06:37,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:06:37,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:37" (1/1) ... [2019-11-23 22:06:37,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:37" (1/1) ... [2019-11-23 22:06:37,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:37" (1/1) ... [2019-11-23 22:06:37,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:37" (1/1) ... [2019-11-23 22:06:37,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:37" (1/1) ... [2019-11-23 22:06:37,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:37" (1/1) ... [2019-11-23 22:06:37,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:37" (1/1) ... [2019-11-23 22:06:37,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:06:37,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:06:37,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:06:37,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:06:37,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:06:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:06:37,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:06:38,178 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:06:38,178 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-23 22:06:38,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:38 BoogieIcfgContainer [2019-11-23 22:06:38,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:06:38,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:06:38,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:06:38,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:06:38,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:06:37" (1/3) ... [2019-11-23 22:06:38,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792b76e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:38, skipping insertion in model container [2019-11-23 22:06:38,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:37" (2/3) ... [2019-11-23 22:06:38,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792b76e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:38, skipping insertion in model container [2019-11-23 22:06:38,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:38" (3/3) ... [2019-11-23 22:06:38,187 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-11-23 22:06:38,197 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:06:38,203 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:06:38,214 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:06:38,239 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:06:38,240 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:06:38,240 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:06:38,240 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:06:38,240 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:06:38,240 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:06:38,240 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:06:38,241 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:06:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2019-11-23 22:06:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:38,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:38,263 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:38,264 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:38,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:38,269 INFO L82 PathProgramCache]: Analyzing trace with hash 458325173, now seen corresponding path program 1 times [2019-11-23 22:06:38,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:38,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115140450] [2019-11-23 22:06:38,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:38,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115140450] [2019-11-23 22:06:38,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:38,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:38,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737270705] [2019-11-23 22:06:38,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:38,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:38,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:38,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:38,512 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2019-11-23 22:06:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:38,605 INFO L93 Difference]: Finished difference Result 106 states and 192 transitions. [2019-11-23 22:06:38,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:38,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:38,633 INFO L225 Difference]: With dead ends: 106 [2019-11-23 22:06:38,634 INFO L226 Difference]: Without dead ends: 92 [2019-11-23 22:06:38,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-23 22:06:38,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2019-11-23 22:06:38,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-23 22:06:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 117 transitions. [2019-11-23 22:06:38,716 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 117 transitions. Word has length 20 [2019-11-23 22:06:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:38,717 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 117 transitions. [2019-11-23 22:06:38,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 117 transitions. [2019-11-23 22:06:38,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:06:38,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:38,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:38,721 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:38,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:38,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1130022729, now seen corresponding path program 1 times [2019-11-23 22:06:38,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:38,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745453495] [2019-11-23 22:06:38,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:38,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745453495] [2019-11-23 22:06:38,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:38,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:38,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284639166] [2019-11-23 22:06:38,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:38,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:38,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:38,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:38,864 INFO L87 Difference]: Start difference. First operand 62 states and 117 transitions. Second operand 3 states. [2019-11-23 22:06:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:38,907 INFO L93 Difference]: Finished difference Result 153 states and 288 transitions. [2019-11-23 22:06:38,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:38,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:06:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:38,911 INFO L225 Difference]: With dead ends: 153 [2019-11-23 22:06:38,912 INFO L226 Difference]: Without dead ends: 92 [2019-11-23 22:06:38,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-23 22:06:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-11-23 22:06:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-23 22:06:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 169 transitions. [2019-11-23 22:06:38,937 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 169 transitions. Word has length 20 [2019-11-23 22:06:38,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:38,937 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 169 transitions. [2019-11-23 22:06:38,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 169 transitions. [2019-11-23 22:06:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:38,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:38,939 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:38,939 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:38,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:38,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1323390526, now seen corresponding path program 1 times [2019-11-23 22:06:38,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:38,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634687846] [2019-11-23 22:06:38,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:39,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634687846] [2019-11-23 22:06:39,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:39,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:39,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582320400] [2019-11-23 22:06:39,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:39,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:39,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:39,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,002 INFO L87 Difference]: Start difference. First operand 90 states and 169 transitions. Second operand 3 states. [2019-11-23 22:06:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:39,021 INFO L93 Difference]: Finished difference Result 140 states and 257 transitions. [2019-11-23 22:06:39,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:39,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:39,023 INFO L225 Difference]: With dead ends: 140 [2019-11-23 22:06:39,023 INFO L226 Difference]: Without dead ends: 95 [2019-11-23 22:06:39,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-23 22:06:39,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-11-23 22:06:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-23 22:06:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 171 transitions. [2019-11-23 22:06:39,033 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 171 transitions. Word has length 21 [2019-11-23 22:06:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:39,034 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 171 transitions. [2019-11-23 22:06:39,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 171 transitions. [2019-11-23 22:06:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:39,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:39,035 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:39,035 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:39,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:39,036 INFO L82 PathProgramCache]: Analyzing trace with hash -670754180, now seen corresponding path program 1 times [2019-11-23 22:06:39,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:39,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997243539] [2019-11-23 22:06:39,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:39,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997243539] [2019-11-23 22:06:39,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:39,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:39,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850750683] [2019-11-23 22:06:39,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:39,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:39,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:39,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,094 INFO L87 Difference]: Start difference. First operand 93 states and 171 transitions. Second operand 3 states. [2019-11-23 22:06:39,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:39,115 INFO L93 Difference]: Finished difference Result 180 states and 332 transitions. [2019-11-23 22:06:39,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:39,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:39,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:39,117 INFO L225 Difference]: With dead ends: 180 [2019-11-23 22:06:39,118 INFO L226 Difference]: Without dead ends: 178 [2019-11-23 22:06:39,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-23 22:06:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 124. [2019-11-23 22:06:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-23 22:06:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 228 transitions. [2019-11-23 22:06:39,131 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 228 transitions. Word has length 21 [2019-11-23 22:06:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:39,131 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 228 transitions. [2019-11-23 22:06:39,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 228 transitions. [2019-11-23 22:06:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:06:39,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:39,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:39,133 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:39,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:39,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2035865214, now seen corresponding path program 1 times [2019-11-23 22:06:39,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:39,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294784701] [2019-11-23 22:06:39,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:39,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294784701] [2019-11-23 22:06:39,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:39,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:39,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927810285] [2019-11-23 22:06:39,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:39,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:39,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:39,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,184 INFO L87 Difference]: Start difference. First operand 124 states and 228 transitions. Second operand 3 states. [2019-11-23 22:06:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:39,214 INFO L93 Difference]: Finished difference Result 300 states and 554 transitions. [2019-11-23 22:06:39,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:39,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:06:39,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:39,216 INFO L225 Difference]: With dead ends: 300 [2019-11-23 22:06:39,217 INFO L226 Difference]: Without dead ends: 180 [2019-11-23 22:06:39,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-23 22:06:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-11-23 22:06:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-23 22:06:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 326 transitions. [2019-11-23 22:06:39,244 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 326 transitions. Word has length 21 [2019-11-23 22:06:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:39,245 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 326 transitions. [2019-11-23 22:06:39,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 326 transitions. [2019-11-23 22:06:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:39,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:39,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:39,247 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:39,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:39,247 INFO L82 PathProgramCache]: Analyzing trace with hash 681669292, now seen corresponding path program 1 times [2019-11-23 22:06:39,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:39,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631335697] [2019-11-23 22:06:39,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:39,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631335697] [2019-11-23 22:06:39,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:39,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:39,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576601920] [2019-11-23 22:06:39,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:39,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:39,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:39,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,297 INFO L87 Difference]: Start difference. First operand 178 states and 326 transitions. Second operand 3 states. [2019-11-23 22:06:39,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:39,318 INFO L93 Difference]: Finished difference Result 269 states and 489 transitions. [2019-11-23 22:06:39,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:39,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:39,332 INFO L225 Difference]: With dead ends: 269 [2019-11-23 22:06:39,332 INFO L226 Difference]: Without dead ends: 182 [2019-11-23 22:06:39,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-23 22:06:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-11-23 22:06:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-23 22:06:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 326 transitions. [2019-11-23 22:06:39,347 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 326 transitions. Word has length 22 [2019-11-23 22:06:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:39,347 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 326 transitions. [2019-11-23 22:06:39,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 326 transitions. [2019-11-23 22:06:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:39,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:39,350 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:39,350 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:39,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:39,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1312475414, now seen corresponding path program 1 times [2019-11-23 22:06:39,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:39,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987594753] [2019-11-23 22:06:39,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:39,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987594753] [2019-11-23 22:06:39,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:39,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:39,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902775913] [2019-11-23 22:06:39,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:39,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:39,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:39,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,413 INFO L87 Difference]: Start difference. First operand 180 states and 326 transitions. Second operand 3 states. [2019-11-23 22:06:39,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:39,453 INFO L93 Difference]: Finished difference Result 524 states and 952 transitions. [2019-11-23 22:06:39,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:39,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:39,456 INFO L225 Difference]: With dead ends: 524 [2019-11-23 22:06:39,457 INFO L226 Difference]: Without dead ends: 350 [2019-11-23 22:06:39,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-11-23 22:06:39,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2019-11-23 22:06:39,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-23 22:06:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 626 transitions. [2019-11-23 22:06:39,486 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 626 transitions. Word has length 22 [2019-11-23 22:06:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:39,486 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 626 transitions. [2019-11-23 22:06:39,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:39,487 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 626 transitions. [2019-11-23 22:06:39,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:06:39,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:39,489 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:39,490 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:39,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:39,490 INFO L82 PathProgramCache]: Analyzing trace with hash 275872488, now seen corresponding path program 1 times [2019-11-23 22:06:39,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:39,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357527671] [2019-11-23 22:06:39,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:39,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:06:39,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357527671] [2019-11-23 22:06:39,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:39,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:39,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168496446] [2019-11-23 22:06:39,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:39,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:39,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:39,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,528 INFO L87 Difference]: Start difference. First operand 348 states and 626 transitions. Second operand 3 states. [2019-11-23 22:06:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:39,545 INFO L93 Difference]: Finished difference Result 448 states and 812 transitions. [2019-11-23 22:06:39,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:39,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:06:39,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:39,548 INFO L225 Difference]: With dead ends: 448 [2019-11-23 22:06:39,548 INFO L226 Difference]: Without dead ends: 446 [2019-11-23 22:06:39,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-11-23 22:06:39,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 348. [2019-11-23 22:06:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-23 22:06:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 622 transitions. [2019-11-23 22:06:39,562 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 622 transitions. Word has length 22 [2019-11-23 22:06:39,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:39,562 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 622 transitions. [2019-11-23 22:06:39,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 622 transitions. [2019-11-23 22:06:39,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:39,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:39,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:39,564 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:39,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2031819437, now seen corresponding path program 1 times [2019-11-23 22:06:39,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:39,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702033837] [2019-11-23 22:06:39,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:39,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702033837] [2019-11-23 22:06:39,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:39,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:39,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001324877] [2019-11-23 22:06:39,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:39,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:39,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:39,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,592 INFO L87 Difference]: Start difference. First operand 348 states and 622 transitions. Second operand 3 states. [2019-11-23 22:06:39,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:39,610 INFO L93 Difference]: Finished difference Result 660 states and 1192 transitions. [2019-11-23 22:06:39,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:39,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:39,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:39,614 INFO L225 Difference]: With dead ends: 660 [2019-11-23 22:06:39,614 INFO L226 Difference]: Without dead ends: 658 [2019-11-23 22:06:39,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-11-23 22:06:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 480. [2019-11-23 22:06:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-11-23 22:06:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 846 transitions. [2019-11-23 22:06:39,634 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 846 transitions. Word has length 23 [2019-11-23 22:06:39,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:39,634 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 846 transitions. [2019-11-23 22:06:39,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:39,635 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 846 transitions. [2019-11-23 22:06:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:06:39,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:39,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:39,637 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:39,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:39,637 INFO L82 PathProgramCache]: Analyzing trace with hash 674799957, now seen corresponding path program 1 times [2019-11-23 22:06:39,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:39,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412308407] [2019-11-23 22:06:39,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:39,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412308407] [2019-11-23 22:06:39,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:39,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:39,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422045783] [2019-11-23 22:06:39,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:39,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:39,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:39,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,690 INFO L87 Difference]: Start difference. First operand 480 states and 846 transitions. Second operand 3 states. [2019-11-23 22:06:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:39,728 INFO L93 Difference]: Finished difference Result 1156 states and 2048 transitions. [2019-11-23 22:06:39,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:39,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:06:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:39,734 INFO L225 Difference]: With dead ends: 1156 [2019-11-23 22:06:39,734 INFO L226 Difference]: Without dead ends: 682 [2019-11-23 22:06:39,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-11-23 22:06:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-11-23 22:06:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-11-23 22:06:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1194 transitions. [2019-11-23 22:06:39,769 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1194 transitions. Word has length 23 [2019-11-23 22:06:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:39,772 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 1194 transitions. [2019-11-23 22:06:39,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1194 transitions. [2019-11-23 22:06:39,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:39,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:39,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:39,775 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:39,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:39,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1438319967, now seen corresponding path program 1 times [2019-11-23 22:06:39,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:39,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917749874] [2019-11-23 22:06:39,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:39,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917749874] [2019-11-23 22:06:39,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:39,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:39,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112972608] [2019-11-23 22:06:39,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:39,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:39,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:39,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,811 INFO L87 Difference]: Start difference. First operand 680 states and 1194 transitions. Second operand 3 states. [2019-11-23 22:06:39,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:39,836 INFO L93 Difference]: Finished difference Result 1028 states and 1800 transitions. [2019-11-23 22:06:39,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:39,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:39,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:39,841 INFO L225 Difference]: With dead ends: 1028 [2019-11-23 22:06:39,841 INFO L226 Difference]: Without dead ends: 694 [2019-11-23 22:06:39,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-11-23 22:06:39,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2019-11-23 22:06:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-11-23 22:06:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1202 transitions. [2019-11-23 22:06:39,864 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1202 transitions. Word has length 24 [2019-11-23 22:06:39,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:39,864 INFO L462 AbstractCegarLoop]: Abstraction has 692 states and 1202 transitions. [2019-11-23 22:06:39,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1202 transitions. [2019-11-23 22:06:39,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:39,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:39,866 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:39,867 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:39,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:39,868 INFO L82 PathProgramCache]: Analyzing trace with hash -555824739, now seen corresponding path program 1 times [2019-11-23 22:06:39,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:39,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860498309] [2019-11-23 22:06:39,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:39,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860498309] [2019-11-23 22:06:39,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:39,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:39,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961358531] [2019-11-23 22:06:39,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:39,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:39,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:39,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,908 INFO L87 Difference]: Start difference. First operand 692 states and 1202 transitions. Second operand 3 states. [2019-11-23 22:06:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:39,933 INFO L93 Difference]: Finished difference Result 1288 states and 2268 transitions. [2019-11-23 22:06:39,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:39,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:39,940 INFO L225 Difference]: With dead ends: 1288 [2019-11-23 22:06:39,941 INFO L226 Difference]: Without dead ends: 1286 [2019-11-23 22:06:39,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2019-11-23 22:06:39,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 964. [2019-11-23 22:06:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-11-23 22:06:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1642 transitions. [2019-11-23 22:06:39,970 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1642 transitions. Word has length 24 [2019-11-23 22:06:39,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:39,970 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 1642 transitions. [2019-11-23 22:06:39,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:39,970 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1642 transitions. [2019-11-23 22:06:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:06:39,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:39,972 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:39,972 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:39,973 INFO L82 PathProgramCache]: Analyzing trace with hash -2144172641, now seen corresponding path program 1 times [2019-11-23 22:06:39,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:39,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038005882] [2019-11-23 22:06:39,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:39,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:39,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038005882] [2019-11-23 22:06:39,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:39,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:39,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611700001] [2019-11-23 22:06:39,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:39,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:39,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:39,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:39,996 INFO L87 Difference]: Start difference. First operand 964 states and 1642 transitions. Second operand 3 states. [2019-11-23 22:06:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:40,027 INFO L93 Difference]: Finished difference Result 2296 states and 3932 transitions. [2019-11-23 22:06:40,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:40,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-23 22:06:40,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:40,035 INFO L225 Difference]: With dead ends: 2296 [2019-11-23 22:06:40,036 INFO L226 Difference]: Without dead ends: 1350 [2019-11-23 22:06:40,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:40,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-11-23 22:06:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1348. [2019-11-23 22:06:40,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-11-23 22:06:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2290 transitions. [2019-11-23 22:06:40,078 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2290 transitions. Word has length 24 [2019-11-23 22:06:40,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:40,079 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 2290 transitions. [2019-11-23 22:06:40,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2290 transitions. [2019-11-23 22:06:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:40,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:40,081 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:40,081 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:40,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:40,082 INFO L82 PathProgramCache]: Analyzing trace with hash -50484310, now seen corresponding path program 1 times [2019-11-23 22:06:40,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:40,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849312200] [2019-11-23 22:06:40,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:40,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849312200] [2019-11-23 22:06:40,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:40,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:40,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378236028] [2019-11-23 22:06:40,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:40,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:40,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:40,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:40,112 INFO L87 Difference]: Start difference. First operand 1348 states and 2290 transitions. Second operand 3 states. [2019-11-23 22:06:40,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:40,157 INFO L93 Difference]: Finished difference Result 2024 states and 3428 transitions. [2019-11-23 22:06:40,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:40,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:40,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:40,164 INFO L225 Difference]: With dead ends: 2024 [2019-11-23 22:06:40,164 INFO L226 Difference]: Without dead ends: 1366 [2019-11-23 22:06:40,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-11-23 22:06:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1364. [2019-11-23 22:06:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1364 states. [2019-11-23 22:06:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2290 transitions. [2019-11-23 22:06:40,201 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2290 transitions. Word has length 25 [2019-11-23 22:06:40,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:40,201 INFO L462 AbstractCegarLoop]: Abstraction has 1364 states and 2290 transitions. [2019-11-23 22:06:40,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2290 transitions. [2019-11-23 22:06:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:40,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:40,203 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:40,203 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:40,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:40,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2044629016, now seen corresponding path program 1 times [2019-11-23 22:06:40,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:40,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052751688] [2019-11-23 22:06:40,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:40,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052751688] [2019-11-23 22:06:40,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:40,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:40,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397705056] [2019-11-23 22:06:40,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:40,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:40,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:40,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:40,239 INFO L87 Difference]: Start difference. First operand 1364 states and 2290 transitions. Second operand 3 states. [2019-11-23 22:06:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:40,275 INFO L93 Difference]: Finished difference Result 2504 states and 4276 transitions. [2019-11-23 22:06:40,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:40,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:40,288 INFO L225 Difference]: With dead ends: 2504 [2019-11-23 22:06:40,288 INFO L226 Difference]: Without dead ends: 2502 [2019-11-23 22:06:40,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:40,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-11-23 22:06:40,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1924. [2019-11-23 22:06:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-11-23 22:06:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3154 transitions. [2019-11-23 22:06:40,344 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 3154 transitions. Word has length 25 [2019-11-23 22:06:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:40,345 INFO L462 AbstractCegarLoop]: Abstraction has 1924 states and 3154 transitions. [2019-11-23 22:06:40,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 3154 transitions. [2019-11-23 22:06:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:06:40,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:40,348 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:40,349 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:40,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:40,349 INFO L82 PathProgramCache]: Analyzing trace with hash 661990378, now seen corresponding path program 1 times [2019-11-23 22:06:40,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:40,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645305031] [2019-11-23 22:06:40,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:40,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645305031] [2019-11-23 22:06:40,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:40,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:40,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650074572] [2019-11-23 22:06:40,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:40,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:40,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:40,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:40,379 INFO L87 Difference]: Start difference. First operand 1924 states and 3154 transitions. Second operand 3 states. [2019-11-23 22:06:40,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:40,440 INFO L93 Difference]: Finished difference Result 4552 states and 7508 transitions. [2019-11-23 22:06:40,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:40,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:06:40,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:40,453 INFO L225 Difference]: With dead ends: 4552 [2019-11-23 22:06:40,453 INFO L226 Difference]: Without dead ends: 2662 [2019-11-23 22:06:40,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:40,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2019-11-23 22:06:40,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2660. [2019-11-23 22:06:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-11-23 22:06:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 4354 transitions. [2019-11-23 22:06:40,524 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 4354 transitions. Word has length 25 [2019-11-23 22:06:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:40,524 INFO L462 AbstractCegarLoop]: Abstraction has 2660 states and 4354 transitions. [2019-11-23 22:06:40,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 4354 transitions. [2019-11-23 22:06:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:06:40,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:40,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:40,527 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:40,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:40,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1041223700, now seen corresponding path program 1 times [2019-11-23 22:06:40,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:40,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675240299] [2019-11-23 22:06:40,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:40,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675240299] [2019-11-23 22:06:40,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:40,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:40,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3546953] [2019-11-23 22:06:40,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:40,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:40,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:40,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:40,562 INFO L87 Difference]: Start difference. First operand 2660 states and 4354 transitions. Second operand 3 states. [2019-11-23 22:06:40,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:40,600 INFO L93 Difference]: Finished difference Result 3992 states and 6516 transitions. [2019-11-23 22:06:40,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:40,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:06:40,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:40,613 INFO L225 Difference]: With dead ends: 3992 [2019-11-23 22:06:40,613 INFO L226 Difference]: Without dead ends: 2694 [2019-11-23 22:06:40,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:40,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2019-11-23 22:06:40,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2692. [2019-11-23 22:06:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2692 states. [2019-11-23 22:06:40,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4354 transitions. [2019-11-23 22:06:40,703 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 4354 transitions. Word has length 26 [2019-11-23 22:06:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:40,704 INFO L462 AbstractCegarLoop]: Abstraction has 2692 states and 4354 transitions. [2019-11-23 22:06:40,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 4354 transitions. [2019-11-23 22:06:40,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:06:40,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:40,709 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:40,709 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:40,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:40,710 INFO L82 PathProgramCache]: Analyzing trace with hash -952921006, now seen corresponding path program 1 times [2019-11-23 22:06:40,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:40,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517179333] [2019-11-23 22:06:40,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:40,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517179333] [2019-11-23 22:06:40,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:40,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:40,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337149827] [2019-11-23 22:06:40,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:40,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:40,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:40,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:40,739 INFO L87 Difference]: Start difference. First operand 2692 states and 4354 transitions. Second operand 3 states. [2019-11-23 22:06:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:40,801 INFO L93 Difference]: Finished difference Result 4872 states and 8036 transitions. [2019-11-23 22:06:40,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:40,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:06:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:40,824 INFO L225 Difference]: With dead ends: 4872 [2019-11-23 22:06:40,824 INFO L226 Difference]: Without dead ends: 4870 [2019-11-23 22:06:40,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2019-11-23 22:06:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 3844. [2019-11-23 22:06:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2019-11-23 22:06:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 6050 transitions. [2019-11-23 22:06:40,926 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 6050 transitions. Word has length 26 [2019-11-23 22:06:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:40,926 INFO L462 AbstractCegarLoop]: Abstraction has 3844 states and 6050 transitions. [2019-11-23 22:06:40,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 6050 transitions. [2019-11-23 22:06:40,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:06:40,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:40,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:40,932 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:40,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:40,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1753698388, now seen corresponding path program 1 times [2019-11-23 22:06:40,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:40,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460011425] [2019-11-23 22:06:40,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:40,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460011425] [2019-11-23 22:06:40,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:40,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:40,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291662158] [2019-11-23 22:06:40,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:40,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:40,960 INFO L87 Difference]: Start difference. First operand 3844 states and 6050 transitions. Second operand 3 states. [2019-11-23 22:06:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:41,031 INFO L93 Difference]: Finished difference Result 9032 states and 14308 transitions. [2019-11-23 22:06:41,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:41,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:06:41,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:41,071 INFO L225 Difference]: With dead ends: 9032 [2019-11-23 22:06:41,071 INFO L226 Difference]: Without dead ends: 5254 [2019-11-23 22:06:41,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2019-11-23 22:06:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5252. [2019-11-23 22:06:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5252 states. [2019-11-23 22:06:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 8258 transitions. [2019-11-23 22:06:41,239 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 8258 transitions. Word has length 26 [2019-11-23 22:06:41,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:41,240 INFO L462 AbstractCegarLoop]: Abstraction has 5252 states and 8258 transitions. [2019-11-23 22:06:41,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 8258 transitions. [2019-11-23 22:06:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:06:41,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:41,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:41,246 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:41,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:41,247 INFO L82 PathProgramCache]: Analyzing trace with hash 524433983, now seen corresponding path program 1 times [2019-11-23 22:06:41,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:41,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874897236] [2019-11-23 22:06:41,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:41,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874897236] [2019-11-23 22:06:41,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:41,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:41,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842537687] [2019-11-23 22:06:41,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:41,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:41,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:41,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:41,271 INFO L87 Difference]: Start difference. First operand 5252 states and 8258 transitions. Second operand 3 states. [2019-11-23 22:06:41,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:41,343 INFO L93 Difference]: Finished difference Result 7880 states and 12356 transitions. [2019-11-23 22:06:41,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:41,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:06:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:41,355 INFO L225 Difference]: With dead ends: 7880 [2019-11-23 22:06:41,355 INFO L226 Difference]: Without dead ends: 5318 [2019-11-23 22:06:41,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2019-11-23 22:06:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 5316. [2019-11-23 22:06:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2019-11-23 22:06:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 8258 transitions. [2019-11-23 22:06:41,464 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 8258 transitions. Word has length 27 [2019-11-23 22:06:41,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:41,464 INFO L462 AbstractCegarLoop]: Abstraction has 5316 states and 8258 transitions. [2019-11-23 22:06:41,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 8258 transitions. [2019-11-23 22:06:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:06:41,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:41,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:41,470 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:41,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:41,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1469710723, now seen corresponding path program 1 times [2019-11-23 22:06:41,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:41,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127540371] [2019-11-23 22:06:41,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:41,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127540371] [2019-11-23 22:06:41,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:41,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:41,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683896338] [2019-11-23 22:06:41,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:41,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:41,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:41,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:41,493 INFO L87 Difference]: Start difference. First operand 5316 states and 8258 transitions. Second operand 3 states. [2019-11-23 22:06:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:41,577 INFO L93 Difference]: Finished difference Result 9480 states and 15044 transitions. [2019-11-23 22:06:41,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:41,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:06:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:41,595 INFO L225 Difference]: With dead ends: 9480 [2019-11-23 22:06:41,595 INFO L226 Difference]: Without dead ends: 9478 [2019-11-23 22:06:41,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9478 states. [2019-11-23 22:06:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9478 to 7684. [2019-11-23 22:06:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7684 states. [2019-11-23 22:06:41,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 11586 transitions. [2019-11-23 22:06:41,803 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 11586 transitions. Word has length 27 [2019-11-23 22:06:41,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:41,803 INFO L462 AbstractCegarLoop]: Abstraction has 7684 states and 11586 transitions. [2019-11-23 22:06:41,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:41,803 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 11586 transitions. [2019-11-23 22:06:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:06:41,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:41,813 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:41,813 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:41,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:41,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1236908671, now seen corresponding path program 1 times [2019-11-23 22:06:41,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:41,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560795415] [2019-11-23 22:06:41,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:41,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560795415] [2019-11-23 22:06:41,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:41,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:41,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673074957] [2019-11-23 22:06:41,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:41,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:41,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:41,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:41,835 INFO L87 Difference]: Start difference. First operand 7684 states and 11586 transitions. Second operand 3 states. [2019-11-23 22:06:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:41,937 INFO L93 Difference]: Finished difference Result 17928 states and 27204 transitions. [2019-11-23 22:06:41,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:41,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:06:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:41,955 INFO L225 Difference]: With dead ends: 17928 [2019-11-23 22:06:41,956 INFO L226 Difference]: Without dead ends: 10374 [2019-11-23 22:06:41,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10374 states. [2019-11-23 22:06:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10374 to 10372. [2019-11-23 22:06:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10372 states. [2019-11-23 22:06:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10372 states to 10372 states and 15618 transitions. [2019-11-23 22:06:42,153 INFO L78 Accepts]: Start accepts. Automaton has 10372 states and 15618 transitions. Word has length 27 [2019-11-23 22:06:42,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:42,154 INFO L462 AbstractCegarLoop]: Abstraction has 10372 states and 15618 transitions. [2019-11-23 22:06:42,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 10372 states and 15618 transitions. [2019-11-23 22:06:42,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:06:42,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:42,170 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:42,170 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:42,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:42,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1683822281, now seen corresponding path program 1 times [2019-11-23 22:06:42,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:42,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692432529] [2019-11-23 22:06:42,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:42,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692432529] [2019-11-23 22:06:42,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:42,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:42,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993000160] [2019-11-23 22:06:42,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:42,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:42,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:42,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:42,346 INFO L87 Difference]: Start difference. First operand 10372 states and 15618 transitions. Second operand 3 states. [2019-11-23 22:06:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:42,493 INFO L93 Difference]: Finished difference Result 15560 states and 23364 transitions. [2019-11-23 22:06:42,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:42,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:06:42,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:42,522 INFO L225 Difference]: With dead ends: 15560 [2019-11-23 22:06:42,522 INFO L226 Difference]: Without dead ends: 10502 [2019-11-23 22:06:42,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:42,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10502 states. [2019-11-23 22:06:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10502 to 10500. [2019-11-23 22:06:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10500 states. [2019-11-23 22:06:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 15618 transitions. [2019-11-23 22:06:42,792 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 15618 transitions. Word has length 28 [2019-11-23 22:06:42,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:42,792 INFO L462 AbstractCegarLoop]: Abstraction has 10500 states and 15618 transitions. [2019-11-23 22:06:42,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 15618 transitions. [2019-11-23 22:06:42,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:06:42,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:42,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:42,807 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:42,808 INFO L82 PathProgramCache]: Analyzing trace with hash -310322425, now seen corresponding path program 1 times [2019-11-23 22:06:42,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:42,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466566241] [2019-11-23 22:06:42,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:42,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466566241] [2019-11-23 22:06:42,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:42,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:42,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698432704] [2019-11-23 22:06:42,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:42,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:42,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:42,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:42,839 INFO L87 Difference]: Start difference. First operand 10500 states and 15618 transitions. Second operand 3 states. [2019-11-23 22:06:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:43,002 INFO L93 Difference]: Finished difference Result 18440 states and 28036 transitions. [2019-11-23 22:06:43,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:43,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:06:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:43,037 INFO L225 Difference]: With dead ends: 18440 [2019-11-23 22:06:43,037 INFO L226 Difference]: Without dead ends: 18438 [2019-11-23 22:06:43,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18438 states. [2019-11-23 22:06:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18438 to 15364. [2019-11-23 22:06:43,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15364 states. [2019-11-23 22:06:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15364 states to 15364 states and 22146 transitions. [2019-11-23 22:06:43,534 INFO L78 Accepts]: Start accepts. Automaton has 15364 states and 22146 transitions. Word has length 28 [2019-11-23 22:06:43,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:43,534 INFO L462 AbstractCegarLoop]: Abstraction has 15364 states and 22146 transitions. [2019-11-23 22:06:43,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:43,535 INFO L276 IsEmpty]: Start isEmpty. Operand 15364 states and 22146 transitions. [2019-11-23 22:06:43,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:06:43,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:43,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:43,565 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:43,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:43,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1898670327, now seen corresponding path program 1 times [2019-11-23 22:06:43,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:43,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536296838] [2019-11-23 22:06:43,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:43,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536296838] [2019-11-23 22:06:43,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:43,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:43,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580196494] [2019-11-23 22:06:43,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:43,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:43,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:43,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:43,594 INFO L87 Difference]: Start difference. First operand 15364 states and 22146 transitions. Second operand 3 states. [2019-11-23 22:06:43,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:43,874 INFO L93 Difference]: Finished difference Result 35592 states and 51588 transitions. [2019-11-23 22:06:43,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:43,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-23 22:06:43,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:44,435 INFO L225 Difference]: With dead ends: 35592 [2019-11-23 22:06:44,435 INFO L226 Difference]: Without dead ends: 20486 [2019-11-23 22:06:44,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:44,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20486 states. [2019-11-23 22:06:44,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20486 to 20484. [2019-11-23 22:06:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20484 states. [2019-11-23 22:06:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20484 states to 20484 states and 29442 transitions. [2019-11-23 22:06:44,886 INFO L78 Accepts]: Start accepts. Automaton has 20484 states and 29442 transitions. Word has length 28 [2019-11-23 22:06:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:44,886 INFO L462 AbstractCegarLoop]: Abstraction has 20484 states and 29442 transitions. [2019-11-23 22:06:44,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 20484 states and 29442 transitions. [2019-11-23 22:06:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:06:44,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:44,919 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:44,919 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:44,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:44,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1029845804, now seen corresponding path program 1 times [2019-11-23 22:06:44,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:44,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160630597] [2019-11-23 22:06:44,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:44,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160630597] [2019-11-23 22:06:44,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:44,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:44,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785588182] [2019-11-23 22:06:44,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:44,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:44,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:44,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:44,978 INFO L87 Difference]: Start difference. First operand 20484 states and 29442 transitions. Second operand 3 states. [2019-11-23 22:06:45,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:45,277 INFO L93 Difference]: Finished difference Result 30728 states and 44036 transitions. [2019-11-23 22:06:45,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:45,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 22:06:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:45,321 INFO L225 Difference]: With dead ends: 30728 [2019-11-23 22:06:45,321 INFO L226 Difference]: Without dead ends: 20742 [2019-11-23 22:06:45,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20742 states. [2019-11-23 22:06:45,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20742 to 20740. [2019-11-23 22:06:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20740 states. [2019-11-23 22:06:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20740 states to 20740 states and 29442 transitions. [2019-11-23 22:06:45,856 INFO L78 Accepts]: Start accepts. Automaton has 20740 states and 29442 transitions. Word has length 29 [2019-11-23 22:06:45,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:45,856 INFO L462 AbstractCegarLoop]: Abstraction has 20740 states and 29442 transitions. [2019-11-23 22:06:45,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 20740 states and 29442 transitions. [2019-11-23 22:06:45,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:06:45,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:45,877 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:45,877 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:45,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:45,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1270976786, now seen corresponding path program 1 times [2019-11-23 22:06:45,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:45,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875579732] [2019-11-23 22:06:45,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:45,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875579732] [2019-11-23 22:06:45,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:45,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:45,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902002494] [2019-11-23 22:06:45,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:45,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:45,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:45,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:45,900 INFO L87 Difference]: Start difference. First operand 20740 states and 29442 transitions. Second operand 3 states. [2019-11-23 22:06:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:46,306 INFO L93 Difference]: Finished difference Result 35848 states and 51972 transitions. [2019-11-23 22:06:46,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:46,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 22:06:46,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:46,365 INFO L225 Difference]: With dead ends: 35848 [2019-11-23 22:06:46,365 INFO L226 Difference]: Without dead ends: 35846 [2019-11-23 22:06:46,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:46,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35846 states. [2019-11-23 22:06:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35846 to 30724. [2019-11-23 22:06:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30724 states. [2019-11-23 22:06:46,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30724 states to 30724 states and 42242 transitions. [2019-11-23 22:06:46,924 INFO L78 Accepts]: Start accepts. Automaton has 30724 states and 42242 transitions. Word has length 29 [2019-11-23 22:06:46,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:46,924 INFO L462 AbstractCegarLoop]: Abstraction has 30724 states and 42242 transitions. [2019-11-23 22:06:46,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:46,924 INFO L276 IsEmpty]: Start isEmpty. Operand 30724 states and 42242 transitions. [2019-11-23 22:06:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:06:46,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:46,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:46,962 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:46,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:46,962 INFO L82 PathProgramCache]: Analyzing trace with hash -317371116, now seen corresponding path program 1 times [2019-11-23 22:06:46,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:46,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878237530] [2019-11-23 22:06:46,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:46,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878237530] [2019-11-23 22:06:46,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:46,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:46,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840594241] [2019-11-23 22:06:46,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:46,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:46,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:46,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:46,991 INFO L87 Difference]: Start difference. First operand 30724 states and 42242 transitions. Second operand 3 states. [2019-11-23 22:06:47,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:47,712 INFO L93 Difference]: Finished difference Result 70664 states and 97540 transitions. [2019-11-23 22:06:47,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:47,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 22:06:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:47,793 INFO L225 Difference]: With dead ends: 70664 [2019-11-23 22:06:47,794 INFO L226 Difference]: Without dead ends: 40454 [2019-11-23 22:06:47,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:47,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40454 states. [2019-11-23 22:06:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40454 to 40452. [2019-11-23 22:06:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40452 states. [2019-11-23 22:06:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40452 states to 40452 states and 55298 transitions. [2019-11-23 22:06:49,456 INFO L78 Accepts]: Start accepts. Automaton has 40452 states and 55298 transitions. Word has length 29 [2019-11-23 22:06:49,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:49,456 INFO L462 AbstractCegarLoop]: Abstraction has 40452 states and 55298 transitions. [2019-11-23 22:06:49,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 40452 states and 55298 transitions. [2019-11-23 22:06:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:06:49,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:49,479 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:49,479 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:49,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:49,480 INFO L82 PathProgramCache]: Analyzing trace with hash 745789822, now seen corresponding path program 1 times [2019-11-23 22:06:49,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:49,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859964865] [2019-11-23 22:06:49,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:49,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859964865] [2019-11-23 22:06:49,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:49,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:49,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112542683] [2019-11-23 22:06:49,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:49,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:49,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:49,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:49,499 INFO L87 Difference]: Start difference. First operand 40452 states and 55298 transitions. Second operand 3 states. [2019-11-23 22:06:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:49,852 INFO L93 Difference]: Finished difference Result 60680 states and 82692 transitions. [2019-11-23 22:06:49,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:49,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-23 22:06:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:49,898 INFO L225 Difference]: With dead ends: 60680 [2019-11-23 22:06:49,899 INFO L226 Difference]: Without dead ends: 40966 [2019-11-23 22:06:49,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:49,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40966 states. [2019-11-23 22:06:50,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40966 to 40964. [2019-11-23 22:06:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40964 states. [2019-11-23 22:06:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40964 states to 40964 states and 55298 transitions. [2019-11-23 22:06:50,742 INFO L78 Accepts]: Start accepts. Automaton has 40964 states and 55298 transitions. Word has length 30 [2019-11-23 22:06:50,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:50,743 INFO L462 AbstractCegarLoop]: Abstraction has 40964 states and 55298 transitions. [2019-11-23 22:06:50,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:50,743 INFO L276 IsEmpty]: Start isEmpty. Operand 40964 states and 55298 transitions. [2019-11-23 22:06:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:06:50,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:50,779 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:50,779 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:50,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:50,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1248354884, now seen corresponding path program 1 times [2019-11-23 22:06:50,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:50,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263747893] [2019-11-23 22:06:50,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:50,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263747893] [2019-11-23 22:06:50,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:50,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:50,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399890508] [2019-11-23 22:06:50,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:50,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:50,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:50,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:50,811 INFO L87 Difference]: Start difference. First operand 40964 states and 55298 transitions. Second operand 3 states. [2019-11-23 22:06:51,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:51,771 INFO L93 Difference]: Finished difference Result 119816 states and 159748 transitions. [2019-11-23 22:06:51,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:51,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-23 22:06:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:51,840 INFO L225 Difference]: With dead ends: 119816 [2019-11-23 22:06:51,841 INFO L226 Difference]: Without dead ends: 79878 [2019-11-23 22:06:51,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:51,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79878 states. [2019-11-23 22:06:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79878 to 79876. [2019-11-23 22:06:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79876 states. [2019-11-23 22:06:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79876 states to 79876 states and 104450 transitions. [2019-11-23 22:06:53,855 INFO L78 Accepts]: Start accepts. Automaton has 79876 states and 104450 transitions. Word has length 30 [2019-11-23 22:06:53,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:53,855 INFO L462 AbstractCegarLoop]: Abstraction has 79876 states and 104450 transitions. [2019-11-23 22:06:53,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 79876 states and 104450 transitions. [2019-11-23 22:06:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:06:53,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:53,900 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:53,900 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:53,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:53,900 INFO L82 PathProgramCache]: Analyzing trace with hash 339993018, now seen corresponding path program 1 times [2019-11-23 22:06:53,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:53,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305617571] [2019-11-23 22:06:53,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:53,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305617571] [2019-11-23 22:06:53,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:53,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:53,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491360591] [2019-11-23 22:06:53,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:53,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:53,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:53,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:53,932 INFO L87 Difference]: Start difference. First operand 79876 states and 104450 transitions. Second operand 3 states. [2019-11-23 22:06:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:54,700 INFO L93 Difference]: Finished difference Result 88072 states and 118788 transitions. [2019-11-23 22:06:54,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:54,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-23 22:06:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:54,769 INFO L225 Difference]: With dead ends: 88072 [2019-11-23 22:06:54,769 INFO L226 Difference]: Without dead ends: 88070 [2019-11-23 22:06:54,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88070 states. [2019-11-23 22:06:57,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88070 to 79876. [2019-11-23 22:06:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79876 states. [2019-11-23 22:06:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79876 states to 79876 states and 103426 transitions. [2019-11-23 22:06:57,348 INFO L78 Accepts]: Start accepts. Automaton has 79876 states and 103426 transitions. Word has length 30 [2019-11-23 22:06:57,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,348 INFO L462 AbstractCegarLoop]: Abstraction has 79876 states and 103426 transitions. [2019-11-23 22:06:57,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 79876 states and 103426 transitions. [2019-11-23 22:06:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:06:57,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:57,391 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,392 INFO L82 PathProgramCache]: Analyzing trace with hash -44080279, now seen corresponding path program 1 times [2019-11-23 22:06:57,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917558675] [2019-11-23 22:06:57,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:06:57,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917558675] [2019-11-23 22:06:57,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645142515] [2019-11-23 22:06:57,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,422 INFO L87 Difference]: Start difference. First operand 79876 states and 103426 transitions. Second operand 3 states. [2019-11-23 22:06:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:58,864 INFO L93 Difference]: Finished difference Result 134152 states and 176132 transitions. [2019-11-23 22:06:58,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:58,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 22:06:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:59,052 INFO L225 Difference]: With dead ends: 134152 [2019-11-23 22:06:59,052 INFO L226 Difference]: Without dead ends: 134150 [2019-11-23 22:06:59,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134150 states. [2019-11-23 22:07:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134150 to 121860. [2019-11-23 22:07:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121860 states. [2019-11-23 22:07:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121860 states to 121860 states and 153602 transitions. [2019-11-23 22:07:00,844 INFO L78 Accepts]: Start accepts. Automaton has 121860 states and 153602 transitions. Word has length 31 [2019-11-23 22:07:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:00,844 INFO L462 AbstractCegarLoop]: Abstraction has 121860 states and 153602 transitions. [2019-11-23 22:07:00,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 121860 states and 153602 transitions. [2019-11-23 22:07:00,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:07:00,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:00,900 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:07:00,900 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:00,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:00,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1632428181, now seen corresponding path program 1 times [2019-11-23 22:07:00,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:00,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966855690] [2019-11-23 22:07:00,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:07:00,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966855690] [2019-11-23 22:07:00,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:00,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:00,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640687391] [2019-11-23 22:07:00,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:00,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:00,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:00,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:00,919 INFO L87 Difference]: Start difference. First operand 121860 states and 153602 transitions. Second operand 3 states. [2019-11-23 22:07:02,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:02,297 INFO L93 Difference]: Finished difference Result 277512 states and 350212 transitions. [2019-11-23 22:07:02,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:02,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 22:07:02,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:02,438 INFO L225 Difference]: With dead ends: 277512 [2019-11-23 22:07:02,438 INFO L226 Difference]: Without dead ends: 156678 [2019-11-23 22:07:02,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156678 states. [2019-11-23 22:07:06,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156678 to 156676. [2019-11-23 22:07:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156676 states. [2019-11-23 22:07:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156676 states to 156676 states and 194562 transitions. [2019-11-23 22:07:06,529 INFO L78 Accepts]: Start accepts. Automaton has 156676 states and 194562 transitions. Word has length 31 [2019-11-23 22:07:06,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:06,529 INFO L462 AbstractCegarLoop]: Abstraction has 156676 states and 194562 transitions. [2019-11-23 22:07:06,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 156676 states and 194562 transitions. [2019-11-23 22:07:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:07:07,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:07,045 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] [2019-11-23 22:07:07,045 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:07,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:07,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1366272847, now seen corresponding path program 1 times [2019-11-23 22:07:07,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:07,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540335172] [2019-11-23 22:07:07,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:07:07,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540335172] [2019-11-23 22:07:07,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:07,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:07,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429384433] [2019-11-23 22:07:07,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:07,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:07,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:07,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:07,072 INFO L87 Difference]: Start difference. First operand 156676 states and 194562 transitions. Second operand 3 states. [2019-11-23 22:07:08,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:08,116 INFO L93 Difference]: Finished difference Result 236552 states and 293892 transitions. [2019-11-23 22:07:08,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:08,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-23 22:07:08,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:08,250 INFO L225 Difference]: With dead ends: 236552 [2019-11-23 22:07:08,250 INFO L226 Difference]: Without dead ends: 159750 [2019-11-23 22:07:08,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:08,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159750 states. [2019-11-23 22:07:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159750 to 159748. [2019-11-23 22:07:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159748 states. [2019-11-23 22:07:12,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159748 states to 159748 states and 196610 transitions. [2019-11-23 22:07:12,708 INFO L78 Accepts]: Start accepts. Automaton has 159748 states and 196610 transitions. Word has length 32 [2019-11-23 22:07:12,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:12,708 INFO L462 AbstractCegarLoop]: Abstraction has 159748 states and 196610 transitions. [2019-11-23 22:07:12,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 159748 states and 196610 transitions. [2019-11-23 22:07:12,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:07:12,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:12,772 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] [2019-11-23 22:07:12,772 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:12,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:12,772 INFO L82 PathProgramCache]: Analyzing trace with hash 934549743, now seen corresponding path program 1 times [2019-11-23 22:07:12,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:12,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780741681] [2019-11-23 22:07:12,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:07:12,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780741681] [2019-11-23 22:07:12,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:12,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:12,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623504799] [2019-11-23 22:07:12,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:12,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:12,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:12,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:12,801 INFO L87 Difference]: Start difference. First operand 159748 states and 196610 transitions. Second operand 3 states. [2019-11-23 22:07:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:14,807 INFO L93 Difference]: Finished difference Result 262152 states and 323588 transitions. [2019-11-23 22:07:14,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:14,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-23 22:07:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:15,025 INFO L225 Difference]: With dead ends: 262152 [2019-11-23 22:07:15,025 INFO L226 Difference]: Without dead ends: 262150 [2019-11-23 22:07:15,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262150 states. [2019-11-23 22:07:20,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262150 to 245764. [2019-11-23 22:07:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245764 states. [2019-11-23 22:07:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245764 states to 245764 states and 294914 transitions. [2019-11-23 22:07:20,574 INFO L78 Accepts]: Start accepts. Automaton has 245764 states and 294914 transitions. Word has length 32 [2019-11-23 22:07:20,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:20,574 INFO L462 AbstractCegarLoop]: Abstraction has 245764 states and 294914 transitions. [2019-11-23 22:07:20,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 245764 states and 294914 transitions. [2019-11-23 22:07:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:07:20,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:20,692 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] [2019-11-23 22:07:20,692 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:20,693 INFO L82 PathProgramCache]: Analyzing trace with hash -653798159, now seen corresponding path program 1 times [2019-11-23 22:07:20,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:20,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585449286] [2019-11-23 22:07:20,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:07:20,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585449286] [2019-11-23 22:07:20,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:20,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:20,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770518831] [2019-11-23 22:07:20,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:20,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:20,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:20,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:20,714 INFO L87 Difference]: Start difference. First operand 245764 states and 294914 transitions. Second operand 3 states. [2019-11-23 22:07:26,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:26,254 INFO L93 Difference]: Finished difference Result 552968 states and 659460 transitions. [2019-11-23 22:07:26,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:26,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-23 22:07:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:26,508 INFO L225 Difference]: With dead ends: 552968 [2019-11-23 22:07:26,508 INFO L226 Difference]: Without dead ends: 311302 [2019-11-23 22:07:26,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311302 states. [2019-11-23 22:07:29,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311302 to 311300. [2019-11-23 22:07:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311300 states. [2019-11-23 22:07:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311300 states to 311300 states and 364546 transitions. [2019-11-23 22:07:30,962 INFO L78 Accepts]: Start accepts. Automaton has 311300 states and 364546 transitions. Word has length 32 [2019-11-23 22:07:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:30,962 INFO L462 AbstractCegarLoop]: Abstraction has 311300 states and 364546 transitions. [2019-11-23 22:07:30,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 311300 states and 364546 transitions. [2019-11-23 22:07:31,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:07:31,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:31,115 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] [2019-11-23 22:07:31,115 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:31,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:31,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1093512896, now seen corresponding path program 1 times [2019-11-23 22:07:31,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:31,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487696732] [2019-11-23 22:07:31,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:07:31,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487696732] [2019-11-23 22:07:31,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:31,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:31,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866842299] [2019-11-23 22:07:31,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:31,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:31,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:31,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:31,138 INFO L87 Difference]: Start difference. First operand 311300 states and 364546 transitions. Second operand 3 states. [2019-11-23 22:07:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:37,204 INFO L93 Difference]: Finished difference Result 466952 states and 544772 transitions. [2019-11-23 22:07:37,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:37,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-23 22:07:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:37,476 INFO L225 Difference]: With dead ends: 466952 [2019-11-23 22:07:37,476 INFO L226 Difference]: Without dead ends: 315398 [2019-11-23 22:07:37,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315398 states. [2019-11-23 22:07:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315398 to 315396. [2019-11-23 22:07:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315396 states. [2019-11-23 22:07:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315396 states to 315396 states and 364546 transitions. [2019-11-23 22:07:41,909 INFO L78 Accepts]: Start accepts. Automaton has 315396 states and 364546 transitions. Word has length 33 [2019-11-23 22:07:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:07:41,909 INFO L462 AbstractCegarLoop]: Abstraction has 315396 states and 364546 transitions. [2019-11-23 22:07:41,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:07:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 315396 states and 364546 transitions. [2019-11-23 22:07:42,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:07:42,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:07:42,067 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] [2019-11-23 22:07:42,067 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:07:42,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:07:42,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1207309694, now seen corresponding path program 1 times [2019-11-23 22:07:42,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:07:42,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258296740] [2019-11-23 22:07:42,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:07:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:07:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:07:42,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258296740] [2019-11-23 22:07:42,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:07:42,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:07:42,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528250945] [2019-11-23 22:07:42,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:07:42,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:07:42,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:07:42,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:42,094 INFO L87 Difference]: Start difference. First operand 315396 states and 364546 transitions. Second operand 3 states. [2019-11-23 22:07:46,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:07:46,821 INFO L93 Difference]: Finished difference Result 507910 states and 581635 transitions. [2019-11-23 22:07:46,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:07:46,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-23 22:07:46,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:07:47,275 INFO L225 Difference]: With dead ends: 507910 [2019-11-23 22:07:47,275 INFO L226 Difference]: Without dead ends: 507908 [2019-11-23 22:07:47,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:07:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507908 states.