/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_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:31:18,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:31:18,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:31:18,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:31:18,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:31:18,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:31:18,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:31:18,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:31:18,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:31:18,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:31:18,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:31:18,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:31:18,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:31:18,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:31:18,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:31:18,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:31:18,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:31:18,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:31:18,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:31:18,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:31:18,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:31:18,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:31:18,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:31:18,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:31:18,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:31:18,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:31:18,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:31:18,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:31:18,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:31:18,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:31:18,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:31:18,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:31:18,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:31:18,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:31:18,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:31:18,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:31:18,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:31:18,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:31:18,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:31:18,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:31:18,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:31:18,609 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:31:18,630 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:31:18,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:31:18,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:31:18,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:31:18,632 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:31:18,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:31:18,633 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:31:18,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:31:18,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:31:18,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:31:18,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:31:18,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:31:18,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:31:18,635 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:31:18,635 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:31:18,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:31:18,635 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:31:18,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:31:18,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:31:18,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:31:18,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:31:18,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:31:18,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:31:18,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:31:18,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:31:18,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:31:18,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:31:18,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:31:18,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:31:18,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:31:18,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:31:18,929 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:31:18,933 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:31:18,934 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:31:18,934 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:31:18,935 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-23 22:31:19,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5d07ade7/217c025856d349c894825530f422b147/FLAGab51e4683 [2019-11-23 22:31:19,488 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:31:19,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-23 22:31:19,503 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5d07ade7/217c025856d349c894825530f422b147/FLAGab51e4683 [2019-11-23 22:31:19,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5d07ade7/217c025856d349c894825530f422b147 [2019-11-23 22:31:19,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:31:19,855 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:31:19,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:31:19,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:31:19,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:31:19,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:19" (1/1) ... [2019-11-23 22:31:19,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a5249b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:19, skipping insertion in model container [2019-11-23 22:31:19,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:19" (1/1) ... [2019-11-23 22:31:19,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:31:19,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:31:20,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:31:20,518 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:31:20,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:31:20,721 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:31:20,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:20 WrapperNode [2019-11-23 22:31:20,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:31:20,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:31:20,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:31:20,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:31:20,747 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:31:20" (1/1) ... [2019-11-23 22:31:20,767 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:31:20" (1/1) ... [2019-11-23 22:31:20,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:31:20,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:31:20,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:31:20,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:31:20,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:20" (1/1) ... [2019-11-23 22:31:20,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:20" (1/1) ... [2019-11-23 22:31:20,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:20" (1/1) ... [2019-11-23 22:31:20,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:20" (1/1) ... [2019-11-23 22:31:20,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:20" (1/1) ... [2019-11-23 22:31:20,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:20" (1/1) ... [2019-11-23 22:31:20,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:20" (1/1) ... [2019-11-23 22:31:20,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:31:20,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:31:20,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:31:20,962 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:31:20,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:20" (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:31:21,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:31:21,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:31:22,567 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:31:22,567 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:31:22,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:22 BoogieIcfgContainer [2019-11-23 22:31:22,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:31:22,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:31:22,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:31:22,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:31:22,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:31:19" (1/3) ... [2019-11-23 22:31:22,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c731a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:22, skipping insertion in model container [2019-11-23 22:31:22,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:20" (2/3) ... [2019-11-23 22:31:22,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c731a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:22, skipping insertion in model container [2019-11-23 22:31:22,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:22" (3/3) ... [2019-11-23 22:31:22,582 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-23 22:31:22,594 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:31:22,603 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:31:22,615 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:31:22,659 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:31:22,659 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:31:22,660 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:31:22,660 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:31:22,660 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:31:22,660 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:31:22,661 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:31:22,661 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:31:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2019-11-23 22:31:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-23 22:31:22,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:22,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:22,721 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:22,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:22,728 INFO L82 PathProgramCache]: Analyzing trace with hash 811765820, now seen corresponding path program 1 times [2019-11-23 22:31:22,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:22,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444290488] [2019-11-23 22:31:22,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:23,291 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:31:23,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444290488] [2019-11-23 22:31:23,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:23,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:23,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472711212] [2019-11-23 22:31:23,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:23,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:23,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:23,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:23,318 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 3 states. [2019-11-23 22:31:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:23,554 INFO L93 Difference]: Finished difference Result 634 states and 1113 transitions. [2019-11-23 22:31:23,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:23,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-11-23 22:31:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:23,574 INFO L225 Difference]: With dead ends: 634 [2019-11-23 22:31:23,575 INFO L226 Difference]: Without dead ends: 510 [2019-11-23 22:31:23,579 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:31:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-11-23 22:31:23,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2019-11-23 22:31:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-11-23 22:31:23,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 757 transitions. [2019-11-23 22:31:23,664 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 757 transitions. Word has length 146 [2019-11-23 22:31:23,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:23,665 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 757 transitions. [2019-11-23 22:31:23,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 757 transitions. [2019-11-23 22:31:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-23 22:31:23,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:23,669 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:23,670 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:23,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:23,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1665088068, now seen corresponding path program 1 times [2019-11-23 22:31:23,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:23,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897407925] [2019-11-23 22:31:23,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:23,873 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:31:23,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897407925] [2019-11-23 22:31:23,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:23,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:23,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891475493] [2019-11-23 22:31:23,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:23,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:23,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:23,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:23,877 INFO L87 Difference]: Start difference. First operand 508 states and 757 transitions. Second operand 3 states. [2019-11-23 22:31:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:24,048 INFO L93 Difference]: Finished difference Result 1104 states and 1692 transitions. [2019-11-23 22:31:24,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:24,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-11-23 22:31:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:24,059 INFO L225 Difference]: With dead ends: 1104 [2019-11-23 22:31:24,059 INFO L226 Difference]: Without dead ends: 894 [2019-11-23 22:31:24,064 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:31:24,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-11-23 22:31:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 892. [2019-11-23 22:31:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-11-23 22:31:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1341 transitions. [2019-11-23 22:31:24,115 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1341 transitions. Word has length 146 [2019-11-23 22:31:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:24,116 INFO L462 AbstractCegarLoop]: Abstraction has 892 states and 1341 transitions. [2019-11-23 22:31:24,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1341 transitions. [2019-11-23 22:31:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-23 22:31:24,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:24,120 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:24,121 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:24,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2001145712, now seen corresponding path program 1 times [2019-11-23 22:31:24,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:24,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770037619] [2019-11-23 22:31:24,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:24,500 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:31:24,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770037619] [2019-11-23 22:31:24,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:24,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:24,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231188295] [2019-11-23 22:31:24,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:24,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:24,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:24,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:24,507 INFO L87 Difference]: Start difference. First operand 892 states and 1341 transitions. Second operand 4 states. [2019-11-23 22:31:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:24,676 INFO L93 Difference]: Finished difference Result 2611 states and 3916 transitions. [2019-11-23 22:31:24,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:24,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-23 22:31:24,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:24,687 INFO L225 Difference]: With dead ends: 2611 [2019-11-23 22:31:24,687 INFO L226 Difference]: Without dead ends: 1728 [2019-11-23 22:31:24,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:24,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2019-11-23 22:31:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1726. [2019-11-23 22:31:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-11-23 22:31:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2568 transitions. [2019-11-23 22:31:24,787 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2568 transitions. Word has length 146 [2019-11-23 22:31:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:24,789 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 2568 transitions. [2019-11-23 22:31:24,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2568 transitions. [2019-11-23 22:31:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-23 22:31:24,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:24,803 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:24,804 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:24,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash -153017852, now seen corresponding path program 1 times [2019-11-23 22:31:24,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:24,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248735678] [2019-11-23 22:31:24,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:24,872 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:31:24,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248735678] [2019-11-23 22:31:24,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:24,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:24,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713866991] [2019-11-23 22:31:24,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:24,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:24,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:24,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:24,876 INFO L87 Difference]: Start difference. First operand 1726 states and 2568 transitions. Second operand 3 states. [2019-11-23 22:31:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:25,043 INFO L93 Difference]: Finished difference Result 5140 states and 7642 transitions. [2019-11-23 22:31:25,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:25,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-23 22:31:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:25,061 INFO L225 Difference]: With dead ends: 5140 [2019-11-23 22:31:25,062 INFO L226 Difference]: Without dead ends: 3442 [2019-11-23 22:31:25,064 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:31:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2019-11-23 22:31:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 1728. [2019-11-23 22:31:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1728 states. [2019-11-23 22:31:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2570 transitions. [2019-11-23 22:31:25,171 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2570 transitions. Word has length 147 [2019-11-23 22:31:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:25,172 INFO L462 AbstractCegarLoop]: Abstraction has 1728 states and 2570 transitions. [2019-11-23 22:31:25,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2570 transitions. [2019-11-23 22:31:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:31:25,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:25,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:25,176 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:25,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:25,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1214315247, now seen corresponding path program 1 times [2019-11-23 22:31:25,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:25,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44431850] [2019-11-23 22:31:25,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:25,349 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:31:25,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44431850] [2019-11-23 22:31:25,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:25,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:25,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432190289] [2019-11-23 22:31:25,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:25,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:25,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:25,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:25,352 INFO L87 Difference]: Start difference. First operand 1728 states and 2570 transitions. Second operand 4 states. [2019-11-23 22:31:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:25,454 INFO L93 Difference]: Finished difference Result 3446 states and 5126 transitions. [2019-11-23 22:31:25,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:25,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-23 22:31:25,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:25,463 INFO L225 Difference]: With dead ends: 3446 [2019-11-23 22:31:25,464 INFO L226 Difference]: Without dead ends: 1726 [2019-11-23 22:31:25,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-11-23 22:31:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1726. [2019-11-23 22:31:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-11-23 22:31:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2566 transitions. [2019-11-23 22:31:25,556 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2566 transitions. Word has length 148 [2019-11-23 22:31:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:25,557 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 2566 transitions. [2019-11-23 22:31:25,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2566 transitions. [2019-11-23 22:31:25,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:31:25,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:25,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:25,562 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:25,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:25,562 INFO L82 PathProgramCache]: Analyzing trace with hash 4826205, now seen corresponding path program 1 times [2019-11-23 22:31:25,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:25,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320274384] [2019-11-23 22:31:25,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:25,707 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:31:25,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320274384] [2019-11-23 22:31:25,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:25,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:25,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134532247] [2019-11-23 22:31:25,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:25,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:25,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:25,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:25,711 INFO L87 Difference]: Start difference. First operand 1726 states and 2566 transitions. Second operand 3 states. [2019-11-23 22:31:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:25,852 INFO L93 Difference]: Finished difference Result 4114 states and 6127 transitions. [2019-11-23 22:31:25,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:25,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-23 22:31:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:25,865 INFO L225 Difference]: With dead ends: 4114 [2019-11-23 22:31:25,865 INFO L226 Difference]: Without dead ends: 2562 [2019-11-23 22:31:25,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2019-11-23 22:31:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2560. [2019-11-23 22:31:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2560 states. [2019-11-23 22:31:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3755 transitions. [2019-11-23 22:31:25,995 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3755 transitions. Word has length 148 [2019-11-23 22:31:25,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:25,996 INFO L462 AbstractCegarLoop]: Abstraction has 2560 states and 3755 transitions. [2019-11-23 22:31:25,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3755 transitions. [2019-11-23 22:31:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 22:31:26,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:26,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:26,002 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:26,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:26,002 INFO L82 PathProgramCache]: Analyzing trace with hash -787859424, now seen corresponding path program 1 times [2019-11-23 22:31:26,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:26,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521902397] [2019-11-23 22:31:26,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:26,120 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:31:26,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521902397] [2019-11-23 22:31:26,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:26,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:26,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985229883] [2019-11-23 22:31:26,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:26,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:26,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:26,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:26,129 INFO L87 Difference]: Start difference. First operand 2560 states and 3755 transitions. Second operand 3 states. [2019-11-23 22:31:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:26,575 INFO L93 Difference]: Finished difference Result 6884 states and 10198 transitions. [2019-11-23 22:31:26,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:26,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-23 22:31:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:26,600 INFO L225 Difference]: With dead ends: 6884 [2019-11-23 22:31:26,600 INFO L226 Difference]: Without dead ends: 4746 [2019-11-23 22:31:26,604 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:31:26,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4746 states. [2019-11-23 22:31:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4746 to 4744. [2019-11-23 22:31:26,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4744 states. [2019-11-23 22:31:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4744 states to 4744 states and 6961 transitions. [2019-11-23 22:31:26,800 INFO L78 Accepts]: Start accepts. Automaton has 4744 states and 6961 transitions. Word has length 154 [2019-11-23 22:31:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:26,800 INFO L462 AbstractCegarLoop]: Abstraction has 4744 states and 6961 transitions. [2019-11-23 22:31:26,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4744 states and 6961 transitions. [2019-11-23 22:31:26,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 22:31:26,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:26,807 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:26,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:26,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1425125307, now seen corresponding path program 1 times [2019-11-23 22:31:26,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:26,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921770990] [2019-11-23 22:31:26,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:27,039 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:31:27,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921770990] [2019-11-23 22:31:27,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:27,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:31:27,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338345975] [2019-11-23 22:31:27,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:31:27,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:27,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:31:27,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:27,043 INFO L87 Difference]: Start difference. First operand 4744 states and 6961 transitions. Second operand 5 states. [2019-11-23 22:31:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:27,671 INFO L93 Difference]: Finished difference Result 10440 states and 16349 transitions. [2019-11-23 22:31:27,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:31:27,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-11-23 22:31:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:27,713 INFO L225 Difference]: With dead ends: 10440 [2019-11-23 22:31:27,713 INFO L226 Difference]: Without dead ends: 8564 [2019-11-23 22:31:27,720 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:31:27,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8564 states. [2019-11-23 22:31:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8564 to 6690. [2019-11-23 22:31:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6690 states. [2019-11-23 22:31:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6690 states to 6690 states and 10153 transitions. [2019-11-23 22:31:28,199 INFO L78 Accepts]: Start accepts. Automaton has 6690 states and 10153 transitions. Word has length 154 [2019-11-23 22:31:28,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:28,200 INFO L462 AbstractCegarLoop]: Abstraction has 6690 states and 10153 transitions. [2019-11-23 22:31:28,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:31:28,200 INFO L276 IsEmpty]: Start isEmpty. Operand 6690 states and 10153 transitions. [2019-11-23 22:31:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 22:31:28,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:28,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:28,207 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:28,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:28,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1259469147, now seen corresponding path program 1 times [2019-11-23 22:31:28,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:28,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899559492] [2019-11-23 22:31:28,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:28,305 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:31:28,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899559492] [2019-11-23 22:31:28,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:28,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:28,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459575760] [2019-11-23 22:31:28,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:28,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:28,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:28,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:28,308 INFO L87 Difference]: Start difference. First operand 6690 states and 10153 transitions. Second operand 3 states. [2019-11-23 22:31:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:28,879 INFO L93 Difference]: Finished difference Result 15728 states and 24339 transitions. [2019-11-23 22:31:28,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:28,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-23 22:31:28,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:28,906 INFO L225 Difference]: With dead ends: 15728 [2019-11-23 22:31:28,906 INFO L226 Difference]: Without dead ends: 11678 [2019-11-23 22:31:28,914 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:31:28,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11678 states. [2019-11-23 22:31:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11678 to 11676. [2019-11-23 22:31:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11676 states. [2019-11-23 22:31:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11676 states to 11676 states and 17653 transitions. [2019-11-23 22:31:29,496 INFO L78 Accepts]: Start accepts. Automaton has 11676 states and 17653 transitions. Word has length 154 [2019-11-23 22:31:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:29,496 INFO L462 AbstractCegarLoop]: Abstraction has 11676 states and 17653 transitions. [2019-11-23 22:31:29,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 11676 states and 17653 transitions. [2019-11-23 22:31:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 22:31:29,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:29,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:29,508 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:29,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2053858823, now seen corresponding path program 1 times [2019-11-23 22:31:29,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:29,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279988767] [2019-11-23 22:31:29,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:29,746 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:31:29,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279988767] [2019-11-23 22:31:29,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:29,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:31:29,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734912868] [2019-11-23 22:31:29,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:31:29,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:29,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:31:29,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:31:29,749 INFO L87 Difference]: Start difference. First operand 11676 states and 17653 transitions. Second operand 8 states. [2019-11-23 22:31:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:30,455 INFO L93 Difference]: Finished difference Result 15944 states and 24579 transitions. [2019-11-23 22:31:30,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:30,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 154 [2019-11-23 22:31:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:30,479 INFO L225 Difference]: With dead ends: 15944 [2019-11-23 22:31:30,479 INFO L226 Difference]: Without dead ends: 11678 [2019-11-23 22:31:30,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:31:30,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11678 states. [2019-11-23 22:31:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11678 to 11676. [2019-11-23 22:31:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11676 states. [2019-11-23 22:31:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11676 states to 11676 states and 17569 transitions. [2019-11-23 22:31:31,077 INFO L78 Accepts]: Start accepts. Automaton has 11676 states and 17569 transitions. Word has length 154 [2019-11-23 22:31:31,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:31,077 INFO L462 AbstractCegarLoop]: Abstraction has 11676 states and 17569 transitions. [2019-11-23 22:31:31,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:31:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 11676 states and 17569 transitions. [2019-11-23 22:31:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 22:31:31,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:31,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:31,089 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:31,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:31,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1514103785, now seen corresponding path program 1 times [2019-11-23 22:31:31,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:31,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022870211] [2019-11-23 22:31:31,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:31,396 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:31:31,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022870211] [2019-11-23 22:31:31,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:31,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:31,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552388694] [2019-11-23 22:31:31,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:31,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:31,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:31,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:31,398 INFO L87 Difference]: Start difference. First operand 11676 states and 17569 transitions. Second operand 4 states. [2019-11-23 22:31:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:32,056 INFO L93 Difference]: Finished difference Result 30613 states and 46044 transitions. [2019-11-23 22:31:32,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:32,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-23 22:31:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:32,099 INFO L225 Difference]: With dead ends: 30613 [2019-11-23 22:31:32,099 INFO L226 Difference]: Without dead ends: 18956 [2019-11-23 22:31:32,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:32,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18956 states. [2019-11-23 22:31:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18956 to 18954. [2019-11-23 22:31:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18954 states. [2019-11-23 22:31:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18954 states to 18954 states and 28217 transitions. [2019-11-23 22:31:33,423 INFO L78 Accepts]: Start accepts. Automaton has 18954 states and 28217 transitions. Word has length 154 [2019-11-23 22:31:33,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:33,423 INFO L462 AbstractCegarLoop]: Abstraction has 18954 states and 28217 transitions. [2019-11-23 22:31:33,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:33,423 INFO L276 IsEmpty]: Start isEmpty. Operand 18954 states and 28217 transitions. [2019-11-23 22:31:33,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 22:31:33,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:33,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:33,445 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:33,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:33,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1640255621, now seen corresponding path program 1 times [2019-11-23 22:31:33,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:33,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607316520] [2019-11-23 22:31:33,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:33,583 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:31:33,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607316520] [2019-11-23 22:31:33,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:33,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:33,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608343955] [2019-11-23 22:31:33,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:33,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:33,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:33,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:33,586 INFO L87 Difference]: Start difference. First operand 18954 states and 28217 transitions. Second operand 4 states. [2019-11-23 22:31:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:34,111 INFO L93 Difference]: Finished difference Result 33979 states and 50597 transitions. [2019-11-23 22:31:34,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:34,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-23 22:31:34,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:34,146 INFO L225 Difference]: With dead ends: 33979 [2019-11-23 22:31:34,146 INFO L226 Difference]: Without dead ends: 18954 [2019-11-23 22:31:34,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18954 states. [2019-11-23 22:31:34,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18954 to 18954. [2019-11-23 22:31:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18954 states. [2019-11-23 22:31:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18954 states to 18954 states and 28216 transitions. [2019-11-23 22:31:34,900 INFO L78 Accepts]: Start accepts. Automaton has 18954 states and 28216 transitions. Word has length 156 [2019-11-23 22:31:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:34,901 INFO L462 AbstractCegarLoop]: Abstraction has 18954 states and 28216 transitions. [2019-11-23 22:31:34,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:34,901 INFO L276 IsEmpty]: Start isEmpty. Operand 18954 states and 28216 transitions. [2019-11-23 22:31:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 22:31:34,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:34,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:34,915 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash 877523112, now seen corresponding path program 1 times [2019-11-23 22:31:34,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:34,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226294] [2019-11-23 22:31:34,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:34,983 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:31:34,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226294] [2019-11-23 22:31:34,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:34,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:34,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578641230] [2019-11-23 22:31:34,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:34,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:34,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:34,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:34,985 INFO L87 Difference]: Start difference. First operand 18954 states and 28216 transitions. Second operand 3 states. [2019-11-23 22:31:36,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:36,196 INFO L93 Difference]: Finished difference Result 48199 states and 71672 transitions. [2019-11-23 22:31:36,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:36,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-23 22:31:36,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:36,236 INFO L225 Difference]: With dead ends: 48199 [2019-11-23 22:31:36,236 INFO L226 Difference]: Without dead ends: 29735 [2019-11-23 22:31:36,263 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:31:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29735 states. [2019-11-23 22:31:37,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29735 to 29733. [2019-11-23 22:31:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29733 states. [2019-11-23 22:31:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29733 states to 29733 states and 43612 transitions. [2019-11-23 22:31:38,009 INFO L78 Accepts]: Start accepts. Automaton has 29733 states and 43612 transitions. Word has length 156 [2019-11-23 22:31:38,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:38,009 INFO L462 AbstractCegarLoop]: Abstraction has 29733 states and 43612 transitions. [2019-11-23 22:31:38,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand 29733 states and 43612 transitions. [2019-11-23 22:31:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 22:31:38,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:38,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:38,027 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:38,028 INFO L82 PathProgramCache]: Analyzing trace with hash 638733497, now seen corresponding path program 1 times [2019-11-23 22:31:38,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:38,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704320604] [2019-11-23 22:31:38,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:38,129 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:31:38,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704320604] [2019-11-23 22:31:38,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:38,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:38,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176641839] [2019-11-23 22:31:38,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:38,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:38,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:38,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:38,131 INFO L87 Difference]: Start difference. First operand 29733 states and 43612 transitions. Second operand 3 states. [2019-11-23 22:31:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:39,862 INFO L93 Difference]: Finished difference Result 54937 states and 83286 transitions. [2019-11-23 22:31:39,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:39,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-11-23 22:31:39,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:39,900 INFO L225 Difference]: With dead ends: 54937 [2019-11-23 22:31:39,900 INFO L226 Difference]: Without dead ends: 38119 [2019-11-23 22:31:39,916 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:31:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38119 states. [2019-11-23 22:31:41,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38119 to 35493. [2019-11-23 22:31:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35493 states. [2019-11-23 22:31:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35493 states to 35493 states and 52148 transitions. [2019-11-23 22:31:41,392 INFO L78 Accepts]: Start accepts. Automaton has 35493 states and 52148 transitions. Word has length 162 [2019-11-23 22:31:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:41,392 INFO L462 AbstractCegarLoop]: Abstraction has 35493 states and 52148 transitions. [2019-11-23 22:31:41,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 35493 states and 52148 transitions. [2019-11-23 22:31:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 22:31:41,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:41,407 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:41,407 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:41,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:41,407 INFO L82 PathProgramCache]: Analyzing trace with hash -732244821, now seen corresponding path program 1 times [2019-11-23 22:31:41,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:41,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274521483] [2019-11-23 22:31:41,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:41,547 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:31:41,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274521483] [2019-11-23 22:31:41,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:41,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:41,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939109498] [2019-11-23 22:31:41,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:41,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:41,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:41,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:41,549 INFO L87 Difference]: Start difference. First operand 35493 states and 52148 transitions. Second operand 4 states. [2019-11-23 22:31:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:43,649 INFO L93 Difference]: Finished difference Result 58841 states and 88742 transitions. [2019-11-23 22:31:43,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:43,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-23 22:31:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:43,687 INFO L225 Difference]: With dead ends: 58841 [2019-11-23 22:31:43,687 INFO L226 Difference]: Without dead ends: 35495 [2019-11-23 22:31:43,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35495 states. [2019-11-23 22:31:45,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35495 to 33093. [2019-11-23 22:31:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33093 states. [2019-11-23 22:31:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33093 states to 33093 states and 48124 transitions. [2019-11-23 22:31:45,126 INFO L78 Accepts]: Start accepts. Automaton has 33093 states and 48124 transitions. Word has length 162 [2019-11-23 22:31:45,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:45,127 INFO L462 AbstractCegarLoop]: Abstraction has 33093 states and 48124 transitions. [2019-11-23 22:31:45,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 33093 states and 48124 transitions. [2019-11-23 22:31:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 22:31:45,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:45,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:45,139 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:45,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:45,139 INFO L82 PathProgramCache]: Analyzing trace with hash -897900981, now seen corresponding path program 1 times [2019-11-23 22:31:45,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:45,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012995766] [2019-11-23 22:31:45,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:45,285 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:31:45,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012995766] [2019-11-23 22:31:45,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:45,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:31:45,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798230236] [2019-11-23 22:31:45,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:31:45,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:45,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:31:45,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:45,289 INFO L87 Difference]: Start difference. First operand 33093 states and 48124 transitions. Second operand 5 states. [2019-11-23 22:31:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:47,816 INFO L93 Difference]: Finished difference Result 67561 states and 102040 transitions. [2019-11-23 22:31:47,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:31:47,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2019-11-23 22:31:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:47,886 INFO L225 Difference]: With dead ends: 67561 [2019-11-23 22:31:47,886 INFO L226 Difference]: Without dead ends: 58679 [2019-11-23 22:31:47,907 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:31:47,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58679 states. [2019-11-23 22:31:50,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58679 to 35477. [2019-11-23 22:31:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35477 states. [2019-11-23 22:31:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35477 states to 35477 states and 51892 transitions. [2019-11-23 22:31:50,366 INFO L78 Accepts]: Start accepts. Automaton has 35477 states and 51892 transitions. Word has length 162 [2019-11-23 22:31:50,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:50,366 INFO L462 AbstractCegarLoop]: Abstraction has 35477 states and 51892 transitions. [2019-11-23 22:31:50,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:31:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 35477 states and 51892 transitions. [2019-11-23 22:31:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 22:31:50,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:50,376 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:50,376 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:50,376 INFO L82 PathProgramCache]: Analyzing trace with hash 618570417, now seen corresponding path program 1 times [2019-11-23 22:31:50,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:50,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711657245] [2019-11-23 22:31:50,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:50,562 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:31:50,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711657245] [2019-11-23 22:31:50,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:50,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:50,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122167910] [2019-11-23 22:31:50,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:50,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:50,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:50,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:50,565 INFO L87 Difference]: Start difference. First operand 35477 states and 51892 transitions. Second operand 4 states. [2019-11-23 22:31:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:53,647 INFO L93 Difference]: Finished difference Result 104006 states and 151815 transitions. [2019-11-23 22:31:53,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:53,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-23 22:31:53,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:53,711 INFO L225 Difference]: With dead ends: 104006 [2019-11-23 22:31:53,711 INFO L226 Difference]: Without dead ends: 68568 [2019-11-23 22:31:53,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:31:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68568 states. [2019-11-23 22:31:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68568 to 68566. [2019-11-23 22:31:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68566 states. [2019-11-23 22:31:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68566 states to 68566 states and 99053 transitions. [2019-11-23 22:31:58,062 INFO L78 Accepts]: Start accepts. Automaton has 68566 states and 99053 transitions. Word has length 162 [2019-11-23 22:31:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:58,062 INFO L462 AbstractCegarLoop]: Abstraction has 68566 states and 99053 transitions. [2019-11-23 22:31:58,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 68566 states and 99053 transitions. [2019-11-23 22:31:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:31:58,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:58,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:58,082 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:31:58,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:58,083 INFO L82 PathProgramCache]: Analyzing trace with hash -979529625, now seen corresponding path program 1 times [2019-11-23 22:31:58,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:58,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19875891] [2019-11-23 22:31:58,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:58,124 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:31:58,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19875891] [2019-11-23 22:31:58,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:58,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:58,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729588748] [2019-11-23 22:31:58,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:58,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:58,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:58,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:58,126 INFO L87 Difference]: Start difference. First operand 68566 states and 99053 transitions. Second operand 3 states. [2019-11-23 22:32:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:03,871 INFO L93 Difference]: Finished difference Result 205508 states and 296912 transitions. [2019-11-23 22:32:03,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:03,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 22:32:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:04,027 INFO L225 Difference]: With dead ends: 205508 [2019-11-23 22:32:04,027 INFO L226 Difference]: Without dead ends: 137046 [2019-11-23 22:32:04,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:04,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137046 states. [2019-11-23 22:32:09,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137046 to 68572. [2019-11-23 22:32:09,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68572 states. [2019-11-23 22:32:09,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68572 states to 68572 states and 99059 transitions. [2019-11-23 22:32:09,894 INFO L78 Accepts]: Start accepts. Automaton has 68572 states and 99059 transitions. Word has length 163 [2019-11-23 22:32:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:09,894 INFO L462 AbstractCegarLoop]: Abstraction has 68572 states and 99059 transitions. [2019-11-23 22:32:09,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 68572 states and 99059 transitions. [2019-11-23 22:32:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 22:32:09,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:09,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,917 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:09,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:09,917 INFO L82 PathProgramCache]: Analyzing trace with hash -14588430, now seen corresponding path program 1 times [2019-11-23 22:32:09,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:09,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200403324] [2019-11-23 22:32:09,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:10,061 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:10,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200403324] [2019-11-23 22:32:10,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:10,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:10,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709235512] [2019-11-23 22:32:10,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:32:10,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:10,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:32:10,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:10,064 INFO L87 Difference]: Start difference. First operand 68572 states and 99059 transitions. Second operand 4 states. [2019-11-23 22:32:13,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:13,310 INFO L93 Difference]: Finished difference Result 137038 states and 197981 transitions. [2019-11-23 22:32:13,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:13,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-23 22:32:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:13,388 INFO L225 Difference]: With dead ends: 137038 [2019-11-23 22:32:13,388 INFO L226 Difference]: Without dead ends: 68572 [2019-11-23 22:32:13,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:32:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68572 states. [2019-11-23 22:32:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68572 to 68569. [2019-11-23 22:32:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68569 states. [2019-11-23 22:32:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68569 states to 68569 states and 99052 transitions. [2019-11-23 22:32:18,766 INFO L78 Accepts]: Start accepts. Automaton has 68569 states and 99052 transitions. Word has length 164 [2019-11-23 22:32:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:18,766 INFO L462 AbstractCegarLoop]: Abstraction has 68569 states and 99052 transitions. [2019-11-23 22:32:18,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:32:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 68569 states and 99052 transitions. [2019-11-23 22:32:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 22:32:18,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:18,783 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,783 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:18,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:18,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1308215966, now seen corresponding path program 1 times [2019-11-23 22:32:18,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:18,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836490362] [2019-11-23 22:32:18,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:18,863 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:18,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836490362] [2019-11-23 22:32:18,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:18,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:32:18,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850640430] [2019-11-23 22:32:18,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:32:18,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:18,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:32:18,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:32:18,866 INFO L87 Difference]: Start difference. First operand 68569 states and 99052 transitions. Second operand 3 states. [2019-11-23 22:32:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:24,655 INFO L93 Difference]: Finished difference Result 185373 states and 266944 transitions. [2019-11-23 22:32:24,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:32:24,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-23 22:32:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:24,776 INFO L225 Difference]: With dead ends: 185373 [2019-11-23 22:32:24,777 INFO L226 Difference]: Without dead ends: 117735 [2019-11-23 22:32:24,810 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:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117735 states. [2019-11-23 22:32:33,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117735 to 117733. [2019-11-23 22:32:33,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117733 states. [2019-11-23 22:32:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117733 states to 117733 states and 167206 transitions. [2019-11-23 22:32:33,793 INFO L78 Accepts]: Start accepts. Automaton has 117733 states and 167206 transitions. Word has length 164 [2019-11-23 22:32:33,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:33,793 INFO L462 AbstractCegarLoop]: Abstraction has 117733 states and 167206 transitions. [2019-11-23 22:32:33,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:32:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 117733 states and 167206 transitions. [2019-11-23 22:32:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 22:32:33,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:33,824 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,825 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:33,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:33,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1984267393, now seen corresponding path program 1 times [2019-11-23 22:32:33,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:33,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814663112] [2019-11-23 22:32:33,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:33,942 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,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814663112] [2019-11-23 22:32:33,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:33,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:33,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221365667] [2019-11-23 22:32:33,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:32:33,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:33,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:32:33,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:33,945 INFO L87 Difference]: Start difference. First operand 117733 states and 167206 transitions. Second operand 4 states. [2019-11-23 22:32:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:39,675 INFO L93 Difference]: Finished difference Result 218605 states and 310615 transitions. [2019-11-23 22:32:39,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:39,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-23 22:32:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:39,783 INFO L225 Difference]: With dead ends: 218605 [2019-11-23 22:32:39,784 INFO L226 Difference]: Without dead ends: 101685 [2019-11-23 22:32:39,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:32:39,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101685 states.