/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:34:36,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:34:36,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:34:36,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:34:36,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:34:36,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:34:36,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:34:36,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:34:36,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:34:36,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:34:36,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:34:36,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:34:36,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:34:36,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:34:36,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:34:36,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:34:36,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:34:36,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:34:36,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:34:36,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:34:36,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:34:36,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:34:36,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:34:36,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:34:36,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:34:36,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:34:36,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:34:36,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:34:36,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:34:36,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:34:36,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:34:36,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:34:36,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:34:36,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:34:36,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:34:36,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:34:36,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:34:36,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:34:36,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:34:36,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:34:36,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:34:36,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:34:36,805 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:34:36,805 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:34:36,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:34:36,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:34:36,807 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:34:36,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:34:36,807 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:34:36,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:34:36,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:34:36,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:34:36,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:34:36,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:34:36,808 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:34:36,808 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:34:36,809 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:34:36,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:34:36,809 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:34:36,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:34:36,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:34:36,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:34:36,810 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:34:36,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:34:36,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:34:36,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:34:36,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:34:36,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:34:36,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:34:36,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:34:36,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:34:36,811 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:34:37,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:34:37,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:34:37,092 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:34:37,093 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:34:37,094 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:34:37,095 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-23 22:34:37,168 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a15e043a/d4c67361286e41dfa5337acfd9c262f0/FLAGa88b2f5d0 [2019-11-23 22:34:37,619 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:34:37,619 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-23 22:34:37,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a15e043a/d4c67361286e41dfa5337acfd9c262f0/FLAGa88b2f5d0 [2019-11-23 22:34:37,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a15e043a/d4c67361286e41dfa5337acfd9c262f0 [2019-11-23 22:34:37,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:34:37,947 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:34:37,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:34:37,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:34:37,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:34:37,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:34:37" (1/1) ... [2019-11-23 22:34:37,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@298f908c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:37, skipping insertion in model container [2019-11-23 22:34:37,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:34:37" (1/1) ... [2019-11-23 22:34:37,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:34:38,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:34:38,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:34:38,575 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:34:38,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:34:38,735 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:34:38,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:38 WrapperNode [2019-11-23 22:34:38,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:34:38,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:34:38,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:34:38,736 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:34:38,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:38" (1/1) ... [2019-11-23 22:34:38,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:38" (1/1) ... [2019-11-23 22:34:38,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:34:38,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:34:38,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:34:38,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:34:38,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:38" (1/1) ... [2019-11-23 22:34:38,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:38" (1/1) ... [2019-11-23 22:34:38,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:38" (1/1) ... [2019-11-23 22:34:38,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:38" (1/1) ... [2019-11-23 22:34:38,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:38" (1/1) ... [2019-11-23 22:34:38,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:38" (1/1) ... [2019-11-23 22:34:38,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:38" (1/1) ... [2019-11-23 22:34:38,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:34:38,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:34:38,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:34:38,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:34:38,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:34:38,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:34:38,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:34:40,274 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:34:40,274 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:34:40,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:40 BoogieIcfgContainer [2019-11-23 22:34:40,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:34:40,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:34:40,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:34:40,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:34:40,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:34:37" (1/3) ... [2019-11-23 22:34:40,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be28523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:40, skipping insertion in model container [2019-11-23 22:34:40,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:38" (2/3) ... [2019-11-23 22:34:40,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be28523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:40, skipping insertion in model container [2019-11-23 22:34:40,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:40" (3/3) ... [2019-11-23 22:34:40,287 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-23 22:34:40,297 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:34:40,304 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:34:40,316 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:34:40,354 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:34:40,355 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:34:40,355 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:34:40,355 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:34:40,357 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:34:40,357 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:34:40,357 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:34:40,357 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:34:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states. [2019-11-23 22:34:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:34:40,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:40,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:40,391 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:40,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1005429677, now seen corresponding path program 1 times [2019-11-23 22:34:40,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:40,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051191012] [2019-11-23 22:34:40,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:40,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051191012] [2019-11-23 22:34:40,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:40,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:40,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387466864] [2019-11-23 22:34:40,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:40,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:40,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:40,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:40,979 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 4 states. [2019-11-23 22:34:41,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:41,175 INFO L93 Difference]: Finished difference Result 714 states and 1248 transitions. [2019-11-23 22:34:41,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:41,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-23 22:34:41,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:41,203 INFO L225 Difference]: With dead ends: 714 [2019-11-23 22:34:41,203 INFO L226 Difference]: Without dead ends: 470 [2019-11-23 22:34:41,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:41,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-11-23 22:34:41,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2019-11-23 22:34:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-11-23 22:34:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 689 transitions. [2019-11-23 22:34:41,320 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 689 transitions. Word has length 101 [2019-11-23 22:34:41,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:41,321 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 689 transitions. [2019-11-23 22:34:41,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 689 transitions. [2019-11-23 22:34:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 22:34:41,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:41,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:41,327 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:41,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:41,328 INFO L82 PathProgramCache]: Analyzing trace with hash -769716679, now seen corresponding path program 1 times [2019-11-23 22:34:41,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:41,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409878027] [2019-11-23 22:34:41,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:41,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409878027] [2019-11-23 22:34:41,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:41,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:41,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454815210] [2019-11-23 22:34:41,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:41,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:41,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:41,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:41,472 INFO L87 Difference]: Start difference. First operand 468 states and 689 transitions. Second operand 3 states. [2019-11-23 22:34:41,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:41,558 INFO L93 Difference]: Finished difference Result 1366 states and 2005 transitions. [2019-11-23 22:34:41,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:41,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 22:34:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:41,564 INFO L225 Difference]: With dead ends: 1366 [2019-11-23 22:34:41,564 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 22:34:41,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:41,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 22:34:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 470. [2019-11-23 22:34:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-11-23 22:34:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 691 transitions. [2019-11-23 22:34:41,641 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 691 transitions. Word has length 102 [2019-11-23 22:34:41,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:41,643 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 691 transitions. [2019-11-23 22:34:41,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:41,643 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 691 transitions. [2019-11-23 22:34:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 22:34:41,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:41,653 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] [2019-11-23 22:34:41,654 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:41,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:41,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1142488916, now seen corresponding path program 1 times [2019-11-23 22:34:41,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:41,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818040627] [2019-11-23 22:34:41,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:41,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818040627] [2019-11-23 22:34:41,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:41,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:41,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053636879] [2019-11-23 22:34:41,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:41,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:41,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:41,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:41,827 INFO L87 Difference]: Start difference. First operand 470 states and 691 transitions. Second operand 3 states. [2019-11-23 22:34:41,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:41,888 INFO L93 Difference]: Finished difference Result 977 states and 1492 transitions. [2019-11-23 22:34:41,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:41,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-23 22:34:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:41,892 INFO L225 Difference]: With dead ends: 977 [2019-11-23 22:34:41,893 INFO L226 Difference]: Without dead ends: 634 [2019-11-23 22:34:41,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:41,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-11-23 22:34:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 618. [2019-11-23 22:34:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-11-23 22:34:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 935 transitions. [2019-11-23 22:34:41,927 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 935 transitions. Word has length 103 [2019-11-23 22:34:41,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:41,927 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 935 transitions. [2019-11-23 22:34:41,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 935 transitions. [2019-11-23 22:34:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 22:34:41,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:41,929 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] [2019-11-23 22:34:41,929 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:41,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:41,930 INFO L82 PathProgramCache]: Analyzing trace with hash -362955380, now seen corresponding path program 1 times [2019-11-23 22:34:41,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:41,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168535964] [2019-11-23 22:34:41,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:42,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168535964] [2019-11-23 22:34:42,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:42,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:42,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338681189] [2019-11-23 22:34:42,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:42,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:42,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:42,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:42,047 INFO L87 Difference]: Start difference. First operand 618 states and 935 transitions. Second operand 4 states. [2019-11-23 22:34:42,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:42,103 INFO L93 Difference]: Finished difference Result 1222 states and 1849 transitions. [2019-11-23 22:34:42,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:42,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-23 22:34:42,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:42,107 INFO L225 Difference]: With dead ends: 1222 [2019-11-23 22:34:42,107 INFO L226 Difference]: Without dead ends: 618 [2019-11-23 22:34:42,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:42,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-23 22:34:42,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 617. [2019-11-23 22:34:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-11-23 22:34:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 932 transitions. [2019-11-23 22:34:42,141 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 932 transitions. Word has length 103 [2019-11-23 22:34:42,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:42,141 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 932 transitions. [2019-11-23 22:34:42,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 932 transitions. [2019-11-23 22:34:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 22:34:42,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:42,143 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] [2019-11-23 22:34:42,143 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:42,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:42,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1648361287, now seen corresponding path program 1 times [2019-11-23 22:34:42,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:42,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467096102] [2019-11-23 22:34:42,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:42,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:42,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467096102] [2019-11-23 22:34:42,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:42,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:42,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105294829] [2019-11-23 22:34:42,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:42,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:42,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:42,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:42,321 INFO L87 Difference]: Start difference. First operand 617 states and 932 transitions. Second operand 4 states. [2019-11-23 22:34:42,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:42,380 INFO L93 Difference]: Finished difference Result 1225 states and 1851 transitions. [2019-11-23 22:34:42,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:42,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-23 22:34:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:42,385 INFO L225 Difference]: With dead ends: 1225 [2019-11-23 22:34:42,386 INFO L226 Difference]: Without dead ends: 615 [2019-11-23 22:34:42,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:42,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-11-23 22:34:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-11-23 22:34:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-11-23 22:34:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 928 transitions. [2019-11-23 22:34:42,421 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 928 transitions. Word has length 103 [2019-11-23 22:34:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:42,422 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 928 transitions. [2019-11-23 22:34:42,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:42,422 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 928 transitions. [2019-11-23 22:34:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 22:34:42,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:42,423 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] [2019-11-23 22:34:42,423 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:42,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:42,424 INFO L82 PathProgramCache]: Analyzing trace with hash 101799940, now seen corresponding path program 1 times [2019-11-23 22:34:42,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:42,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066831320] [2019-11-23 22:34:42,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:42,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066831320] [2019-11-23 22:34:42,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:42,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:42,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445752953] [2019-11-23 22:34:42,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:42,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:42,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:42,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:42,542 INFO L87 Difference]: Start difference. First operand 615 states and 928 transitions. Second operand 3 states. [2019-11-23 22:34:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:42,624 INFO L93 Difference]: Finished difference Result 1334 states and 2036 transitions. [2019-11-23 22:34:42,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:42,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-23 22:34:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:42,630 INFO L225 Difference]: With dead ends: 1334 [2019-11-23 22:34:42,630 INFO L226 Difference]: Without dead ends: 909 [2019-11-23 22:34:42,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:42,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-23 22:34:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 907. [2019-11-23 22:34:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-11-23 22:34:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1352 transitions. [2019-11-23 22:34:42,684 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1352 transitions. Word has length 103 [2019-11-23 22:34:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:42,685 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1352 transitions. [2019-11-23 22:34:42,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1352 transitions. [2019-11-23 22:34:42,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 22:34:42,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:42,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:42,689 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:42,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:42,690 INFO L82 PathProgramCache]: Analyzing trace with hash -2115732183, now seen corresponding path program 1 times [2019-11-23 22:34:42,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:42,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261328233] [2019-11-23 22:34:42,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:42,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261328233] [2019-11-23 22:34:42,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:42,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:42,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050633189] [2019-11-23 22:34:42,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:42,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:42,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:42,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:42,775 INFO L87 Difference]: Start difference. First operand 907 states and 1352 transitions. Second operand 3 states. [2019-11-23 22:34:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:42,866 INFO L93 Difference]: Finished difference Result 1976 states and 3062 transitions. [2019-11-23 22:34:42,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:42,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 22:34:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:42,875 INFO L225 Difference]: With dead ends: 1976 [2019-11-23 22:34:42,875 INFO L226 Difference]: Without dead ends: 1335 [2019-11-23 22:34:42,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:42,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-11-23 22:34:42,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1291. [2019-11-23 22:34:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2019-11-23 22:34:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1975 transitions. [2019-11-23 22:34:42,951 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1975 transitions. Word has length 105 [2019-11-23 22:34:42,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:42,952 INFO L462 AbstractCegarLoop]: Abstraction has 1291 states and 1975 transitions. [2019-11-23 22:34:42,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:42,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1975 transitions. [2019-11-23 22:34:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 22:34:42,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:42,954 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] [2019-11-23 22:34:42,954 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:42,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:42,954 INFO L82 PathProgramCache]: Analyzing trace with hash -602590006, now seen corresponding path program 1 times [2019-11-23 22:34:42,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:42,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434435368] [2019-11-23 22:34:42,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:43,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:34:43,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434435368] [2019-11-23 22:34:43,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:43,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:43,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298910447] [2019-11-23 22:34:43,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:34:43,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:43,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:34:43,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:43,064 INFO L87 Difference]: Start difference. First operand 1291 states and 1975 transitions. Second operand 5 states. [2019-11-23 22:34:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:43,435 INFO L93 Difference]: Finished difference Result 3370 states and 5282 transitions. [2019-11-23 22:34:43,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:34:43,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-11-23 22:34:43,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:43,452 INFO L225 Difference]: With dead ends: 3370 [2019-11-23 22:34:43,453 INFO L226 Difference]: Without dead ends: 2255 [2019-11-23 22:34:43,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:34:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2019-11-23 22:34:43,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 2253. [2019-11-23 22:34:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2019-11-23 22:34:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3503 transitions. [2019-11-23 22:34:43,666 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3503 transitions. Word has length 106 [2019-11-23 22:34:43,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:43,668 INFO L462 AbstractCegarLoop]: Abstraction has 2253 states and 3503 transitions. [2019-11-23 22:34:43,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:34:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3503 transitions. [2019-11-23 22:34:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 22:34:43,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:43,670 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] [2019-11-23 22:34:43,670 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:43,671 INFO L82 PathProgramCache]: Analyzing trace with hash -404241499, now seen corresponding path program 1 times [2019-11-23 22:34:43,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:43,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230473910] [2019-11-23 22:34:43,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:43,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230473910] [2019-11-23 22:34:43,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:43,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:43,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393113285] [2019-11-23 22:34:43,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:43,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:43,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:43,864 INFO L87 Difference]: Start difference. First operand 2253 states and 3503 transitions. Second operand 4 states. [2019-11-23 22:34:44,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:44,262 INFO L93 Difference]: Finished difference Result 5816 states and 9062 transitions. [2019-11-23 22:34:44,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:44,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-23 22:34:44,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:44,288 INFO L225 Difference]: With dead ends: 5816 [2019-11-23 22:34:44,288 INFO L226 Difference]: Without dead ends: 3590 [2019-11-23 22:34:44,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2019-11-23 22:34:44,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3588. [2019-11-23 22:34:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-11-23 22:34:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5552 transitions. [2019-11-23 22:34:44,664 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5552 transitions. Word has length 106 [2019-11-23 22:34:44,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:44,664 INFO L462 AbstractCegarLoop]: Abstraction has 3588 states and 5552 transitions. [2019-11-23 22:34:44,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5552 transitions. [2019-11-23 22:34:44,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-23 22:34:44,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:44,667 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] [2019-11-23 22:34:44,668 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:44,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:44,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1846587040, now seen corresponding path program 1 times [2019-11-23 22:34:44,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:44,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383157261] [2019-11-23 22:34:44,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:44,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:44,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383157261] [2019-11-23 22:34:44,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:44,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:44,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64625870] [2019-11-23 22:34:44,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:44,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:44,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:44,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:44,739 INFO L87 Difference]: Start difference. First operand 3588 states and 5552 transitions. Second operand 3 states. [2019-11-23 22:34:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:45,161 INFO L93 Difference]: Finished difference Result 8744 states and 13633 transitions. [2019-11-23 22:34:45,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:45,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-23 22:34:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:45,189 INFO L225 Difference]: With dead ends: 8744 [2019-11-23 22:34:45,189 INFO L226 Difference]: Without dead ends: 5528 [2019-11-23 22:34:45,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5528 states. [2019-11-23 22:34:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5528 to 5526. [2019-11-23 22:34:45,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5526 states. [2019-11-23 22:34:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5526 states to 5526 states and 8479 transitions. [2019-11-23 22:34:45,554 INFO L78 Accepts]: Start accepts. Automaton has 5526 states and 8479 transitions. Word has length 108 [2019-11-23 22:34:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:45,554 INFO L462 AbstractCegarLoop]: Abstraction has 5526 states and 8479 transitions. [2019-11-23 22:34:45,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 5526 states and 8479 transitions. [2019-11-23 22:34:45,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-23 22:34:45,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:45,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:45,558 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:45,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:45,559 INFO L82 PathProgramCache]: Analyzing trace with hash 224725848, now seen corresponding path program 1 times [2019-11-23 22:34:45,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:45,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850277175] [2019-11-23 22:34:45,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:45,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850277175] [2019-11-23 22:34:45,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:45,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:45,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940053243] [2019-11-23 22:34:45,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:45,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:45,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:45,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:45,661 INFO L87 Difference]: Start difference. First operand 5526 states and 8479 transitions. Second operand 3 states. [2019-11-23 22:34:46,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:46,114 INFO L93 Difference]: Finished difference Result 14566 states and 22766 transitions. [2019-11-23 22:34:46,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:46,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-23 22:34:46,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:46,177 INFO L225 Difference]: With dead ends: 14566 [2019-11-23 22:34:46,177 INFO L226 Difference]: Without dead ends: 9372 [2019-11-23 22:34:46,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:46,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9372 states. [2019-11-23 22:34:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9372 to 8962. [2019-11-23 22:34:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8962 states. [2019-11-23 22:34:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8962 states to 8962 states and 13974 transitions. [2019-11-23 22:34:46,779 INFO L78 Accepts]: Start accepts. Automaton has 8962 states and 13974 transitions. Word has length 110 [2019-11-23 22:34:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:46,779 INFO L462 AbstractCegarLoop]: Abstraction has 8962 states and 13974 transitions. [2019-11-23 22:34:46,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 8962 states and 13974 transitions. [2019-11-23 22:34:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 22:34:46,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:46,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] [2019-11-23 22:34:46,783 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:46,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1189364322, now seen corresponding path program 1 times [2019-11-23 22:34:46,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:46,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843464720] [2019-11-23 22:34:46,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:46,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843464720] [2019-11-23 22:34:46,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:46,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:46,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146830202] [2019-11-23 22:34:46,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:46,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:46,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:46,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:46,957 INFO L87 Difference]: Start difference. First operand 8962 states and 13974 transitions. Second operand 4 states. [2019-11-23 22:34:47,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:47,722 INFO L93 Difference]: Finished difference Result 25027 states and 38954 transitions. [2019-11-23 22:34:47,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:47,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-23 22:34:47,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:47,756 INFO L225 Difference]: With dead ends: 25027 [2019-11-23 22:34:47,757 INFO L226 Difference]: Without dead ends: 16104 [2019-11-23 22:34:47,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:47,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16104 states. [2019-11-23 22:34:48,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16104 to 16102. [2019-11-23 22:34:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16102 states. [2019-11-23 22:34:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16102 states to 16102 states and 24827 transitions. [2019-11-23 22:34:48,569 INFO L78 Accepts]: Start accepts. Automaton has 16102 states and 24827 transitions. Word has length 111 [2019-11-23 22:34:48,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:48,570 INFO L462 AbstractCegarLoop]: Abstraction has 16102 states and 24827 transitions. [2019-11-23 22:34:48,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 16102 states and 24827 transitions. [2019-11-23 22:34:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-23 22:34:48,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:48,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:48,575 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:48,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:48,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2128482264, now seen corresponding path program 1 times [2019-11-23 22:34:48,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:48,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123535473] [2019-11-23 22:34:48,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:48,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123535473] [2019-11-23 22:34:48,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:48,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:48,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213456021] [2019-11-23 22:34:48,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:48,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:48,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:48,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:48,611 INFO L87 Difference]: Start difference. First operand 16102 states and 24827 transitions. Second operand 3 states. [2019-11-23 22:34:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:50,674 INFO L93 Difference]: Finished difference Result 48114 states and 74234 transitions. [2019-11-23 22:34:50,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:50,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-23 22:34:50,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:50,723 INFO L225 Difference]: With dead ends: 48114 [2019-11-23 22:34:50,723 INFO L226 Difference]: Without dead ends: 32117 [2019-11-23 22:34:50,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32117 states. [2019-11-23 22:34:51,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32117 to 16108. [2019-11-23 22:34:51,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16108 states. [2019-11-23 22:34:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16108 states to 16108 states and 24833 transitions. [2019-11-23 22:34:51,810 INFO L78 Accepts]: Start accepts. Automaton has 16108 states and 24833 transitions. Word has length 112 [2019-11-23 22:34:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:51,811 INFO L462 AbstractCegarLoop]: Abstraction has 16108 states and 24833 transitions. [2019-11-23 22:34:51,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 16108 states and 24833 transitions. [2019-11-23 22:34:51,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-23 22:34:51,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:51,817 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] [2019-11-23 22:34:51,817 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:51,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:51,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1621970129, now seen corresponding path program 1 times [2019-11-23 22:34:51,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:51,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849628926] [2019-11-23 22:34:51,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:51,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849628926] [2019-11-23 22:34:51,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:51,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:51,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188105051] [2019-11-23 22:34:51,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:51,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:51,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:51,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:51,896 INFO L87 Difference]: Start difference. First operand 16108 states and 24833 transitions. Second operand 3 states. [2019-11-23 22:34:53,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:53,095 INFO L93 Difference]: Finished difference Result 41746 states and 64349 transitions. [2019-11-23 22:34:53,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:53,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-23 22:34:53,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:53,130 INFO L225 Difference]: With dead ends: 41746 [2019-11-23 22:34:53,131 INFO L226 Difference]: Without dead ends: 26384 [2019-11-23 22:34:53,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26384 states. [2019-11-23 22:34:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26384 to 26382. [2019-11-23 22:34:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26382 states. [2019-11-23 22:34:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26382 states to 26382 states and 40027 transitions. [2019-11-23 22:34:54,492 INFO L78 Accepts]: Start accepts. Automaton has 26382 states and 40027 transitions. Word has length 113 [2019-11-23 22:34:54,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:54,493 INFO L462 AbstractCegarLoop]: Abstraction has 26382 states and 40027 transitions. [2019-11-23 22:34:54,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:54,493 INFO L276 IsEmpty]: Start isEmpty. Operand 26382 states and 40027 transitions. [2019-11-23 22:34:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-23 22:34:54,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:54,501 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] [2019-11-23 22:34:54,501 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:54,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:54,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1799632340, now seen corresponding path program 1 times [2019-11-23 22:34:54,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:54,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676933601] [2019-11-23 22:34:54,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:54,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676933601] [2019-11-23 22:34:54,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:54,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:54,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501501545] [2019-11-23 22:34:54,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:54,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:54,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:54,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:54,610 INFO L87 Difference]: Start difference. First operand 26382 states and 40027 transitions. Second operand 4 states. [2019-11-23 22:34:56,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:56,032 INFO L93 Difference]: Finished difference Result 48995 states and 74626 transitions. [2019-11-23 22:34:56,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:56,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-23 22:34:56,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:56,061 INFO L225 Difference]: With dead ends: 48995 [2019-11-23 22:34:56,061 INFO L226 Difference]: Without dead ends: 23283 [2019-11-23 22:34:56,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23283 states. [2019-11-23 22:34:57,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23283 to 23283. [2019-11-23 22:34:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23283 states. [2019-11-23 22:34:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23283 states to 23283 states and 35373 transitions. [2019-11-23 22:34:57,275 INFO L78 Accepts]: Start accepts. Automaton has 23283 states and 35373 transitions. Word has length 113 [2019-11-23 22:34:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:57,276 INFO L462 AbstractCegarLoop]: Abstraction has 23283 states and 35373 transitions. [2019-11-23 22:34:57,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 23283 states and 35373 transitions. [2019-11-23 22:34:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-23 22:34:57,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:57,282 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] [2019-11-23 22:34:57,282 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:57,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:57,283 INFO L82 PathProgramCache]: Analyzing trace with hash -812664826, now seen corresponding path program 1 times [2019-11-23 22:34:57,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:57,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786600688] [2019-11-23 22:34:57,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:57,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:34:57,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786600688] [2019-11-23 22:34:57,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:57,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:57,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986633509] [2019-11-23 22:34:57,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:57,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:57,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:57,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:57,400 INFO L87 Difference]: Start difference. First operand 23283 states and 35373 transitions. Second operand 4 states. [2019-11-23 22:34:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:58,621 INFO L93 Difference]: Finished difference Result 44591 states and 67806 transitions. [2019-11-23 22:34:58,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:58,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-23 22:34:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:58,641 INFO L225 Difference]: With dead ends: 44591 [2019-11-23 22:34:58,642 INFO L226 Difference]: Without dead ends: 21601 [2019-11-23 22:34:58,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:58,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21601 states. [2019-11-23 22:34:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21601 to 21559. [2019-11-23 22:34:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21559 states. [2019-11-23 22:34:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21559 states to 21559 states and 32717 transitions. [2019-11-23 22:34:59,578 INFO L78 Accepts]: Start accepts. Automaton has 21559 states and 32717 transitions. Word has length 116 [2019-11-23 22:34:59,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:59,579 INFO L462 AbstractCegarLoop]: Abstraction has 21559 states and 32717 transitions. [2019-11-23 22:34:59,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:59,579 INFO L276 IsEmpty]: Start isEmpty. Operand 21559 states and 32717 transitions. [2019-11-23 22:34:59,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-23 22:34:59,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:59,584 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:34:59,584 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:59,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:59,584 INFO L82 PathProgramCache]: Analyzing trace with hash -929354459, now seen corresponding path program 1 times [2019-11-23 22:34:59,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:59,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814028294] [2019-11-23 22:34:59,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:59,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:34:59,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814028294] [2019-11-23 22:34:59,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:59,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:59,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036561125] [2019-11-23 22:34:59,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:59,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:59,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:59,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:59,710 INFO L87 Difference]: Start difference. First operand 21559 states and 32717 transitions. Second operand 4 states. [2019-11-23 22:35:00,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:00,921 INFO L93 Difference]: Finished difference Result 43127 states and 65445 transitions. [2019-11-23 22:35:00,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:00,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-23 22:35:00,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:00,944 INFO L225 Difference]: With dead ends: 43127 [2019-11-23 22:35:00,944 INFO L226 Difference]: Without dead ends: 21723 [2019-11-23 22:35:00,961 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:35:00,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21723 states. [2019-11-23 22:35:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21723 to 21661. [2019-11-23 22:35:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21661 states. [2019-11-23 22:35:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21661 states to 21661 states and 32820 transitions. [2019-11-23 22:35:02,687 INFO L78 Accepts]: Start accepts. Automaton has 21661 states and 32820 transitions. Word has length 118 [2019-11-23 22:35:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:02,687 INFO L462 AbstractCegarLoop]: Abstraction has 21661 states and 32820 transitions. [2019-11-23 22:35:02,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 21661 states and 32820 transitions. [2019-11-23 22:35:02,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-23 22:35:02,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:02,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:35:02,692 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:02,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:02,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1710773055, now seen corresponding path program 1 times [2019-11-23 22:35:02,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:02,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823177019] [2019-11-23 22:35:02,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:02,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823177019] [2019-11-23 22:35:02,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:02,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:02,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583428525] [2019-11-23 22:35:02,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:02,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:02,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:02,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:02,731 INFO L87 Difference]: Start difference. First operand 21661 states and 32820 transitions. Second operand 3 states. [2019-11-23 22:35:04,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:04,886 INFO L93 Difference]: Finished difference Result 58875 states and 89429 transitions. [2019-11-23 22:35:04,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:04,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-23 22:35:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:04,930 INFO L225 Difference]: With dead ends: 58875 [2019-11-23 22:35:04,930 INFO L226 Difference]: Without dead ends: 43115 [2019-11-23 22:35:04,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:04,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43115 states. [2019-11-23 22:35:06,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43115 to 21671. [2019-11-23 22:35:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21671 states. [2019-11-23 22:35:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21671 states to 21671 states and 32830 transitions. [2019-11-23 22:35:06,145 INFO L78 Accepts]: Start accepts. Automaton has 21671 states and 32830 transitions. Word has length 119 [2019-11-23 22:35:06,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:06,146 INFO L462 AbstractCegarLoop]: Abstraction has 21671 states and 32830 transitions. [2019-11-23 22:35:06,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 21671 states and 32830 transitions. [2019-11-23 22:35:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-23 22:35:06,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:06,150 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] [2019-11-23 22:35:06,150 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:06,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:06,151 INFO L82 PathProgramCache]: Analyzing trace with hash -993915098, now seen corresponding path program 1 times [2019-11-23 22:35:06,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:06,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351212999] [2019-11-23 22:35:06,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:06,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351212999] [2019-11-23 22:35:06,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:06,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:06,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663212688] [2019-11-23 22:35:06,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:06,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:06,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:06,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:06,244 INFO L87 Difference]: Start difference. First operand 21671 states and 32830 transitions. Second operand 4 states. [2019-11-23 22:35:07,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:07,428 INFO L93 Difference]: Finished difference Result 39799 states and 60385 transitions. [2019-11-23 22:35:07,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:07,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-23 22:35:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:07,453 INFO L225 Difference]: With dead ends: 39799 [2019-11-23 22:35:07,453 INFO L226 Difference]: Without dead ends: 21671 [2019-11-23 22:35:07,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21671 states. [2019-11-23 22:35:08,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21671 to 21666. [2019-11-23 22:35:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21666 states. [2019-11-23 22:35:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21666 states to 21666 states and 32817 transitions. [2019-11-23 22:35:08,756 INFO L78 Accepts]: Start accepts. Automaton has 21666 states and 32817 transitions. Word has length 120 [2019-11-23 22:35:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:08,756 INFO L462 AbstractCegarLoop]: Abstraction has 21666 states and 32817 transitions. [2019-11-23 22:35:08,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand 21666 states and 32817 transitions. [2019-11-23 22:35:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-23 22:35:08,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:08,760 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] [2019-11-23 22:35:08,760 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:08,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:08,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1394285578, now seen corresponding path program 1 times [2019-11-23 22:35:08,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:08,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371028305] [2019-11-23 22:35:08,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:08,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371028305] [2019-11-23 22:35:08,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:08,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:35:08,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853121770] [2019-11-23 22:35:08,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:35:08,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:08,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:35:08,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:08,929 INFO L87 Difference]: Start difference. First operand 21666 states and 32817 transitions. Second operand 5 states. [2019-11-23 22:35:10,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:10,049 INFO L93 Difference]: Finished difference Result 35788 states and 54278 transitions. [2019-11-23 22:35:10,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:10,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-11-23 22:35:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:10,069 INFO L225 Difference]: With dead ends: 35788 [2019-11-23 22:35:10,070 INFO L226 Difference]: Without dead ends: 20187 [2019-11-23 22:35:10,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20187 states. [2019-11-23 22:35:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20187 to 20030. [2019-11-23 22:35:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20030 states. [2019-11-23 22:35:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20030 states to 20030 states and 30264 transitions. [2019-11-23 22:35:11,911 INFO L78 Accepts]: Start accepts. Automaton has 20030 states and 30264 transitions. Word has length 120 [2019-11-23 22:35:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:11,911 INFO L462 AbstractCegarLoop]: Abstraction has 20030 states and 30264 transitions. [2019-11-23 22:35:11,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:35:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 20030 states and 30264 transitions. [2019-11-23 22:35:11,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-23 22:35:11,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:11,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] [2019-11-23 22:35:11,915 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:11,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:11,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1343086903, now seen corresponding path program 1 times [2019-11-23 22:35:11,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:11,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849686292] [2019-11-23 22:35:11,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:12,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849686292] [2019-11-23 22:35:12,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:12,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 22:35:12,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828716444] [2019-11-23 22:35:12,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:35:12,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:12,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:35:12,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:35:12,195 INFO L87 Difference]: Start difference. First operand 20030 states and 30264 transitions. Second operand 12 states. [2019-11-23 22:35:16,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:16,783 INFO L93 Difference]: Finished difference Result 73114 states and 112944 transitions. [2019-11-23 22:35:16,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:35:16,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-11-23 22:35:16,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:16,844 INFO L225 Difference]: With dead ends: 73114 [2019-11-23 22:35:16,844 INFO L226 Difference]: Without dead ends: 55192 [2019-11-23 22:35:16,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-11-23 22:35:16,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55192 states. [2019-11-23 22:35:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55192 to 46889. [2019-11-23 22:35:19,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46889 states. [2019-11-23 22:35:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46889 states to 46889 states and 71849 transitions. [2019-11-23 22:35:19,800 INFO L78 Accepts]: Start accepts. Automaton has 46889 states and 71849 transitions. Word has length 122 [2019-11-23 22:35:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:19,800 INFO L462 AbstractCegarLoop]: Abstraction has 46889 states and 71849 transitions. [2019-11-23 22:35:19,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:35:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 46889 states and 71849 transitions. [2019-11-23 22:35:19,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-23 22:35:19,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:19,804 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] [2019-11-23 22:35:19,804 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:19,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:19,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1778231621, now seen corresponding path program 1 times [2019-11-23 22:35:19,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:19,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700888496] [2019-11-23 22:35:19,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:19,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700888496] [2019-11-23 22:35:19,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:19,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:19,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954819221] [2019-11-23 22:35:19,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:19,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:19,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:19,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:19,874 INFO L87 Difference]: Start difference. First operand 46889 states and 71849 transitions. Second operand 3 states. [2019-11-23 22:35:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:26,634 INFO L93 Difference]: Finished difference Result 133443 states and 207185 transitions. [2019-11-23 22:35:26,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:26,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-23 22:35:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:26,755 INFO L225 Difference]: With dead ends: 133443 [2019-11-23 22:35:26,755 INFO L226 Difference]: Without dead ends: 90157 [2019-11-23 22:35:26,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90157 states. [2019-11-23 22:35:32,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90157 to 90083. [2019-11-23 22:35:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90083 states. [2019-11-23 22:35:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90083 states to 90083 states and 137239 transitions. [2019-11-23 22:35:32,715 INFO L78 Accepts]: Start accepts. Automaton has 90083 states and 137239 transitions. Word has length 122 [2019-11-23 22:35:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:32,715 INFO L462 AbstractCegarLoop]: Abstraction has 90083 states and 137239 transitions. [2019-11-23 22:35:32,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 90083 states and 137239 transitions. [2019-11-23 22:35:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-23 22:35:32,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:32,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] [2019-11-23 22:35:32,720 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:32,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:32,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1090994532, now seen corresponding path program 1 times [2019-11-23 22:35:32,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:32,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145381560] [2019-11-23 22:35:32,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:32,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145381560] [2019-11-23 22:35:32,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:32,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:35:32,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908285984] [2019-11-23 22:35:32,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:35:32,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:32,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:35:32,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:35:32,879 INFO L87 Difference]: Start difference. First operand 90083 states and 137239 transitions. Second operand 8 states. [2019-11-23 22:35:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:39,891 INFO L93 Difference]: Finished difference Result 176995 states and 270863 transitions. [2019-11-23 22:35:39,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:39,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-11-23 22:35:39,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:40,251 INFO L225 Difference]: With dead ends: 176995 [2019-11-23 22:35:40,252 INFO L226 Difference]: Without dead ends: 90085 [2019-11-23 22:35:40,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:35:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90085 states. [2019-11-23 22:35:44,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90085 to 54886. [2019-11-23 22:35:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54886 states. [2019-11-23 22:35:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54886 states to 54886 states and 82979 transitions. [2019-11-23 22:35:44,431 INFO L78 Accepts]: Start accepts. Automaton has 54886 states and 82979 transitions. Word has length 122 [2019-11-23 22:35:44,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:44,431 INFO L462 AbstractCegarLoop]: Abstraction has 54886 states and 82979 transitions. [2019-11-23 22:35:44,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:35:44,431 INFO L276 IsEmpty]: Start isEmpty. Operand 54886 states and 82979 transitions. [2019-11-23 22:35:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-23 22:35:44,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:44,435 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] [2019-11-23 22:35:44,435 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:44,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:44,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1976470388, now seen corresponding path program 1 times [2019-11-23 22:35:44,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:44,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474378721] [2019-11-23 22:35:44,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:44,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474378721] [2019-11-23 22:35:44,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:44,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:35:44,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680131369] [2019-11-23 22:35:44,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:35:44,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:44,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:35:44,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:35:44,571 INFO L87 Difference]: Start difference. First operand 54886 states and 82979 transitions. Second operand 6 states. [2019-11-23 22:35:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:56,717 INFO L93 Difference]: Finished difference Result 211808 states and 322091 transitions. [2019-11-23 22:35:56,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:35:56,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-11-23 22:35:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:56,927 INFO L225 Difference]: With dead ends: 211808 [2019-11-23 22:35:56,927 INFO L226 Difference]: Without dead ends: 157938 [2019-11-23 22:35:56,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:35:57,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157938 states.