/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_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:32:29,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:32:29,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:32:29,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:32:29,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:32:29,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:32:29,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:32:29,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:32:29,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:32:29,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:32:29,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:32:29,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:32:29,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:32:29,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:32:29,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:32:29,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:32:29,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:32:29,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:32:29,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:32:29,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:32:29,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:32:29,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:32:29,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:32:29,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:32:29,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:32:29,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:32:29,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:32:29,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:32:29,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:32:29,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:32:29,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:32:29,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:32:29,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:32:29,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:32:29,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:32:29,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:32:29,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:32:29,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:32:29,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:32:29,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:32:29,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:32:29,608 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:32:29,630 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:32:29,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:32:29,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:32:29,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:32:29,633 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:32:29,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:32:29,633 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:32:29,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:32:29,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:32:29,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:32:29,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:32:29,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:32:29,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:32:29,636 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:32:29,636 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:32:29,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:32:29,636 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:32:29,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:32:29,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:32:29,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:32:29,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:32:29,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:32:29,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:32:29,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:32:29,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:32:29,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:32:29,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:32:29,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:32:29,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:32:29,639 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:32:29,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:32:29,917 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:32:29,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:32:29,922 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:32:29,922 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:32:29,923 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:32:29,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d15e9a82/4abfb9f38bbc4c679c5b7f1df2941754/FLAG5194ca0f0 [2019-11-23 22:32:30,468 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:32:30,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:32:30,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d15e9a82/4abfb9f38bbc4c679c5b7f1df2941754/FLAG5194ca0f0 [2019-11-23 22:32:30,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d15e9a82/4abfb9f38bbc4c679c5b7f1df2941754 [2019-11-23 22:32:30,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:32:30,803 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:32:30,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:32:30,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:32:30,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:32:30,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:30" (1/1) ... [2019-11-23 22:32:30,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397ebe0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:30, skipping insertion in model container [2019-11-23 22:32:30,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:32:30" (1/1) ... [2019-11-23 22:32:30,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:32:30,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:32:31,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:32:31,264 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:32:31,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:32:31,366 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:32:31,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31 WrapperNode [2019-11-23 22:32:31,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:32:31,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:32:31,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:32:31,367 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:32:31,376 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:32:31" (1/1) ... [2019-11-23 22:32:31,387 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:32:31" (1/1) ... [2019-11-23 22:32:31,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:32:31,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:32:31,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:32:31,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:32:31,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:31,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:31,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:31,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:31,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:31,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:31,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (1/1) ... [2019-11-23 22:32:31,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:32:31,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:32:31,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:32:31,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:32:31,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (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:32:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:32:31,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:32:32,295 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:32:32,296 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:32:32,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:32 BoogieIcfgContainer [2019-11-23 22:32:32,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:32:32,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:32:32,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:32:32,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:32:32,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:32:30" (1/3) ... [2019-11-23 22:32:32,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a5d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:32, skipping insertion in model container [2019-11-23 22:32:32,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:32:31" (2/3) ... [2019-11-23 22:32:32,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a5d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:32:32, skipping insertion in model container [2019-11-23 22:32:32,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:32:32" (3/3) ... [2019-11-23 22:32:32,305 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-23 22:32:32,315 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:32:32,324 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:32:32,336 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:32:32,363 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:32:32,363 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:32:32,363 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:32:32,363 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:32:32,363 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:32:32,364 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:32:32,364 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:32:32,364 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:32:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 22:32:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 22:32:32,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:32,392 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] [2019-11-23 22:32:32,392 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:32,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:32,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1935961454, now seen corresponding path program 1 times [2019-11-23 22:32:32,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:32,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811930071] [2019-11-23 22:32:32,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:32,727 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:32:32,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811930071] [2019-11-23 22:32:32,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:32,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:32,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566672748] [2019-11-23 22:32:32,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:32,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:32,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:32,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:32,755 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-11-23 22:32:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:32,879 INFO L93 Difference]: Finished difference Result 286 states and 465 transitions. [2019-11-23 22:32:32,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:32,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-23 22:32:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:32,897 INFO L225 Difference]: With dead ends: 286 [2019-11-23 22:32:32,897 INFO L226 Difference]: Without dead ends: 218 [2019-11-23 22:32:32,901 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:32:32,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-23 22:32:32,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2019-11-23 22:32:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 22:32:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 319 transitions. [2019-11-23 22:32:32,972 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 319 transitions. Word has length 49 [2019-11-23 22:32:32,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:32,973 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 319 transitions. [2019-11-23 22:32:32,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:32,973 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 319 transitions. [2019-11-23 22:32:32,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:32:32,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:32,976 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] [2019-11-23 22:32:32,976 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:32,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:32,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1118200662, now seen corresponding path program 1 times [2019-11-23 22:32:32,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:32,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923424236] [2019-11-23 22:32:32,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:33,102 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:32:33,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923424236] [2019-11-23 22:32:33,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:33,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:33,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295077070] [2019-11-23 22:32:33,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:33,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:33,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:33,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:33,106 INFO L87 Difference]: Start difference. First operand 216 states and 319 transitions. Second operand 3 states. [2019-11-23 22:32:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:33,176 INFO L93 Difference]: Finished difference Result 522 states and 789 transitions. [2019-11-23 22:32:33,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:33,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-23 22:32:33,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:33,183 INFO L225 Difference]: With dead ends: 522 [2019-11-23 22:32:33,184 INFO L226 Difference]: Without dead ends: 370 [2019-11-23 22:32:33,188 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:32:33,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-11-23 22:32:33,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 368. [2019-11-23 22:32:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-23 22:32:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 545 transitions. [2019-11-23 22:32:33,239 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 545 transitions. Word has length 52 [2019-11-23 22:32:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:33,240 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 545 transitions. [2019-11-23 22:32:33,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 545 transitions. [2019-11-23 22:32:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:32:33,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:33,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:33,245 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:33,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:33,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1570903849, now seen corresponding path program 1 times [2019-11-23 22:32:33,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:33,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092135046] [2019-11-23 22:32:33,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:33,331 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:32:33,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092135046] [2019-11-23 22:32:33,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:33,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:33,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516671514] [2019-11-23 22:32:33,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:33,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:33,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:33,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:33,334 INFO L87 Difference]: Start difference. First operand 368 states and 545 transitions. Second operand 3 states. [2019-11-23 22:32:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:33,396 INFO L93 Difference]: Finished difference Result 884 states and 1325 transitions. [2019-11-23 22:32:33,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:33,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-23 22:32:33,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:33,401 INFO L225 Difference]: With dead ends: 884 [2019-11-23 22:32:33,401 INFO L226 Difference]: Without dead ends: 628 [2019-11-23 22:32:33,403 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:32:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-11-23 22:32:33,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2019-11-23 22:32:33,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-23 22:32:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 919 transitions. [2019-11-23 22:32:33,436 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 919 transitions. Word has length 52 [2019-11-23 22:32:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:33,437 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 919 transitions. [2019-11-23 22:32:33,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 919 transitions. [2019-11-23 22:32:33,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:32:33,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:33,440 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] [2019-11-23 22:32:33,440 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:33,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:33,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1320706551, now seen corresponding path program 1 times [2019-11-23 22:32:33,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:33,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537107399] [2019-11-23 22:32:33,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:33,568 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:32:33,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537107399] [2019-11-23 22:32:33,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:33,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:33,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759495127] [2019-11-23 22:32:33,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:33,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:33,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:33,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:33,570 INFO L87 Difference]: Start difference. First operand 626 states and 919 transitions. Second operand 3 states. [2019-11-23 22:32:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:33,650 INFO L93 Difference]: Finished difference Result 1644 states and 2427 transitions. [2019-11-23 22:32:33,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:33,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-23 22:32:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:33,657 INFO L225 Difference]: With dead ends: 1644 [2019-11-23 22:32:33,657 INFO L226 Difference]: Without dead ends: 1106 [2019-11-23 22:32:33,658 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:32:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-11-23 22:32:33,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1104. [2019-11-23 22:32:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-11-23 22:32:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1589 transitions. [2019-11-23 22:32:33,714 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1589 transitions. Word has length 52 [2019-11-23 22:32:33,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:33,714 INFO L462 AbstractCegarLoop]: Abstraction has 1104 states and 1589 transitions. [2019-11-23 22:32:33,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:33,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1589 transitions. [2019-11-23 22:32:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:32:33,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:33,717 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] [2019-11-23 22:32:33,717 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:33,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1834372633, now seen corresponding path program 1 times [2019-11-23 22:32:33,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:33,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458323232] [2019-11-23 22:32:33,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:33,890 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:32:33,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458323232] [2019-11-23 22:32:33,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:33,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:32:33,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913357482] [2019-11-23 22:32:33,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:32:33,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:33,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:32:33,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:32:33,893 INFO L87 Difference]: Start difference. First operand 1104 states and 1589 transitions. Second operand 9 states. [2019-11-23 22:32:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:35,482 INFO L93 Difference]: Finished difference Result 4909 states and 7017 transitions. [2019-11-23 22:32:35,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 22:32:35,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-11-23 22:32:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:35,503 INFO L225 Difference]: With dead ends: 4909 [2019-11-23 22:32:35,504 INFO L226 Difference]: Without dead ends: 4547 [2019-11-23 22:32:35,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:32:35,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4547 states. [2019-11-23 22:32:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4547 to 1143. [2019-11-23 22:32:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1143 states. [2019-11-23 22:32:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1638 transitions. [2019-11-23 22:32:35,618 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1638 transitions. Word has length 53 [2019-11-23 22:32:35,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:35,619 INFO L462 AbstractCegarLoop]: Abstraction has 1143 states and 1638 transitions. [2019-11-23 22:32:35,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:32:35,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1638 transitions. [2019-11-23 22:32:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:32:35,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:35,621 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] [2019-11-23 22:32:35,621 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:35,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:35,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1785989049, now seen corresponding path program 1 times [2019-11-23 22:32:35,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:35,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457675003] [2019-11-23 22:32:35,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:35,732 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:32:35,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457675003] [2019-11-23 22:32:35,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:35,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:32:35,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448882679] [2019-11-23 22:32:35,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:32:35,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:35,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:32:35,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:32:35,734 INFO L87 Difference]: Start difference. First operand 1143 states and 1638 transitions. Second operand 9 states. [2019-11-23 22:32:37,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:37,354 INFO L93 Difference]: Finished difference Result 4332 states and 6126 transitions. [2019-11-23 22:32:37,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 22:32:37,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-11-23 22:32:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:37,377 INFO L225 Difference]: With dead ends: 4332 [2019-11-23 22:32:37,378 INFO L226 Difference]: Without dead ends: 3962 [2019-11-23 22:32:37,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-11-23 22:32:37,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2019-11-23 22:32:37,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 1201. [2019-11-23 22:32:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1201 states. [2019-11-23 22:32:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1714 transitions. [2019-11-23 22:32:37,545 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1714 transitions. Word has length 53 [2019-11-23 22:32:37,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:37,546 INFO L462 AbstractCegarLoop]: Abstraction has 1201 states and 1714 transitions. [2019-11-23 22:32:37,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:32:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1714 transitions. [2019-11-23 22:32:37,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:32:37,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:37,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] [2019-11-23 22:32:37,548 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:37,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:37,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1176645599, now seen corresponding path program 1 times [2019-11-23 22:32:37,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:37,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705925198] [2019-11-23 22:32:37,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:37,690 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:32:37,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705925198] [2019-11-23 22:32:37,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:37,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:32:37,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870337182] [2019-11-23 22:32:37,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:32:37,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:37,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:32:37,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:32:37,703 INFO L87 Difference]: Start difference. First operand 1201 states and 1714 transitions. Second operand 10 states. [2019-11-23 22:32:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:39,643 INFO L93 Difference]: Finished difference Result 5506 states and 7859 transitions. [2019-11-23 22:32:39,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 22:32:39,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-11-23 22:32:39,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:39,665 INFO L225 Difference]: With dead ends: 5506 [2019-11-23 22:32:39,665 INFO L226 Difference]: Without dead ends: 5086 [2019-11-23 22:32:39,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2019-11-23 22:32:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5086 states. [2019-11-23 22:32:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5086 to 1243. [2019-11-23 22:32:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2019-11-23 22:32:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1769 transitions. [2019-11-23 22:32:39,808 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1769 transitions. Word has length 54 [2019-11-23 22:32:39,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:39,808 INFO L462 AbstractCegarLoop]: Abstraction has 1243 states and 1769 transitions. [2019-11-23 22:32:39,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:32:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1769 transitions. [2019-11-23 22:32:39,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:32:39,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:39,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:39,810 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:39,811 INFO L82 PathProgramCache]: Analyzing trace with hash 450530120, now seen corresponding path program 1 times [2019-11-23 22:32:39,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:39,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501433545] [2019-11-23 22:32:39,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:39,889 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:32:39,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501433545] [2019-11-23 22:32:39,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:39,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:32:39,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959419658] [2019-11-23 22:32:39,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:32:39,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:39,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:32:39,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:32:39,892 INFO L87 Difference]: Start difference. First operand 1243 states and 1769 transitions. Second operand 8 states. [2019-11-23 22:32:41,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:41,736 INFO L93 Difference]: Finished difference Result 7690 states and 11129 transitions. [2019-11-23 22:32:41,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 22:32:41,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-11-23 22:32:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:41,761 INFO L225 Difference]: With dead ends: 7690 [2019-11-23 22:32:41,762 INFO L226 Difference]: Without dead ends: 6652 [2019-11-23 22:32:41,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2019-11-23 22:32:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6652 states. [2019-11-23 22:32:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6652 to 5069. [2019-11-23 22:32:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5069 states. [2019-11-23 22:32:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 7334 transitions. [2019-11-23 22:32:42,413 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 7334 transitions. Word has length 54 [2019-11-23 22:32:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:42,414 INFO L462 AbstractCegarLoop]: Abstraction has 5069 states and 7334 transitions. [2019-11-23 22:32:42,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:32:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 7334 transitions. [2019-11-23 22:32:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:32:42,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:42,417 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] [2019-11-23 22:32:42,417 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:42,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:42,417 INFO L82 PathProgramCache]: Analyzing trace with hash -980977886, now seen corresponding path program 1 times [2019-11-23 22:32:42,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:42,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41503003] [2019-11-23 22:32:42,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:42,537 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:32:42,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41503003] [2019-11-23 22:32:42,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:42,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:32:42,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933237282] [2019-11-23 22:32:42,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:32:42,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:42,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:32:42,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:32:42,541 INFO L87 Difference]: Start difference. First operand 5069 states and 7334 transitions. Second operand 7 states. [2019-11-23 22:32:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:44,780 INFO L93 Difference]: Finished difference Result 20874 states and 30365 transitions. [2019-11-23 22:32:44,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:32:44,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-23 22:32:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:44,831 INFO L225 Difference]: With dead ends: 20874 [2019-11-23 22:32:44,831 INFO L226 Difference]: Without dead ends: 19106 [2019-11-23 22:32:44,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:32:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19106 states. [2019-11-23 22:32:45,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19106 to 5081. [2019-11-23 22:32:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5081 states. [2019-11-23 22:32:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5081 states to 5081 states and 7350 transitions. [2019-11-23 22:32:45,414 INFO L78 Accepts]: Start accepts. Automaton has 5081 states and 7350 transitions. Word has length 54 [2019-11-23 22:32:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:45,414 INFO L462 AbstractCegarLoop]: Abstraction has 5081 states and 7350 transitions. [2019-11-23 22:32:45,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:32:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 7350 transitions. [2019-11-23 22:32:45,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:32:45,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:45,418 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] [2019-11-23 22:32:45,418 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:45,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:45,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2121579715, now seen corresponding path program 1 times [2019-11-23 22:32:45,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:45,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751454996] [2019-11-23 22:32:45,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:45,488 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:32:45,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751454996] [2019-11-23 22:32:45,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:45,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:32:45,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263774749] [2019-11-23 22:32:45,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:32:45,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:45,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:32:45,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:32:45,490 INFO L87 Difference]: Start difference. First operand 5081 states and 7350 transitions. Second operand 7 states. [2019-11-23 22:32:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:48,122 INFO L93 Difference]: Finished difference Result 21894 states and 31613 transitions. [2019-11-23 22:32:48,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:32:48,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-23 22:32:48,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:48,155 INFO L225 Difference]: With dead ends: 21894 [2019-11-23 22:32:48,155 INFO L226 Difference]: Without dead ends: 20040 [2019-11-23 22:32:48,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:32:48,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20040 states. [2019-11-23 22:32:49,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20040 to 5083. [2019-11-23 22:32:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5083 states. [2019-11-23 22:32:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5083 states to 5083 states and 7352 transitions. [2019-11-23 22:32:49,170 INFO L78 Accepts]: Start accepts. Automaton has 5083 states and 7352 transitions. Word has length 54 [2019-11-23 22:32:49,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:49,170 INFO L462 AbstractCegarLoop]: Abstraction has 5083 states and 7352 transitions. [2019-11-23 22:32:49,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:32:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 5083 states and 7352 transitions. [2019-11-23 22:32:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:32:49,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:49,174 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] [2019-11-23 22:32:49,174 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:49,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:49,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1977718599, now seen corresponding path program 1 times [2019-11-23 22:32:49,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:49,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50777779] [2019-11-23 22:32:49,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:49,260 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:32:49,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50777779] [2019-11-23 22:32:49,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:49,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:32:49,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445063811] [2019-11-23 22:32:49,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:32:49,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:49,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:32:49,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:32:49,263 INFO L87 Difference]: Start difference. First operand 5083 states and 7352 transitions. Second operand 7 states. [2019-11-23 22:32:51,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:51,696 INFO L93 Difference]: Finished difference Result 19013 states and 27434 transitions. [2019-11-23 22:32:51,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:32:51,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-11-23 22:32:51,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:51,717 INFO L225 Difference]: With dead ends: 19013 [2019-11-23 22:32:51,717 INFO L226 Difference]: Without dead ends: 16721 [2019-11-23 22:32:51,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:32:51,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16721 states. [2019-11-23 22:32:52,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16721 to 5051. [2019-11-23 22:32:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5051 states. [2019-11-23 22:32:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5051 states to 5051 states and 7307 transitions. [2019-11-23 22:32:52,950 INFO L78 Accepts]: Start accepts. Automaton has 5051 states and 7307 transitions. Word has length 55 [2019-11-23 22:32:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:52,950 INFO L462 AbstractCegarLoop]: Abstraction has 5051 states and 7307 transitions. [2019-11-23 22:32:52,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:32:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 5051 states and 7307 transitions. [2019-11-23 22:32:52,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:32:52,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:52,953 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] [2019-11-23 22:32:52,954 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:52,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:52,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1942877955, now seen corresponding path program 1 times [2019-11-23 22:32:52,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:52,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328338831] [2019-11-23 22:32:52,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:32:53,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328338831] [2019-11-23 22:32:53,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:53,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:32:53,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126818968] [2019-11-23 22:32:53,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:32:53,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:53,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:32:53,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:32:53,074 INFO L87 Difference]: Start difference. First operand 5051 states and 7307 transitions. Second operand 9 states. [2019-11-23 22:32:58,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:58,342 INFO L93 Difference]: Finished difference Result 33474 states and 48479 transitions. [2019-11-23 22:32:58,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 22:32:58,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-23 22:32:58,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:58,379 INFO L225 Difference]: With dead ends: 33474 [2019-11-23 22:32:58,379 INFO L226 Difference]: Without dead ends: 29010 [2019-11-23 22:32:58,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:32:58,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29010 states. [2019-11-23 22:32:59,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29010 to 10807. [2019-11-23 22:32:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10807 states. [2019-11-23 22:32:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10807 states to 10807 states and 15754 transitions. [2019-11-23 22:32:59,939 INFO L78 Accepts]: Start accepts. Automaton has 10807 states and 15754 transitions. Word has length 55 [2019-11-23 22:32:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:59,940 INFO L462 AbstractCegarLoop]: Abstraction has 10807 states and 15754 transitions. [2019-11-23 22:32:59,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:32:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 10807 states and 15754 transitions. [2019-11-23 22:32:59,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:32:59,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:59,944 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] [2019-11-23 22:32:59,944 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:59,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:59,945 INFO L82 PathProgramCache]: Analyzing trace with hash 274126831, now seen corresponding path program 1 times [2019-11-23 22:32:59,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:59,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124245994] [2019-11-23 22:32:59,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:00,047 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:33:00,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124245994] [2019-11-23 22:33:00,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:00,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:33:00,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538502750] [2019-11-23 22:33:00,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:33:00,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:00,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:33:00,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:33:00,050 INFO L87 Difference]: Start difference. First operand 10807 states and 15754 transitions. Second operand 9 states. [2019-11-23 22:33:07,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:07,235 INFO L93 Difference]: Finished difference Result 46626 states and 67765 transitions. [2019-11-23 22:33:07,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 22:33:07,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-23 22:33:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:07,271 INFO L225 Difference]: With dead ends: 46626 [2019-11-23 22:33:07,272 INFO L226 Difference]: Without dead ends: 40229 [2019-11-23 22:33:07,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:33:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40229 states. [2019-11-23 22:33:10,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40229 to 21288. [2019-11-23 22:33:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21288 states. [2019-11-23 22:33:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21288 states to 21288 states and 31251 transitions. [2019-11-23 22:33:10,221 INFO L78 Accepts]: Start accepts. Automaton has 21288 states and 31251 transitions. Word has length 55 [2019-11-23 22:33:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:10,222 INFO L462 AbstractCegarLoop]: Abstraction has 21288 states and 31251 transitions. [2019-11-23 22:33:10,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:33:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 21288 states and 31251 transitions. [2019-11-23 22:33:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:33:10,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:10,225 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] [2019-11-23 22:33:10,226 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:10,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:10,226 INFO L82 PathProgramCache]: Analyzing trace with hash -622941420, now seen corresponding path program 1 times [2019-11-23 22:33:10,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:10,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246229060] [2019-11-23 22:33:10,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:10,267 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:33:10,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246229060] [2019-11-23 22:33:10,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:10,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:33:10,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977759559] [2019-11-23 22:33:10,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:33:10,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:10,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:33:10,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:10,273 INFO L87 Difference]: Start difference. First operand 21288 states and 31251 transitions. Second operand 5 states. [2019-11-23 22:33:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:12,417 INFO L93 Difference]: Finished difference Result 32850 states and 48254 transitions. [2019-11-23 22:33:12,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:12,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-11-23 22:33:12,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:12,430 INFO L225 Difference]: With dead ends: 32850 [2019-11-23 22:33:12,430 INFO L226 Difference]: Without dead ends: 13328 [2019-11-23 22:33:12,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:33:12,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13328 states. [2019-11-23 22:33:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13328 to 5296. [2019-11-23 22:33:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5296 states. [2019-11-23 22:33:13,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 7627 transitions. [2019-11-23 22:33:13,203 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 7627 transitions. Word has length 55 [2019-11-23 22:33:13,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:13,203 INFO L462 AbstractCegarLoop]: Abstraction has 5296 states and 7627 transitions. [2019-11-23 22:33:13,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:33:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 7627 transitions. [2019-11-23 22:33:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:33:13,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:13,205 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] [2019-11-23 22:33:13,206 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:13,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:13,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1135963501, now seen corresponding path program 1 times [2019-11-23 22:33:13,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:13,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862475155] [2019-11-23 22:33:13,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:33:13,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862475155] [2019-11-23 22:33:13,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:13,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:33:13,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664807427] [2019-11-23 22:33:13,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:33:13,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:13,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:33:13,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:13,251 INFO L87 Difference]: Start difference. First operand 5296 states and 7627 transitions. Second operand 5 states. [2019-11-23 22:33:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:14,502 INFO L93 Difference]: Finished difference Result 11545 states and 16655 transitions. [2019-11-23 22:33:14,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:14,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-11-23 22:33:14,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:14,509 INFO L225 Difference]: With dead ends: 11545 [2019-11-23 22:33:14,509 INFO L226 Difference]: Without dead ends: 7052 [2019-11-23 22:33:14,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:33:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7052 states. [2019-11-23 22:33:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7052 to 2816. [2019-11-23 22:33:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2816 states. [2019-11-23 22:33:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 3994 transitions. [2019-11-23 22:33:14,995 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 3994 transitions. Word has length 55 [2019-11-23 22:33:14,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:14,995 INFO L462 AbstractCegarLoop]: Abstraction has 2816 states and 3994 transitions. [2019-11-23 22:33:14,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:33:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 3994 transitions. [2019-11-23 22:33:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:33:14,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:14,996 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:14,997 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:14,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:14,997 INFO L82 PathProgramCache]: Analyzing trace with hash -49675572, now seen corresponding path program 1 times [2019-11-23 22:33:14,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:14,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498916853] [2019-11-23 22:33:14,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:15,052 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:33:15,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498916853] [2019-11-23 22:33:15,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:15,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:33:15,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726296672] [2019-11-23 22:33:15,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:33:15,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:15,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:33:15,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:33:15,054 INFO L87 Difference]: Start difference. First operand 2816 states and 3994 transitions. Second operand 6 states. [2019-11-23 22:33:16,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:16,201 INFO L93 Difference]: Finished difference Result 8075 states and 11470 transitions. [2019-11-23 22:33:16,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:16,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-23 22:33:16,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:16,206 INFO L225 Difference]: With dead ends: 8075 [2019-11-23 22:33:16,207 INFO L226 Difference]: Without dead ends: 5372 [2019-11-23 22:33:16,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 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:33:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5372 states. [2019-11-23 22:33:16,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5372 to 3253. [2019-11-23 22:33:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3253 states. [2019-11-23 22:33:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3253 states to 3253 states and 4592 transitions. [2019-11-23 22:33:16,876 INFO L78 Accepts]: Start accepts. Automaton has 3253 states and 4592 transitions. Word has length 56 [2019-11-23 22:33:16,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:16,876 INFO L462 AbstractCegarLoop]: Abstraction has 3253 states and 4592 transitions. [2019-11-23 22:33:16,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:33:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3253 states and 4592 transitions. [2019-11-23 22:33:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:33:16,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:16,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:16,878 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:16,878 INFO L82 PathProgramCache]: Analyzing trace with hash -849343089, now seen corresponding path program 1 times [2019-11-23 22:33:16,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:16,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41977385] [2019-11-23 22:33:16,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:16,937 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:33:16,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41977385] [2019-11-23 22:33:16,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:16,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:33:16,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051980647] [2019-11-23 22:33:16,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:33:16,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:16,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:33:16,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:16,939 INFO L87 Difference]: Start difference. First operand 3253 states and 4592 transitions. Second operand 5 states. [2019-11-23 22:33:18,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:18,595 INFO L93 Difference]: Finished difference Result 10553 states and 15093 transitions. [2019-11-23 22:33:18,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:18,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-11-23 22:33:18,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:18,603 INFO L225 Difference]: With dead ends: 10553 [2019-11-23 22:33:18,603 INFO L226 Difference]: Without dead ends: 8301 [2019-11-23 22:33:18,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:33:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8301 states. [2019-11-23 22:33:19,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8301 to 3721. [2019-11-23 22:33:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3721 states. [2019-11-23 22:33:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5272 transitions. [2019-11-23 22:33:19,273 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5272 transitions. Word has length 56 [2019-11-23 22:33:19,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:19,273 INFO L462 AbstractCegarLoop]: Abstraction has 3721 states and 5272 transitions. [2019-11-23 22:33:19,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:33:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5272 transitions. [2019-11-23 22:33:19,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:33:19,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:19,274 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] [2019-11-23 22:33:19,275 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:19,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:19,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1081682588, now seen corresponding path program 1 times [2019-11-23 22:33:19,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:19,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619564434] [2019-11-23 22:33:19,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:33:19,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619564434] [2019-11-23 22:33:19,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:19,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:33:19,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246327472] [2019-11-23 22:33:19,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:33:19,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:19,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:33:19,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:19,337 INFO L87 Difference]: Start difference. First operand 3721 states and 5272 transitions. Second operand 5 states. [2019-11-23 22:33:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:21,129 INFO L93 Difference]: Finished difference Result 11101 states and 15885 transitions. [2019-11-23 22:33:21,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:21,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-23 22:33:21,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:21,137 INFO L225 Difference]: With dead ends: 11101 [2019-11-23 22:33:21,138 INFO L226 Difference]: Without dead ends: 8849 [2019-11-23 22:33:21,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8849 states. [2019-11-23 22:33:21,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8849 to 4374. [2019-11-23 22:33:21,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4374 states. [2019-11-23 22:33:21,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4374 states to 4374 states and 6222 transitions. [2019-11-23 22:33:21,976 INFO L78 Accepts]: Start accepts. Automaton has 4374 states and 6222 transitions. Word has length 57 [2019-11-23 22:33:21,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:21,976 INFO L462 AbstractCegarLoop]: Abstraction has 4374 states and 6222 transitions. [2019-11-23 22:33:21,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:33:21,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4374 states and 6222 transitions. [2019-11-23 22:33:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:33:21,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:21,978 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] [2019-11-23 22:33:21,978 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:21,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:21,978 INFO L82 PathProgramCache]: Analyzing trace with hash 617518117, now seen corresponding path program 1 times [2019-11-23 22:33:21,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:21,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752038185] [2019-11-23 22:33:21,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:22,046 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:33:22,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752038185] [2019-11-23 22:33:22,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:22,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:33:22,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717542985] [2019-11-23 22:33:22,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:33:22,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:22,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:33:22,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:33:22,049 INFO L87 Difference]: Start difference. First operand 4374 states and 6222 transitions. Second operand 5 states. [2019-11-23 22:33:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:24,256 INFO L93 Difference]: Finished difference Result 12012 states and 17171 transitions. [2019-11-23 22:33:24,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:33:24,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-23 22:33:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:24,269 INFO L225 Difference]: With dead ends: 12012 [2019-11-23 22:33:24,269 INFO L226 Difference]: Without dead ends: 9760 [2019-11-23 22:33:24,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:33:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9760 states. [2019-11-23 22:33:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9760 to 5757. [2019-11-23 22:33:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-11-23 22:33:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 8240 transitions. [2019-11-23 22:33:26,529 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 8240 transitions. Word has length 57 [2019-11-23 22:33:26,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:26,529 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 8240 transitions. [2019-11-23 22:33:26,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:33:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 8240 transitions. [2019-11-23 22:33:26,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 22:33:26,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:26,531 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:26,532 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:26,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:26,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1556118219, now seen corresponding path program 1 times [2019-11-23 22:33:26,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:26,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753621167] [2019-11-23 22:33:26,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:26,751 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:33:26,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753621167] [2019-11-23 22:33:26,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:26,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:33:26,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86445195] [2019-11-23 22:33:26,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:33:26,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:26,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:33:26,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:33:26,753 INFO L87 Difference]: Start difference. First operand 5757 states and 8240 transitions. Second operand 10 states. [2019-11-23 22:33:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:32,120 INFO L93 Difference]: Finished difference Result 19785 states and 28228 transitions. [2019-11-23 22:33:32,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 22:33:32,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-11-23 22:33:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:32,133 INFO L225 Difference]: With dead ends: 19785 [2019-11-23 22:33:32,133 INFO L226 Difference]: Without dead ends: 15012 [2019-11-23 22:33:32,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-11-23 22:33:32,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15012 states. [2019-11-23 22:33:33,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15012 to 5757. [2019-11-23 22:33:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-11-23 22:33:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 8234 transitions. [2019-11-23 22:33:33,479 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 8234 transitions. Word has length 62 [2019-11-23 22:33:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:33,479 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 8234 transitions. [2019-11-23 22:33:33,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:33:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 8234 transitions. [2019-11-23 22:33:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 22:33:33,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:33,481 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:33,481 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:33,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:33,481 INFO L82 PathProgramCache]: Analyzing trace with hash -443125389, now seen corresponding path program 1 times [2019-11-23 22:33:33,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:33,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803477530] [2019-11-23 22:33:33,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:33,645 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:33:33,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803477530] [2019-11-23 22:33:33,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:33,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:33:33,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255740372] [2019-11-23 22:33:33,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:33:33,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:33,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:33:33,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:33:33,647 INFO L87 Difference]: Start difference. First operand 5757 states and 8234 transitions. Second operand 10 states. [2019-11-23 22:33:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:38,844 INFO L93 Difference]: Finished difference Result 19414 states and 27755 transitions. [2019-11-23 22:33:38,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:33:38,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-11-23 22:33:38,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:38,861 INFO L225 Difference]: With dead ends: 19414 [2019-11-23 22:33:38,861 INFO L226 Difference]: Without dead ends: 14694 [2019-11-23 22:33:38,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-11-23 22:33:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14694 states. [2019-11-23 22:33:40,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14694 to 5649. [2019-11-23 22:33:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5649 states. [2019-11-23 22:33:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5649 states to 5649 states and 8066 transitions. [2019-11-23 22:33:40,338 INFO L78 Accepts]: Start accepts. Automaton has 5649 states and 8066 transitions. Word has length 62 [2019-11-23 22:33:40,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:40,338 INFO L462 AbstractCegarLoop]: Abstraction has 5649 states and 8066 transitions. [2019-11-23 22:33:40,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:33:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 5649 states and 8066 transitions. [2019-11-23 22:33:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 22:33:40,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:40,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:40,340 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:40,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:40,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1162737396, now seen corresponding path program 1 times [2019-11-23 22:33:40,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:40,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167453247] [2019-11-23 22:33:40,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:40,574 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:33:40,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167453247] [2019-11-23 22:33:40,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:40,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:33:40,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200354063] [2019-11-23 22:33:40,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:33:40,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:40,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:33:40,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:33:40,578 INFO L87 Difference]: Start difference. First operand 5649 states and 8066 transitions. Second operand 10 states. [2019-11-23 22:33:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:45,141 INFO L93 Difference]: Finished difference Result 16769 states and 23872 transitions. [2019-11-23 22:33:45,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 22:33:45,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-11-23 22:33:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:45,153 INFO L225 Difference]: With dead ends: 16769 [2019-11-23 22:33:45,153 INFO L226 Difference]: Without dead ends: 11902 [2019-11-23 22:33:45,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2019-11-23 22:33:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11902 states. [2019-11-23 22:33:46,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11902 to 5427. [2019-11-23 22:33:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5427 states. [2019-11-23 22:33:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5427 states to 5427 states and 7737 transitions. [2019-11-23 22:33:46,546 INFO L78 Accepts]: Start accepts. Automaton has 5427 states and 7737 transitions. Word has length 62 [2019-11-23 22:33:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:46,546 INFO L462 AbstractCegarLoop]: Abstraction has 5427 states and 7737 transitions. [2019-11-23 22:33:46,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:33:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 5427 states and 7737 transitions. [2019-11-23 22:33:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 22:33:46,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:46,547 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:46,548 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1143949417, now seen corresponding path program 1 times [2019-11-23 22:33:46,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:46,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769085402] [2019-11-23 22:33:46,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:33:46,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769085402] [2019-11-23 22:33:46,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:46,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:33:46,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261264667] [2019-11-23 22:33:46,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:33:46,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:46,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:33:46,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:46,593 INFO L87 Difference]: Start difference. First operand 5427 states and 7737 transitions. Second operand 3 states. [2019-11-23 22:33:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:48,452 INFO L93 Difference]: Finished difference Result 8071 states and 11531 transitions. [2019-11-23 22:33:48,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:33:48,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-23 22:33:48,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:48,457 INFO L225 Difference]: With dead ends: 8071 [2019-11-23 22:33:48,457 INFO L226 Difference]: Without dead ends: 5408 [2019-11-23 22:33:48,459 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:33:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5408 states. [2019-11-23 22:33:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5408 to 5406. [2019-11-23 22:33:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5406 states. [2019-11-23 22:33:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5406 states to 5406 states and 7620 transitions. [2019-11-23 22:33:49,806 INFO L78 Accepts]: Start accepts. Automaton has 5406 states and 7620 transitions. Word has length 63 [2019-11-23 22:33:49,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:49,806 INFO L462 AbstractCegarLoop]: Abstraction has 5406 states and 7620 transitions. [2019-11-23 22:33:49,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:33:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 5406 states and 7620 transitions. [2019-11-23 22:33:49,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 22:33:49,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:49,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:49,807 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:49,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:49,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1363691260, now seen corresponding path program 1 times [2019-11-23 22:33:49,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:49,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812814935] [2019-11-23 22:33:49,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:49,847 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:33:49,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812814935] [2019-11-23 22:33:49,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:49,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:33:49,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377011217] [2019-11-23 22:33:49,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:33:49,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:49,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:33:49,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:49,849 INFO L87 Difference]: Start difference. First operand 5406 states and 7620 transitions. Second operand 3 states. [2019-11-23 22:33:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:51,678 INFO L93 Difference]: Finished difference Result 7223 states and 10177 transitions. [2019-11-23 22:33:51,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:33:51,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-23 22:33:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:51,682 INFO L225 Difference]: With dead ends: 7223 [2019-11-23 22:33:51,682 INFO L226 Difference]: Without dead ends: 4584 [2019-11-23 22:33:51,684 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:33:51,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2019-11-23 22:33:52,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 4582. [2019-11-23 22:33:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4582 states. [2019-11-23 22:33:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 6344 transitions. [2019-11-23 22:33:52,806 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 6344 transitions. Word has length 63 [2019-11-23 22:33:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:52,806 INFO L462 AbstractCegarLoop]: Abstraction has 4582 states and 6344 transitions. [2019-11-23 22:33:52,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:33:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 6344 transitions. [2019-11-23 22:33:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 22:33:52,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:52,808 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:52,808 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:52,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:52,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1254313906, now seen corresponding path program 1 times [2019-11-23 22:33:52,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:52,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983802842] [2019-11-23 22:33:52,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:52,849 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:33:52,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983802842] [2019-11-23 22:33:52,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:52,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:33:52,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352543118] [2019-11-23 22:33:52,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:33:52,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:52,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:33:52,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:33:52,851 INFO L87 Difference]: Start difference. First operand 4582 states and 6344 transitions. Second operand 3 states. [2019-11-23 22:33:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:33:53,973 INFO L93 Difference]: Finished difference Result 5200 states and 7167 transitions. [2019-11-23 22:33:53,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:33:53,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-23 22:33:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:33:53,979 INFO L225 Difference]: With dead ends: 5200 [2019-11-23 22:33:53,979 INFO L226 Difference]: Without dead ends: 4219 [2019-11-23 22:33:53,980 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:33:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4219 states. [2019-11-23 22:33:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4219 to 4217. [2019-11-23 22:33:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4217 states. [2019-11-23 22:33:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4217 states to 4217 states and 5679 transitions. [2019-11-23 22:33:55,060 INFO L78 Accepts]: Start accepts. Automaton has 4217 states and 5679 transitions. Word has length 63 [2019-11-23 22:33:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:33:55,060 INFO L462 AbstractCegarLoop]: Abstraction has 4217 states and 5679 transitions. [2019-11-23 22:33:55,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:33:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 4217 states and 5679 transitions. [2019-11-23 22:33:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-23 22:33:55,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:33:55,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:33:55,063 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:33:55,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:33:55,063 INFO L82 PathProgramCache]: Analyzing trace with hash -424034558, now seen corresponding path program 1 times [2019-11-23 22:33:55,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:33:55,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267998796] [2019-11-23 22:33:55,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:33:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:33:55,729 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:33:55,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267998796] [2019-11-23 22:33:55,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:33:55,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-11-23 22:33:55,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697099506] [2019-11-23 22:33:55,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 22:33:55,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:33:55,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 22:33:55,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2019-11-23 22:33:55,731 INFO L87 Difference]: Start difference. First operand 4217 states and 5679 transitions. Second operand 23 states. [2019-11-23 22:33:55,979 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-11-23 22:33:56,817 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-11-23 22:33:57,060 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-11-23 22:33:57,506 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-11-23 22:33:57,829 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2019-11-23 22:33:58,712 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47