/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:34:23,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:34:23,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:34:23,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:34:23,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:34:23,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:34:23,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:34:24,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:34:24,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:34:24,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:34:24,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:34:24,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:34:24,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:34:24,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:34:24,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:34:24,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:34:24,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:34:24,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:34:24,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:34:24,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:34:24,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:34:24,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:34:24,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:34:24,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:34:24,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:34:24,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:34:24,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:34:24,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:34:24,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:34:24,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:34:24,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:34:24,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:34:24,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:34:24,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:34:24,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:34:24,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:34:24,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:34:24,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:34:24,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:34:24,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:34:24,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:34:24,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:34:24,081 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:34:24,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:34:24,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:34:24,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:34:24,083 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:34:24,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:34:24,083 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:34:24,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:34:24,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:34:24,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:34:24,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:34:24,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:34:24,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:34:24,084 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:34:24,085 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:34:24,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:34:24,085 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:34:24,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:34:24,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:34:24,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:34:24,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:34:24,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:34:24,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:34:24,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:34:24,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:34:24,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:34:24,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:34:24,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:34:24,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:34:24,088 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:34:24,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:34:24,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:34:24,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:34:24,375 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:34:24,376 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:34:24,377 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:34:24,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7a8bad59/9587fcb95ff449439ee3c7475bb5984e/FLAG0857211d1 [2019-11-23 22:34:24,974 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:34:24,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:34:24,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7a8bad59/9587fcb95ff449439ee3c7475bb5984e/FLAG0857211d1 [2019-11-23 22:34:25,262 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7a8bad59/9587fcb95ff449439ee3c7475bb5984e [2019-11-23 22:34:25,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:34:25,273 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:34:25,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:34:25,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:34:25,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:34:25,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:34:25" (1/1) ... [2019-11-23 22:34:25,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180777e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:25, skipping insertion in model container [2019-11-23 22:34:25,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:34:25" (1/1) ... [2019-11-23 22:34:25,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:34:25,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:34:25,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:34:25,856 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:34:25,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:34:26,015 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:34:26,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:26 WrapperNode [2019-11-23 22:34:26,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:34:26,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:34:26,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:34:26,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:34:26,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:26" (1/1) ... [2019-11-23 22:34:26,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:26" (1/1) ... [2019-11-23 22:34:26,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:34:26,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:34:26,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:34:26,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:34:26,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:26" (1/1) ... [2019-11-23 22:34:26,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:26" (1/1) ... [2019-11-23 22:34:26,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:26" (1/1) ... [2019-11-23 22:34:26,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:26" (1/1) ... [2019-11-23 22:34:26,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:26" (1/1) ... [2019-11-23 22:34:26,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:26" (1/1) ... [2019-11-23 22:34:26,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:26" (1/1) ... [2019-11-23 22:34:26,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:34:26,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:34:26,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:34:26,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:34:26,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:34:26,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:34:26,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:34:27,566 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:34:27,566 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:34:27,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:27 BoogieIcfgContainer [2019-11-23 22:34:27,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:34:27,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:34:27,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:34:27,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:34:27,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:34:25" (1/3) ... [2019-11-23 22:34:27,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55404a83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:27, skipping insertion in model container [2019-11-23 22:34:27,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:26" (2/3) ... [2019-11-23 22:34:27,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55404a83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:27, skipping insertion in model container [2019-11-23 22:34:27,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:27" (3/3) ... [2019-11-23 22:34:27,576 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:34:27,586 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:34:27,594 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:34:27,606 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:34:27,647 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:34:27,648 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:34:27,648 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:34:27,648 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:34:27,648 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:34:27,649 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:34:27,649 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:34:27,650 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:34:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states. [2019-11-23 22:34:27,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:34:27,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:27,701 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:27,701 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:27,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:27,707 INFO L82 PathProgramCache]: Analyzing trace with hash -574535014, now seen corresponding path program 1 times [2019-11-23 22:34:27,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:27,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131443174] [2019-11-23 22:34:27,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:28,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:28,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131443174] [2019-11-23 22:34:28,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:28,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:28,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508082244] [2019-11-23 22:34:28,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:28,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:28,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:28,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:28,236 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 3 states. [2019-11-23 22:34:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:28,411 INFO L93 Difference]: Finished difference Result 482 states and 831 transitions. [2019-11-23 22:34:28,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:28,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 22:34:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:28,440 INFO L225 Difference]: With dead ends: 482 [2019-11-23 22:34:28,440 INFO L226 Difference]: Without dead ends: 358 [2019-11-23 22:34:28,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-23 22:34:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-23 22:34:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-23 22:34:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 543 transitions. [2019-11-23 22:34:28,541 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 543 transitions. Word has length 100 [2019-11-23 22:34:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:28,543 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 543 transitions. [2019-11-23 22:34:28,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 543 transitions. [2019-11-23 22:34:28,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:34:28,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:28,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:28,548 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:28,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:28,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1640633924, now seen corresponding path program 1 times [2019-11-23 22:34:28,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:28,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659807722] [2019-11-23 22:34:28,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:28,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659807722] [2019-11-23 22:34:28,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:28,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:28,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235805976] [2019-11-23 22:34:28,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:28,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:28,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:28,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:28,841 INFO L87 Difference]: Start difference. First operand 356 states and 543 transitions. Second operand 4 states. [2019-11-23 22:34:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:28,994 INFO L93 Difference]: Finished difference Result 1034 states and 1572 transitions. [2019-11-23 22:34:28,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:28,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-23 22:34:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:28,999 INFO L225 Difference]: With dead ends: 1034 [2019-11-23 22:34:29,000 INFO L226 Difference]: Without dead ends: 687 [2019-11-23 22:34:29,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:29,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-11-23 22:34:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 685. [2019-11-23 22:34:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-11-23 22:34:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1034 transitions. [2019-11-23 22:34:29,061 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1034 transitions. Word has length 100 [2019-11-23 22:34:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:29,064 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1034 transitions. [2019-11-23 22:34:29,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1034 transitions. [2019-11-23 22:34:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:34:29,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:29,071 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:29,071 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:29,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:29,071 INFO L82 PathProgramCache]: Analyzing trace with hash -309110568, now seen corresponding path program 1 times [2019-11-23 22:34:29,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:29,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325617538] [2019-11-23 22:34:29,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:29,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325617538] [2019-11-23 22:34:29,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:29,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:29,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513543478] [2019-11-23 22:34:29,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:29,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:29,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:29,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:29,186 INFO L87 Difference]: Start difference. First operand 685 states and 1034 transitions. Second operand 3 states. [2019-11-23 22:34:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:29,244 INFO L93 Difference]: Finished difference Result 2017 states and 3040 transitions. [2019-11-23 22:34:29,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:29,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-23 22:34:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:29,253 INFO L225 Difference]: With dead ends: 2017 [2019-11-23 22:34:29,253 INFO L226 Difference]: Without dead ends: 1360 [2019-11-23 22:34:29,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2019-11-23 22:34:29,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 687. [2019-11-23 22:34:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-11-23 22:34:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1036 transitions. [2019-11-23 22:34:29,303 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1036 transitions. Word has length 101 [2019-11-23 22:34:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:29,303 INFO L462 AbstractCegarLoop]: Abstraction has 687 states and 1036 transitions. [2019-11-23 22:34:29,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1036 transitions. [2019-11-23 22:34:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 22:34:29,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:29,306 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:29,306 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:29,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:29,307 INFO L82 PathProgramCache]: Analyzing trace with hash 923754978, now seen corresponding path program 1 times [2019-11-23 22:34:29,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:29,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115263753] [2019-11-23 22:34:29,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:29,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115263753] [2019-11-23 22:34:29,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:29,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:29,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352579237] [2019-11-23 22:34:29,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:29,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:29,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:29,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:29,396 INFO L87 Difference]: Start difference. First operand 687 states and 1036 transitions. Second operand 3 states. [2019-11-23 22:34:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:29,495 INFO L93 Difference]: Finished difference Result 1818 states and 2761 transitions. [2019-11-23 22:34:29,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:29,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 22:34:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:29,503 INFO L225 Difference]: With dead ends: 1818 [2019-11-23 22:34:29,503 INFO L226 Difference]: Without dead ends: 1326 [2019-11-23 22:34:29,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-11-23 22:34:29,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1324. [2019-11-23 22:34:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2019-11-23 22:34:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1979 transitions. [2019-11-23 22:34:29,594 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1979 transitions. Word has length 102 [2019-11-23 22:34:29,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:29,595 INFO L462 AbstractCegarLoop]: Abstraction has 1324 states and 1979 transitions. [2019-11-23 22:34:29,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:29,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1979 transitions. [2019-11-23 22:34:29,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 22:34:29,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:29,598 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:29,598 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:29,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:29,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1935849921, now seen corresponding path program 1 times [2019-11-23 22:34:29,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:29,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152138192] [2019-11-23 22:34:29,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:29,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152138192] [2019-11-23 22:34:29,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:29,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:29,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027845414] [2019-11-23 22:34:29,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:29,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:29,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:29,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:29,766 INFO L87 Difference]: Start difference. First operand 1324 states and 1979 transitions. Second operand 4 states. [2019-11-23 22:34:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:29,842 INFO L93 Difference]: Finished difference Result 2153 states and 3239 transitions. [2019-11-23 22:34:29,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:29,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-23 22:34:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:29,851 INFO L225 Difference]: With dead ends: 2153 [2019-11-23 22:34:29,853 INFO L226 Difference]: Without dead ends: 1012 [2019-11-23 22:34:29,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-11-23 22:34:29,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2019-11-23 22:34:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-11-23 22:34:29,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1507 transitions. [2019-11-23 22:34:29,915 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1507 transitions. Word has length 102 [2019-11-23 22:34:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:29,916 INFO L462 AbstractCegarLoop]: Abstraction has 1012 states and 1507 transitions. [2019-11-23 22:34:29,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:29,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1507 transitions. [2019-11-23 22:34:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 22:34:29,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:29,919 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:29,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:29,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1659633849, now seen corresponding path program 1 times [2019-11-23 22:34:29,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:29,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202247447] [2019-11-23 22:34:29,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:29,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202247447] [2019-11-23 22:34:29,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:29,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:30,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952461978] [2019-11-23 22:34:30,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:30,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:30,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:30,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:30,002 INFO L87 Difference]: Start difference. First operand 1012 states and 1507 transitions. Second operand 3 states. [2019-11-23 22:34:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:30,124 INFO L93 Difference]: Finished difference Result 2287 states and 3527 transitions. [2019-11-23 22:34:30,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:30,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 22:34:30,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:30,133 INFO L225 Difference]: With dead ends: 2287 [2019-11-23 22:34:30,133 INFO L226 Difference]: Without dead ends: 1460 [2019-11-23 22:34:30,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2019-11-23 22:34:30,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1428. [2019-11-23 22:34:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-23 22:34:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2186 transitions. [2019-11-23 22:34:30,215 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2186 transitions. Word has length 102 [2019-11-23 22:34:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:30,216 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 2186 transitions. [2019-11-23 22:34:30,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2186 transitions. [2019-11-23 22:34:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 22:34:30,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:30,218 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:30,218 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:30,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:30,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1296481524, now seen corresponding path program 1 times [2019-11-23 22:34:30,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:30,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095566589] [2019-11-23 22:34:30,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:30,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095566589] [2019-11-23 22:34:30,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:30,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:30,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437186083] [2019-11-23 22:34:30,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:30,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:30,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:30,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:30,283 INFO L87 Difference]: Start difference. First operand 1428 states and 2186 transitions. Second operand 3 states. [2019-11-23 22:34:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:30,415 INFO L93 Difference]: Finished difference Result 3393 states and 5353 transitions. [2019-11-23 22:34:30,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:30,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-23 22:34:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:30,428 INFO L225 Difference]: With dead ends: 3393 [2019-11-23 22:34:30,428 INFO L226 Difference]: Without dead ends: 2234 [2019-11-23 22:34:30,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:30,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2019-11-23 22:34:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2172. [2019-11-23 22:34:30,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2172 states. [2019-11-23 22:34:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 3392 transitions. [2019-11-23 22:34:30,555 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 3392 transitions. Word has length 104 [2019-11-23 22:34:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:30,556 INFO L462 AbstractCegarLoop]: Abstraction has 2172 states and 3392 transitions. [2019-11-23 22:34:30,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:30,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3392 transitions. [2019-11-23 22:34:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 22:34:30,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:30,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:30,559 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:30,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:30,560 INFO L82 PathProgramCache]: Analyzing trace with hash -600271295, now seen corresponding path program 1 times [2019-11-23 22:34:30,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:30,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043397534] [2019-11-23 22:34:30,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:30,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043397534] [2019-11-23 22:34:30,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:30,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:30,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218193197] [2019-11-23 22:34:30,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:30,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:30,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:30,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:30,761 INFO L87 Difference]: Start difference. First operand 2172 states and 3392 transitions. Second operand 4 states. [2019-11-23 22:34:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:30,980 INFO L93 Difference]: Finished difference Result 5607 states and 8769 transitions. [2019-11-23 22:34:30,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:30,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-23 22:34:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:30,999 INFO L225 Difference]: With dead ends: 5607 [2019-11-23 22:34:30,999 INFO L226 Difference]: Without dead ends: 3454 [2019-11-23 22:34:31,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:31,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2019-11-23 22:34:31,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3452. [2019-11-23 22:34:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2019-11-23 22:34:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 5357 transitions. [2019-11-23 22:34:31,324 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 5357 transitions. Word has length 105 [2019-11-23 22:34:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:31,325 INFO L462 AbstractCegarLoop]: Abstraction has 3452 states and 5357 transitions. [2019-11-23 22:34:31,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 5357 transitions. [2019-11-23 22:34:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-23 22:34:31,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:31,330 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:31,330 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:31,330 INFO L82 PathProgramCache]: Analyzing trace with hash -668110988, now seen corresponding path program 1 times [2019-11-23 22:34:31,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:31,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888050714] [2019-11-23 22:34:31,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:31,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888050714] [2019-11-23 22:34:31,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:31,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:31,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246133095] [2019-11-23 22:34:31,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:31,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:31,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:31,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:31,543 INFO L87 Difference]: Start difference. First operand 3452 states and 5357 transitions. Second operand 4 states. [2019-11-23 22:34:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:31,749 INFO L93 Difference]: Finished difference Result 6107 states and 9506 transitions. [2019-11-23 22:34:31,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:31,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-23 22:34:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:31,767 INFO L225 Difference]: With dead ends: 6107 [2019-11-23 22:34:31,767 INFO L226 Difference]: Without dead ends: 3452 [2019-11-23 22:34:31,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2019-11-23 22:34:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3452. [2019-11-23 22:34:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3452 states. [2019-11-23 22:34:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 5356 transitions. [2019-11-23 22:34:32,036 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 5356 transitions. Word has length 107 [2019-11-23 22:34:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:32,037 INFO L462 AbstractCegarLoop]: Abstraction has 3452 states and 5356 transitions. [2019-11-23 22:34:32,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 5356 transitions. [2019-11-23 22:34:32,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-23 22:34:32,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:32,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:32,042 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:32,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:32,043 INFO L82 PathProgramCache]: Analyzing trace with hash -854881039, now seen corresponding path program 1 times [2019-11-23 22:34:32,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:32,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838771418] [2019-11-23 22:34:32,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:32,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838771418] [2019-11-23 22:34:32,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:32,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:32,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601799523] [2019-11-23 22:34:32,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:32,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:32,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:32,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:32,223 INFO L87 Difference]: Start difference. First operand 3452 states and 5356 transitions. Second operand 3 states. [2019-11-23 22:34:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:32,580 INFO L93 Difference]: Finished difference Result 8389 states and 13116 transitions. [2019-11-23 22:34:32,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:32,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-23 22:34:32,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:32,606 INFO L225 Difference]: With dead ends: 8389 [2019-11-23 22:34:32,607 INFO L226 Difference]: Without dead ends: 5309 [2019-11-23 22:34:32,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:32,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2019-11-23 22:34:32,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5307. [2019-11-23 22:34:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5307 states. [2019-11-23 22:34:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5307 states to 5307 states and 8164 transitions. [2019-11-23 22:34:33,017 INFO L78 Accepts]: Start accepts. Automaton has 5307 states and 8164 transitions. Word has length 107 [2019-11-23 22:34:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:33,018 INFO L462 AbstractCegarLoop]: Abstraction has 5307 states and 8164 transitions. [2019-11-23 22:34:33,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5307 states and 8164 transitions. [2019-11-23 22:34:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-23 22:34:33,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:33,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:33,022 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:33,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:33,022 INFO L82 PathProgramCache]: Analyzing trace with hash 914270762, now seen corresponding path program 1 times [2019-11-23 22:34:33,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:33,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479235118] [2019-11-23 22:34:33,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:33,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479235118] [2019-11-23 22:34:33,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:33,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:33,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209519488] [2019-11-23 22:34:33,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:33,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:33,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:33,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:33,090 INFO L87 Difference]: Start difference. First operand 5307 states and 8164 transitions. Second operand 3 states. [2019-11-23 22:34:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:33,595 INFO L93 Difference]: Finished difference Result 13931 states and 21827 transitions. [2019-11-23 22:34:33,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:33,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-23 22:34:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:33,632 INFO L225 Difference]: With dead ends: 13931 [2019-11-23 22:34:33,632 INFO L226 Difference]: Without dead ends: 8961 [2019-11-23 22:34:33,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:34:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8961 states. [2019-11-23 22:34:34,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8961 to 8679. [2019-11-23 22:34:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8679 states. [2019-11-23 22:34:34,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8679 states to 8679 states and 13555 transitions. [2019-11-23 22:34:34,122 INFO L78 Accepts]: Start accepts. Automaton has 8679 states and 13555 transitions. Word has length 109 [2019-11-23 22:34:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:34,123 INFO L462 AbstractCegarLoop]: Abstraction has 8679 states and 13555 transitions. [2019-11-23 22:34:34,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 8679 states and 13555 transitions. [2019-11-23 22:34:34,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-23 22:34:34,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:34,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:34,127 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:34,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:34,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1141316501, now seen corresponding path program 1 times [2019-11-23 22:34:34,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:34,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209287799] [2019-11-23 22:34:34,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:34,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209287799] [2019-11-23 22:34:34,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:34,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:34,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743679869] [2019-11-23 22:34:34,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:34,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:34,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:34,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:34,338 INFO L87 Difference]: Start difference. First operand 8679 states and 13555 transitions. Second operand 4 states. [2019-11-23 22:34:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:35,126 INFO L93 Difference]: Finished difference Result 24201 states and 37733 transitions. [2019-11-23 22:34:35,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:35,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-23 22:34:35,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:35,185 INFO L225 Difference]: With dead ends: 24201 [2019-11-23 22:34:35,186 INFO L226 Difference]: Without dead ends: 15561 [2019-11-23 22:34:35,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:35,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15561 states. [2019-11-23 22:34:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15561 to 15559. [2019-11-23 22:34:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15559 states. [2019-11-23 22:34:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15559 states to 15559 states and 24025 transitions. [2019-11-23 22:34:36,759 INFO L78 Accepts]: Start accepts. Automaton has 15559 states and 24025 transitions. Word has length 110 [2019-11-23 22:34:36,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:36,760 INFO L462 AbstractCegarLoop]: Abstraction has 15559 states and 24025 transitions. [2019-11-23 22:34:36,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 15559 states and 24025 transitions. [2019-11-23 22:34:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 22:34:36,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:36,768 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:36,768 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:36,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:36,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1423961921, now seen corresponding path program 1 times [2019-11-23 22:34:36,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:36,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149109518] [2019-11-23 22:34:36,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:36,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149109518] [2019-11-23 22:34:36,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:36,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:36,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424139944] [2019-11-23 22:34:36,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:36,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:36,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:36,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:36,838 INFO L87 Difference]: Start difference. First operand 15559 states and 24025 transitions. Second operand 3 states. [2019-11-23 22:34:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:38,347 INFO L93 Difference]: Finished difference Result 46483 states and 71824 transitions. [2019-11-23 22:34:38,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:38,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-23 22:34:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:38,422 INFO L225 Difference]: With dead ends: 46483 [2019-11-23 22:34:38,423 INFO L226 Difference]: Without dead ends: 31030 [2019-11-23 22:34:38,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31030 states. [2019-11-23 22:34:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31030 to 15565. [2019-11-23 22:34:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15565 states. [2019-11-23 22:34:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15565 states to 15565 states and 24031 transitions. [2019-11-23 22:34:39,396 INFO L78 Accepts]: Start accepts. Automaton has 15565 states and 24031 transitions. Word has length 111 [2019-11-23 22:34:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:39,396 INFO L462 AbstractCegarLoop]: Abstraction has 15565 states and 24031 transitions. [2019-11-23 22:34:39,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 15565 states and 24031 transitions. [2019-11-23 22:34:39,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-23 22:34:39,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:39,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:39,401 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:39,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:39,402 INFO L82 PathProgramCache]: Analyzing trace with hash 396960300, now seen corresponding path program 1 times [2019-11-23 22:34:39,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:39,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734334965] [2019-11-23 22:34:39,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:39,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734334965] [2019-11-23 22:34:39,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:39,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:39,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603382890] [2019-11-23 22:34:39,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:39,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:39,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:39,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:39,501 INFO L87 Difference]: Start difference. First operand 15565 states and 24031 transitions. Second operand 4 states. [2019-11-23 22:34:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:40,185 INFO L93 Difference]: Finished difference Result 31092 states and 48010 transitions. [2019-11-23 22:34:40,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:40,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-11-23 22:34:40,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:40,212 INFO L225 Difference]: With dead ends: 31092 [2019-11-23 22:34:40,212 INFO L226 Difference]: Without dead ends: 15559 [2019-11-23 22:34:40,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15559 states. [2019-11-23 22:34:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15559 to 15559. [2019-11-23 22:34:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15559 states. [2019-11-23 22:34:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15559 states to 15559 states and 24019 transitions. [2019-11-23 22:34:40,962 INFO L78 Accepts]: Start accepts. Automaton has 15559 states and 24019 transitions. Word has length 112 [2019-11-23 22:34:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:40,962 INFO L462 AbstractCegarLoop]: Abstraction has 15559 states and 24019 transitions. [2019-11-23 22:34:40,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 15559 states and 24019 transitions. [2019-11-23 22:34:40,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-23 22:34:40,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:40,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:40,968 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:40,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:40,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1369855469, now seen corresponding path program 1 times [2019-11-23 22:34:40,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:40,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82183792] [2019-11-23 22:34:40,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:41,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82183792] [2019-11-23 22:34:41,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:41,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:41,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984758335] [2019-11-23 22:34:41,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:41,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:41,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:41,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:41,054 INFO L87 Difference]: Start difference. First operand 15559 states and 24019 transitions. Second operand 3 states. [2019-11-23 22:34:41,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:41,908 INFO L93 Difference]: Finished difference Result 37293 states and 57686 transitions. [2019-11-23 22:34:41,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:41,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-23 22:34:41,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:41,941 INFO L225 Difference]: With dead ends: 37293 [2019-11-23 22:34:41,941 INFO L226 Difference]: Without dead ends: 22483 [2019-11-23 22:34:41,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22483 states. [2019-11-23 22:34:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22483 to 22481. [2019-11-23 22:34:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22481 states. [2019-11-23 22:34:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22481 states to 22481 states and 34190 transitions. [2019-11-23 22:34:43,493 INFO L78 Accepts]: Start accepts. Automaton has 22481 states and 34190 transitions. Word has length 112 [2019-11-23 22:34:43,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:43,493 INFO L462 AbstractCegarLoop]: Abstraction has 22481 states and 34190 transitions. [2019-11-23 22:34:43,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:43,493 INFO L276 IsEmpty]: Start isEmpty. Operand 22481 states and 34190 transitions. [2019-11-23 22:34:43,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-23 22:34:43,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:43,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:43,499 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:43,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:43,499 INFO L82 PathProgramCache]: Analyzing trace with hash -114669100, now seen corresponding path program 1 times [2019-11-23 22:34:43,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:43,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603920118] [2019-11-23 22:34:43,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:43,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603920118] [2019-11-23 22:34:43,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:43,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:43,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947768506] [2019-11-23 22:34:43,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:43,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:43,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:43,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:43,572 INFO L87 Difference]: Start difference. First operand 22481 states and 34190 transitions. Second operand 3 states. [2019-11-23 22:34:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:45,369 INFO L93 Difference]: Finished difference Result 61637 states and 95608 transitions. [2019-11-23 22:34:45,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:45,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-23 22:34:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:45,418 INFO L225 Difference]: With dead ends: 61637 [2019-11-23 22:34:45,418 INFO L226 Difference]: Without dead ends: 42059 [2019-11-23 22:34:45,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42059 states. [2019-11-23 22:34:48,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42059 to 41973. [2019-11-23 22:34:48,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41973 states. [2019-11-23 22:34:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41973 states to 41973 states and 63782 transitions. [2019-11-23 22:34:48,164 INFO L78 Accepts]: Start accepts. Automaton has 41973 states and 63782 transitions. Word has length 115 [2019-11-23 22:34:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:48,164 INFO L462 AbstractCegarLoop]: Abstraction has 41973 states and 63782 transitions. [2019-11-23 22:34:48,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 41973 states and 63782 transitions. [2019-11-23 22:34:48,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-23 22:34:48,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:48,170 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:48,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:48,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1641098498, now seen corresponding path program 1 times [2019-11-23 22:34:48,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:48,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909180162] [2019-11-23 22:34:48,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:48,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909180162] [2019-11-23 22:34:48,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:48,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:34:48,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451224536] [2019-11-23 22:34:48,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:34:48,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:48,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:34:48,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:34:48,398 INFO L87 Difference]: Start difference. First operand 41973 states and 63782 transitions. Second operand 8 states. [2019-11-23 22:34:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:50,311 INFO L93 Difference]: Finished difference Result 81591 states and 124774 transitions. [2019-11-23 22:34:50,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:50,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-11-23 22:34:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:50,353 INFO L225 Difference]: With dead ends: 81591 [2019-11-23 22:34:50,353 INFO L226 Difference]: Without dead ends: 41975 [2019-11-23 22:34:50,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:34:50,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41975 states. [2019-11-23 22:34:52,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41975 to 41973. [2019-11-23 22:34:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41973 states. [2019-11-23 22:34:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41973 states to 41973 states and 63590 transitions. [2019-11-23 22:34:52,192 INFO L78 Accepts]: Start accepts. Automaton has 41973 states and 63590 transitions. Word has length 115 [2019-11-23 22:34:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:52,192 INFO L462 AbstractCegarLoop]: Abstraction has 41973 states and 63590 transitions. [2019-11-23 22:34:52,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:34:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 41973 states and 63590 transitions. [2019-11-23 22:34:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-23 22:34:52,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:52,197 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:52,198 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:52,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:52,198 INFO L82 PathProgramCache]: Analyzing trace with hash 823040093, now seen corresponding path program 1 times [2019-11-23 22:34:52,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:52,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067142756] [2019-11-23 22:34:52,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:52,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067142756] [2019-11-23 22:34:52,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:52,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:34:52,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352487475] [2019-11-23 22:34:52,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:34:52,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:52,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:34:52,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:34:52,337 INFO L87 Difference]: Start difference. First operand 41973 states and 63590 transitions. Second operand 6 states. [2019-11-23 22:34:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:58,035 INFO L93 Difference]: Finished difference Result 158117 states and 241003 transitions. [2019-11-23 22:34:58,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:34:58,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-11-23 22:34:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:58,268 INFO L225 Difference]: With dead ends: 158117 [2019-11-23 22:34:58,268 INFO L226 Difference]: Without dead ends: 120065 [2019-11-23 22:34:58,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:34:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120065 states. [2019-11-23 22:35:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120065 to 120061. [2019-11-23 22:35:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120061 states. [2019-11-23 22:35:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120061 states to 120061 states and 182620 transitions. [2019-11-23 22:35:06,592 INFO L78 Accepts]: Start accepts. Automaton has 120061 states and 182620 transitions. Word has length 115 [2019-11-23 22:35:06,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:06,592 INFO L462 AbstractCegarLoop]: Abstraction has 120061 states and 182620 transitions. [2019-11-23 22:35:06,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:35:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 120061 states and 182620 transitions. [2019-11-23 22:35:06,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-23 22:35:06,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:06,597 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:35:06,597 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:06,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:06,598 INFO L82 PathProgramCache]: Analyzing trace with hash 452099970, now seen corresponding path program 1 times [2019-11-23 22:35:06,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:06,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287258335] [2019-11-23 22:35:06,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:06,734 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:35:06,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287258335] [2019-11-23 22:35:06,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:06,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:06,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554208836] [2019-11-23 22:35:06,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:06,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:06,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:06,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:06,738 INFO L87 Difference]: Start difference. First operand 120061 states and 182620 transitions. Second operand 4 states. [2019-11-23 22:35:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:14,565 INFO L93 Difference]: Finished difference Result 231119 states and 351418 transitions. [2019-11-23 22:35:14,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:14,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-23 22:35:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:14,714 INFO L225 Difference]: With dead ends: 231119 [2019-11-23 22:35:14,714 INFO L226 Difference]: Without dead ends: 111362 [2019-11-23 22:35:14,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111362 states. [2019-11-23 22:35:19,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111362 to 111320. [2019-11-23 22:35:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111320 states. [2019-11-23 22:35:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111320 states to 111320 states and 169093 transitions. [2019-11-23 22:35:20,034 INFO L78 Accepts]: Start accepts. Automaton has 111320 states and 169093 transitions. Word has length 115 [2019-11-23 22:35:20,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:20,035 INFO L462 AbstractCegarLoop]: Abstraction has 111320 states and 169093 transitions. [2019-11-23 22:35:20,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 111320 states and 169093 transitions. [2019-11-23 22:35:20,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-23 22:35:20,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:20,039 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:35:20,040 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:20,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:20,040 INFO L82 PathProgramCache]: Analyzing trace with hash 630278213, now seen corresponding path program 1 times [2019-11-23 22:35:20,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:20,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119589479] [2019-11-23 22:35:20,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:20,159 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:35:20,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119589479] [2019-11-23 22:35:20,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:20,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:20,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34878377] [2019-11-23 22:35:20,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:20,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:20,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:20,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:20,161 INFO L87 Difference]: Start difference. First operand 111320 states and 169093 transitions. Second operand 4 states. [2019-11-23 22:35:26,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:26,322 INFO L93 Difference]: Finished difference Result 222648 states and 338190 transitions. [2019-11-23 22:35:26,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:26,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-23 22:35:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:26,464 INFO L225 Difference]: With dead ends: 222648 [2019-11-23 22:35:26,465 INFO L226 Difference]: Without dead ends: 111485 [2019-11-23 22:35:26,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111485 states. [2019-11-23 22:35:34,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111485 to 111423. [2019-11-23 22:35:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111423 states. [2019-11-23 22:35:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111423 states to 111423 states and 169199 transitions. [2019-11-23 22:35:34,809 INFO L78 Accepts]: Start accepts. Automaton has 111423 states and 169199 transitions. Word has length 117 [2019-11-23 22:35:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:34,809 INFO L462 AbstractCegarLoop]: Abstraction has 111423 states and 169199 transitions. [2019-11-23 22:35:34,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 111423 states and 169199 transitions. [2019-11-23 22:35:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-23 22:35:34,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:34,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:35:34,814 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:34,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:34,814 INFO L82 PathProgramCache]: Analyzing trace with hash 856369869, now seen corresponding path program 1 times [2019-11-23 22:35:34,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:34,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144118075] [2019-11-23 22:35:34,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:34,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144118075] [2019-11-23 22:35:34,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:34,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:34,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336307266] [2019-11-23 22:35:34,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:34,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:34,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:34,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:34,852 INFO L87 Difference]: Start difference. First operand 111423 states and 169199 transitions. Second operand 3 states.