/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-pthread/cs_dekker.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:46:16,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:46:16,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:46:16,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:46:16,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:46:16,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:46:16,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:46:16,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:46:16,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:46:16,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:46:16,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:46:16,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:46:16,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:46:16,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:46:16,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:46:16,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:46:16,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:46:16,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:46:16,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:46:16,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:46:16,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:46:16,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:46:16,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:46:16,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:46:16,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:46:16,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:46:16,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:46:16,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:46:16,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:46:16,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:46:16,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:46:16,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:46:16,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:46:16,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:46:16,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:46:16,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:46:16,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:46:16,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:46:16,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:46:16,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:46:16,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:46:16,783 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:46:16,810 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:46:16,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:46:16,811 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:46:16,811 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:46:16,812 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:46:16,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:46:16,812 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:46:16,812 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:46:16,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:46:16,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:46:16,813 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:46:16,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:46:16,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:46:16,813 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:46:16,814 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:46:16,814 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:46:16,814 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:46:16,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:46:16,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:46:16,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:46:16,815 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:46:16,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:46:16,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:46:16,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:46:16,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:46:16,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:46:16,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:46:16,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:46:16,816 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:46:16,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:46:17,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:46:17,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:46:17,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:46:17,134 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:46:17,135 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:46:17,136 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_dekker.i [2019-11-23 22:46:17,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3343cc0/2dc1c7c9469e4736a01dd43946eaa48a/FLAGca883202b [2019-11-23 22:46:17,792 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:46:17,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_dekker.i [2019-11-23 22:46:17,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3343cc0/2dc1c7c9469e4736a01dd43946eaa48a/FLAGca883202b [2019-11-23 22:46:18,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3343cc0/2dc1c7c9469e4736a01dd43946eaa48a [2019-11-23 22:46:18,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:46:18,031 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:46:18,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:46:18,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:46:18,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:46:18,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:46:18" (1/1) ... [2019-11-23 22:46:18,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d92a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:18, skipping insertion in model container [2019-11-23 22:46:18,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:46:18" (1/1) ... [2019-11-23 22:46:18,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:46:18,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:46:18,738 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:46:18,765 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:46:18,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:46:18,968 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:46:18,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:18 WrapperNode [2019-11-23 22:46:18,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:46:18,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:46:18,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:46:18,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:46:18,977 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:46:18" (1/1) ... [2019-11-23 22:46:19,007 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:46:18" (1/1) ... [2019-11-23 22:46:19,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:46:19,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:46:19,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:46:19,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:46:19,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:18" (1/1) ... [2019-11-23 22:46:19,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:18" (1/1) ... [2019-11-23 22:46:19,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:18" (1/1) ... [2019-11-23 22:46:19,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:18" (1/1) ... [2019-11-23 22:46:19,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:18" (1/1) ... [2019-11-23 22:46:19,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:18" (1/1) ... [2019-11-23 22:46:19,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:18" (1/1) ... [2019-11-23 22:46:19,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:46:19,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:46:19,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:46:19,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:46:19,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:18" (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:46:19,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 22:46:19,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 22:46:19,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 22:46:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 22:46:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 22:46:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 22:46:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-23 22:46:19,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-23 22:46:19,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:46:19,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:46:22,930 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:46:22,930 INFO L284 CfgBuilder]: Removed 86 assume(true) statements. [2019-11-23 22:46:22,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:46:22 BoogieIcfgContainer [2019-11-23 22:46:22,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:46:22,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:46:22,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:46:22,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:46:22,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:46:18" (1/3) ... [2019-11-23 22:46:22,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244f89f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:46:22, skipping insertion in model container [2019-11-23 22:46:22,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:18" (2/3) ... [2019-11-23 22:46:22,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244f89f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:46:22, skipping insertion in model container [2019-11-23 22:46:22,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:46:22" (3/3) ... [2019-11-23 22:46:22,940 INFO L109 eAbstractionObserver]: Analyzing ICFG cs_dekker.i [2019-11-23 22:46:22,950 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:46:22,957 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:46:22,969 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:46:22,995 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:46:22,995 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:46:22,995 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:46:22,995 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:46:22,995 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:46:22,996 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:46:22,996 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:46:22,996 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:46:23,015 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-23 22:46:23,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 22:46:23,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:23,023 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:46:23,024 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:23,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:23,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1242096095, now seen corresponding path program 1 times [2019-11-23 22:46:23,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:23,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205793087] [2019-11-23 22:46:23,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:23,353 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:46:23,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205793087] [2019-11-23 22:46:23,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:23,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:23,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066983068] [2019-11-23 22:46:23,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:23,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:23,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:23,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:23,379 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-23 22:46:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:23,477 INFO L93 Difference]: Finished difference Result 276 states and 444 transitions. [2019-11-23 22:46:23,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:23,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-23 22:46:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:23,501 INFO L225 Difference]: With dead ends: 276 [2019-11-23 22:46:23,502 INFO L226 Difference]: Without dead ends: 137 [2019-11-23 22:46:23,510 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:46:23,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-23 22:46:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2019-11-23 22:46:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-23 22:46:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 213 transitions. [2019-11-23 22:46:23,563 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 213 transitions. Word has length 12 [2019-11-23 22:46:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:23,563 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 213 transitions. [2019-11-23 22:46:23,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 213 transitions. [2019-11-23 22:46:23,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:46:23,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:23,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:46:23,566 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:23,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:23,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1733083125, now seen corresponding path program 1 times [2019-11-23 22:46:23,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:23,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155892522] [2019-11-23 22:46:23,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:46:23,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155892522] [2019-11-23 22:46:23,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:23,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:23,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914106149] [2019-11-23 22:46:23,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:23,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:23,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:23,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:23,701 INFO L87 Difference]: Start difference. First operand 134 states and 213 transitions. Second operand 3 states. [2019-11-23 22:46:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:23,751 INFO L93 Difference]: Finished difference Result 267 states and 426 transitions. [2019-11-23 22:46:23,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:23,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-23 22:46:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:23,757 INFO L225 Difference]: With dead ends: 267 [2019-11-23 22:46:23,757 INFO L226 Difference]: Without dead ends: 136 [2019-11-23 22:46:23,760 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:46:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-23 22:46:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-11-23 22:46:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-23 22:46:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 214 transitions. [2019-11-23 22:46:23,781 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 214 transitions. Word has length 15 [2019-11-23 22:46:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:23,782 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 214 transitions. [2019-11-23 22:46:23,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 214 transitions. [2019-11-23 22:46:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:46:23,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:23,783 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:46:23,783 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:23,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:23,784 INFO L82 PathProgramCache]: Analyzing trace with hash 811860365, now seen corresponding path program 1 times [2019-11-23 22:46:23,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:23,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118146544] [2019-11-23 22:46:23,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:46:24,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118146544] [2019-11-23 22:46:24,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:24,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:24,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78929353] [2019-11-23 22:46:24,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:46:24,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:24,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:46:24,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:46:24,237 INFO L87 Difference]: Start difference. First operand 135 states and 214 transitions. Second operand 4 states. [2019-11-23 22:46:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:24,334 INFO L93 Difference]: Finished difference Result 236 states and 375 transitions. [2019-11-23 22:46:24,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:46:24,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-23 22:46:24,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:24,342 INFO L225 Difference]: With dead ends: 236 [2019-11-23 22:46:24,342 INFO L226 Difference]: Without dead ends: 225 [2019-11-23 22:46:24,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:46:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-23 22:46:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-11-23 22:46:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-23 22:46:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 354 transitions. [2019-11-23 22:46:24,376 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 354 transitions. Word has length 17 [2019-11-23 22:46:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:24,377 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 354 transitions. [2019-11-23 22:46:24,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:46:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 354 transitions. [2019-11-23 22:46:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 22:46:24,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:24,381 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] [2019-11-23 22:46:24,381 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:24,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:24,381 INFO L82 PathProgramCache]: Analyzing trace with hash -2031636797, now seen corresponding path program 1 times [2019-11-23 22:46:24,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:24,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881931721] [2019-11-23 22:46:24,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:46:24,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881931721] [2019-11-23 22:46:24,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:24,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:24,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672635264] [2019-11-23 22:46:24,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:24,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:24,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:24,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:24,777 INFO L87 Difference]: Start difference. First operand 225 states and 354 transitions. Second operand 3 states. [2019-11-23 22:46:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:24,922 INFO L93 Difference]: Finished difference Result 461 states and 724 transitions. [2019-11-23 22:46:24,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:24,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-23 22:46:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:24,924 INFO L225 Difference]: With dead ends: 461 [2019-11-23 22:46:24,924 INFO L226 Difference]: Without dead ends: 257 [2019-11-23 22:46:24,925 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:46:24,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-23 22:46:24,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2019-11-23 22:46:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-23 22:46:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 398 transitions. [2019-11-23 22:46:24,939 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 398 transitions. Word has length 45 [2019-11-23 22:46:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:24,939 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 398 transitions. [2019-11-23 22:46:24,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 398 transitions. [2019-11-23 22:46:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 22:46:24,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:24,942 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] [2019-11-23 22:46:24,942 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:24,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash 457892165, now seen corresponding path program 1 times [2019-11-23 22:46:24,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:24,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51632092] [2019-11-23 22:46:24,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:46:25,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51632092] [2019-11-23 22:46:25,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:25,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:46:25,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382240668] [2019-11-23 22:46:25,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:46:25,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:25,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:46:25,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:46:25,615 INFO L87 Difference]: Start difference. First operand 257 states and 398 transitions. Second operand 6 states. [2019-11-23 22:46:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:28,369 INFO L93 Difference]: Finished difference Result 392 states and 604 transitions. [2019-11-23 22:46:28,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:46:28,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-11-23 22:46:28,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:28,371 INFO L225 Difference]: With dead ends: 392 [2019-11-23 22:46:28,371 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 22:46:28,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:46:28,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 22:46:28,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-23 22:46:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 22:46:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 376 transitions. [2019-11-23 22:46:28,382 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 376 transitions. Word has length 45 [2019-11-23 22:46:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:28,382 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 376 transitions. [2019-11-23 22:46:28,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:46:28,384 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 376 transitions. [2019-11-23 22:46:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 22:46:28,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:28,387 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] [2019-11-23 22:46:28,387 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash -647320505, now seen corresponding path program 1 times [2019-11-23 22:46:28,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:28,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095970402] [2019-11-23 22:46:28,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:46:28,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095970402] [2019-11-23 22:46:28,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:28,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:46:28,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974649250] [2019-11-23 22:46:28,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:46:28,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:28,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:46:28,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:46:28,662 INFO L87 Difference]: Start difference. First operand 243 states and 376 transitions. Second operand 4 states. [2019-11-23 22:46:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:28,842 INFO L93 Difference]: Finished difference Result 479 states and 745 transitions. [2019-11-23 22:46:28,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:46:28,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-23 22:46:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:28,845 INFO L225 Difference]: With dead ends: 479 [2019-11-23 22:46:28,845 INFO L226 Difference]: Without dead ends: 280 [2019-11-23 22:46:28,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:46:28,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-23 22:46:28,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2019-11-23 22:46:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-23 22:46:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 426 transitions. [2019-11-23 22:46:28,856 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 426 transitions. Word has length 45 [2019-11-23 22:46:28,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:28,857 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 426 transitions. [2019-11-23 22:46:28,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:46:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 426 transitions. [2019-11-23 22:46:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 22:46:28,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:28,859 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] [2019-11-23 22:46:28,859 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:28,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:28,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1668388859, now seen corresponding path program 1 times [2019-11-23 22:46:28,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:28,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145457242] [2019-11-23 22:46:28,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:46:30,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145457242] [2019-11-23 22:46:30,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072504665] [2019-11-23 22:46:30,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:46:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:30,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:46:30,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:46:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:46:30,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:46:30,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-23 22:46:30,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758940895] [2019-11-23 22:46:30,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:46:30,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:30,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:46:30,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:46:30,870 INFO L87 Difference]: Start difference. First operand 280 states and 426 transitions. Second operand 6 states. [2019-11-23 22:46:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:31,010 INFO L93 Difference]: Finished difference Result 575 states and 873 transitions. [2019-11-23 22:46:31,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:46:31,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-11-23 22:46:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:31,014 INFO L225 Difference]: With dead ends: 575 [2019-11-23 22:46:31,014 INFO L226 Difference]: Without dead ends: 298 [2019-11-23 22:46:31,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:46:31,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-23 22:46:31,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 289. [2019-11-23 22:46:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-23 22:46:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 436 transitions. [2019-11-23 22:46:31,031 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 436 transitions. Word has length 45 [2019-11-23 22:46:31,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:31,032 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 436 transitions. [2019-11-23 22:46:31,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:46:31,032 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 436 transitions. [2019-11-23 22:46:31,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:46:31,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:31,034 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:31,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:46:31,241 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:31,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:31,241 INFO L82 PathProgramCache]: Analyzing trace with hash -162180265, now seen corresponding path program 2 times [2019-11-23 22:46:31,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:31,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239686576] [2019-11-23 22:46:31,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 22:46:32,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239686576] [2019-11-23 22:46:32,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317698486] [2019-11-23 22:46:32,095 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:46:32,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-23 22:46:32,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:46:32,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 22:46:32,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:46:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-23 22:46:32,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:46:32,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-11-23 22:46:32,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187992668] [2019-11-23 22:46:32,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:46:32,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:32,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:46:32,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:46:32,393 INFO L87 Difference]: Start difference. First operand 289 states and 436 transitions. Second operand 7 states. [2019-11-23 22:46:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:34,446 INFO L93 Difference]: Finished difference Result 1350 states and 1999 transitions. [2019-11-23 22:46:34,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:46:34,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-23 22:46:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:34,453 INFO L225 Difference]: With dead ends: 1350 [2019-11-23 22:46:34,453 INFO L226 Difference]: Without dead ends: 1128 [2019-11-23 22:46:34,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:46:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-11-23 22:46:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 908. [2019-11-23 22:46:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2019-11-23 22:46:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1340 transitions. [2019-11-23 22:46:34,510 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1340 transitions. Word has length 54 [2019-11-23 22:46:34,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:34,511 INFO L462 AbstractCegarLoop]: Abstraction has 908 states and 1340 transitions. [2019-11-23 22:46:34,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:46:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1340 transitions. [2019-11-23 22:46:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:46:34,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:34,513 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:34,718 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:46:34,719 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:34,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:34,720 INFO L82 PathProgramCache]: Analyzing trace with hash 517878105, now seen corresponding path program 1 times [2019-11-23 22:46:34,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:34,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999133522] [2019-11-23 22:46:34,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:35,820 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-23 22:46:36,075 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-11-23 22:46:36,287 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-11-23 22:46:36,606 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-11-23 22:46:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-23 22:46:36,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999133522] [2019-11-23 22:46:36,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:36,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:46:36,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214966503] [2019-11-23 22:46:36,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:46:36,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:36,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:46:36,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:46:36,698 INFO L87 Difference]: Start difference. First operand 908 states and 1340 transitions. Second operand 11 states. [2019-11-23 22:46:39,238 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-11-23 22:46:39,409 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-23 22:46:39,832 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-23 22:46:41,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:41,973 INFO L93 Difference]: Finished difference Result 1335 states and 1976 transitions. [2019-11-23 22:46:41,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:46:41,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-11-23 22:46:41,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:41,985 INFO L225 Difference]: With dead ends: 1335 [2019-11-23 22:46:41,986 INFO L226 Difference]: Without dead ends: 1155 [2019-11-23 22:46:41,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-11-23 22:46:41,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2019-11-23 22:46:42,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 924. [2019-11-23 22:46:42,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2019-11-23 22:46:42,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1358 transitions. [2019-11-23 22:46:42,028 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1358 transitions. Word has length 54 [2019-11-23 22:46:42,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:42,028 INFO L462 AbstractCegarLoop]: Abstraction has 924 states and 1358 transitions. [2019-11-23 22:46:42,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 22:46:42,029 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1358 transitions. [2019-11-23 22:46:42,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:46:42,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:42,031 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:42,033 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:42,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:42,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1171065637, now seen corresponding path program 1 times [2019-11-23 22:46:42,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:42,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002469081] [2019-11-23 22:46:42,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:44,594 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-11-23 22:46:44,742 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-11-23 22:46:45,031 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-23 22:46:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-23 22:46:45,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002469081] [2019-11-23 22:46:45,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:45,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:46:45,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976559788] [2019-11-23 22:46:45,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:46:45,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:45,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:46:45,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:46:45,109 INFO L87 Difference]: Start difference. First operand 924 states and 1358 transitions. Second operand 10 states. [2019-11-23 22:46:47,525 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-11-23 22:46:47,759 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-11-23 22:46:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:48,941 INFO L93 Difference]: Finished difference Result 1691 states and 2496 transitions. [2019-11-23 22:46:48,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:46:48,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-11-23 22:46:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:48,949 INFO L225 Difference]: With dead ends: 1691 [2019-11-23 22:46:48,949 INFO L226 Difference]: Without dead ends: 1322 [2019-11-23 22:46:48,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-11-23 22:46:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-11-23 22:46:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 918. [2019-11-23 22:46:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-11-23 22:46:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1348 transitions. [2019-11-23 22:46:48,985 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1348 transitions. Word has length 54 [2019-11-23 22:46:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:48,986 INFO L462 AbstractCegarLoop]: Abstraction has 918 states and 1348 transitions. [2019-11-23 22:46:48,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:46:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1348 transitions. [2019-11-23 22:46:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:46:48,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:48,988 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:48,988 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:48,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:48,988 INFO L82 PathProgramCache]: Analyzing trace with hash -81368039, now seen corresponding path program 1 times [2019-11-23 22:46:48,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:48,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770538112] [2019-11-23 22:46:48,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:49,085 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-23 22:46:49,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770538112] [2019-11-23 22:46:49,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:49,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:49,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670785609] [2019-11-23 22:46:49,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:49,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:49,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:49,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:49,088 INFO L87 Difference]: Start difference. First operand 918 states and 1348 transitions. Second operand 3 states. [2019-11-23 22:46:49,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:49,170 INFO L93 Difference]: Finished difference Result 1628 states and 2444 transitions. [2019-11-23 22:46:49,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:49,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-23 22:46:49,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:49,176 INFO L225 Difference]: With dead ends: 1628 [2019-11-23 22:46:49,176 INFO L226 Difference]: Without dead ends: 955 [2019-11-23 22:46:49,177 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:46:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-23 22:46:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 938. [2019-11-23 22:46:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2019-11-23 22:46:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1366 transitions. [2019-11-23 22:46:49,211 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1366 transitions. Word has length 57 [2019-11-23 22:46:49,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:49,212 INFO L462 AbstractCegarLoop]: Abstraction has 938 states and 1366 transitions. [2019-11-23 22:46:49,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1366 transitions. [2019-11-23 22:46:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:46:49,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:49,214 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:49,214 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:49,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:49,215 INFO L82 PathProgramCache]: Analyzing trace with hash -668174053, now seen corresponding path program 1 times [2019-11-23 22:46:49,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:49,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015332962] [2019-11-23 22:46:49,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:49,875 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-11-23 22:46:50,104 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-11-23 22:46:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-23 22:46:50,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015332962] [2019-11-23 22:46:50,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:50,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:46:50,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577831170] [2019-11-23 22:46:50,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:46:50,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:50,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:46:50,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:46:50,240 INFO L87 Difference]: Start difference. First operand 938 states and 1366 transitions. Second operand 6 states. [2019-11-23 22:46:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:54,385 INFO L93 Difference]: Finished difference Result 1014 states and 1474 transitions. [2019-11-23 22:46:54,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:46:54,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-23 22:46:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:54,392 INFO L225 Difference]: With dead ends: 1014 [2019-11-23 22:46:54,392 INFO L226 Difference]: Without dead ends: 879 [2019-11-23 22:46:54,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:46:54,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-11-23 22:46:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 877. [2019-11-23 22:46:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-11-23 22:46:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1286 transitions. [2019-11-23 22:46:54,430 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1286 transitions. Word has length 57 [2019-11-23 22:46:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:54,431 INFO L462 AbstractCegarLoop]: Abstraction has 877 states and 1286 transitions. [2019-11-23 22:46:54,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:46:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1286 transitions. [2019-11-23 22:46:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:46:54,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:54,436 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:54,436 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:54,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:54,437 INFO L82 PathProgramCache]: Analyzing trace with hash 763412111, now seen corresponding path program 1 times [2019-11-23 22:46:54,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:54,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089294955] [2019-11-23 22:46:54,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-23 22:46:54,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089294955] [2019-11-23 22:46:54,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:54,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:46:54,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740557544] [2019-11-23 22:46:54,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:46:54,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:54,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:46:54,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:46:54,641 INFO L87 Difference]: Start difference. First operand 877 states and 1286 transitions. Second operand 7 states. [2019-11-23 22:46:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:56,135 INFO L93 Difference]: Finished difference Result 2029 states and 2909 transitions. [2019-11-23 22:46:56,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:46:56,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-11-23 22:46:56,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:56,144 INFO L225 Difference]: With dead ends: 2029 [2019-11-23 22:46:56,144 INFO L226 Difference]: Without dead ends: 1604 [2019-11-23 22:46:56,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:46:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2019-11-23 22:46:56,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1083. [2019-11-23 22:46:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-11-23 22:46:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1591 transitions. [2019-11-23 22:46:56,190 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1591 transitions. Word has length 57 [2019-11-23 22:46:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:56,191 INFO L462 AbstractCegarLoop]: Abstraction has 1083 states and 1591 transitions. [2019-11-23 22:46:56,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:46:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1591 transitions. [2019-11-23 22:46:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:46:56,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:56,192 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:56,192 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:56,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:56,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1572758737, now seen corresponding path program 1 times [2019-11-23 22:46:56,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:56,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580045861] [2019-11-23 22:46:56,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:46:57,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580045861] [2019-11-23 22:46:57,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840875079] [2019-11-23 22:46:57,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:46:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:57,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 22:46:57,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:46:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 22:46:57,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:46:57,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-23 22:46:57,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212007973] [2019-11-23 22:46:57,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:46:57,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:57,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:46:57,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:46:57,356 INFO L87 Difference]: Start difference. First operand 1083 states and 1591 transitions. Second operand 8 states. [2019-11-23 22:46:57,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:57,607 INFO L93 Difference]: Finished difference Result 2171 states and 3191 transitions. [2019-11-23 22:46:57,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 22:46:57,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-11-23 22:46:57,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:57,613 INFO L225 Difference]: With dead ends: 2171 [2019-11-23 22:46:57,613 INFO L226 Difference]: Without dead ends: 1096 [2019-11-23 22:46:57,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:46:57,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2019-11-23 22:46:57,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1096. [2019-11-23 22:46:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2019-11-23 22:46:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1605 transitions. [2019-11-23 22:46:57,661 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1605 transitions. Word has length 57 [2019-11-23 22:46:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:57,662 INFO L462 AbstractCegarLoop]: Abstraction has 1096 states and 1605 transitions. [2019-11-23 22:46:57,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:46:57,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1605 transitions. [2019-11-23 22:46:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-23 22:46:57,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:57,670 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:57,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:46:57,876 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:57,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:57,876 INFO L82 PathProgramCache]: Analyzing trace with hash 858658719, now seen corresponding path program 2 times [2019-11-23 22:46:57,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:57,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082737732] [2019-11-23 22:46:57,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-23 22:47:01,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082737732] [2019-11-23 22:47:01,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:01,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:47:01,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737211960] [2019-11-23 22:47:01,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:47:01,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:01,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:47:01,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:01,986 INFO L87 Difference]: Start difference. First operand 1096 states and 1605 transitions. Second operand 5 states. [2019-11-23 22:47:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:02,558 INFO L93 Difference]: Finished difference Result 1475 states and 2111 transitions. [2019-11-23 22:47:02,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:47:02,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-23 22:47:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:02,563 INFO L225 Difference]: With dead ends: 1475 [2019-11-23 22:47:02,564 INFO L226 Difference]: Without dead ends: 989 [2019-11-23 22:47:02,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:47:02,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-11-23 22:47:02,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 891. [2019-11-23 22:47:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-11-23 22:47:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1221 transitions. [2019-11-23 22:47:02,603 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1221 transitions. Word has length 70 [2019-11-23 22:47:02,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:02,603 INFO L462 AbstractCegarLoop]: Abstraction has 891 states and 1221 transitions. [2019-11-23 22:47:02,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:47:02,604 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1221 transitions. [2019-11-23 22:47:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-23 22:47:02,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:02,605 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:02,605 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:02,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:02,605 INFO L82 PathProgramCache]: Analyzing trace with hash 793100123, now seen corresponding path program 1 times [2019-11-23 22:47:02,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:02,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084773761] [2019-11-23 22:47:02,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-23 22:47:05,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084773761] [2019-11-23 22:47:05,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:05,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:47:05,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133303806] [2019-11-23 22:47:05,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:47:05,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:05,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:47:05,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:47:05,969 INFO L87 Difference]: Start difference. First operand 891 states and 1221 transitions. Second operand 6 states. [2019-11-23 22:47:06,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:06,565 INFO L93 Difference]: Finished difference Result 1572 states and 2117 transitions. [2019-11-23 22:47:06,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:47:06,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-23 22:47:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:06,569 INFO L225 Difference]: With dead ends: 1572 [2019-11-23 22:47:06,569 INFO L226 Difference]: Without dead ends: 775 [2019-11-23 22:47:06,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:47:06,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-11-23 22:47:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 740. [2019-11-23 22:47:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-11-23 22:47:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 951 transitions. [2019-11-23 22:47:06,604 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 951 transitions. Word has length 70 [2019-11-23 22:47:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:06,605 INFO L462 AbstractCegarLoop]: Abstraction has 740 states and 951 transitions. [2019-11-23 22:47:06,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:47:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 951 transitions. [2019-11-23 22:47:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-23 22:47:06,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:06,606 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:06,606 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:06,607 INFO L82 PathProgramCache]: Analyzing trace with hash 720713565, now seen corresponding path program 1 times [2019-11-23 22:47:06,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:06,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268603845] [2019-11-23 22:47:06,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-23 22:47:10,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268603845] [2019-11-23 22:47:10,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:10,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:47:10,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824453525] [2019-11-23 22:47:10,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:47:10,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:10,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:47:10,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:47:10,224 INFO L87 Difference]: Start difference. First operand 740 states and 951 transitions. Second operand 9 states. [2019-11-23 22:47:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:13,501 INFO L93 Difference]: Finished difference Result 839 states and 1066 transitions. [2019-11-23 22:47:13,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:47:13,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-11-23 22:47:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:13,505 INFO L225 Difference]: With dead ends: 839 [2019-11-23 22:47:13,505 INFO L226 Difference]: Without dead ends: 835 [2019-11-23 22:47:13,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:47:13,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-11-23 22:47:13,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 753. [2019-11-23 22:47:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-11-23 22:47:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 965 transitions. [2019-11-23 22:47:13,543 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 965 transitions. Word has length 70 [2019-11-23 22:47:13,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:13,543 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 965 transitions. [2019-11-23 22:47:13,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:47:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 965 transitions. [2019-11-23 22:47:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 22:47:13,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:13,545 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:13,545 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:13,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:13,545 INFO L82 PathProgramCache]: Analyzing trace with hash -186207479, now seen corresponding path program 1 times [2019-11-23 22:47:13,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:13,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012733730] [2019-11-23 22:47:13,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:18,526 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2019-11-23 22:47:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-23 22:47:18,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012733730] [2019-11-23 22:47:18,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:18,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:47:18,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076180961] [2019-11-23 22:47:18,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:47:18,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:18,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:47:18,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:47:18,597 INFO L87 Difference]: Start difference. First operand 753 states and 965 transitions. Second operand 10 states. [2019-11-23 22:47:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:21,657 INFO L93 Difference]: Finished difference Result 1067 states and 1353 transitions. [2019-11-23 22:47:21,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:47:21,658 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2019-11-23 22:47:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:21,662 INFO L225 Difference]: With dead ends: 1067 [2019-11-23 22:47:21,662 INFO L226 Difference]: Without dead ends: 835 [2019-11-23 22:47:21,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:47:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-11-23 22:47:21,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 753. [2019-11-23 22:47:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-11-23 22:47:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 960 transitions. [2019-11-23 22:47:21,700 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 960 transitions. Word has length 76 [2019-11-23 22:47:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:21,700 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 960 transitions. [2019-11-23 22:47:21,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:47:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 960 transitions. [2019-11-23 22:47:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-23 22:47:21,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:21,702 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:21,702 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:21,702 INFO L82 PathProgramCache]: Analyzing trace with hash 593822933, now seen corresponding path program 1 times [2019-11-23 22:47:21,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:21,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630025883] [2019-11-23 22:47:21,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-23 22:47:26,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630025883] [2019-11-23 22:47:26,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:26,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:47:26,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328510947] [2019-11-23 22:47:26,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:47:26,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:26,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:47:26,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:47:26,030 INFO L87 Difference]: Start difference. First operand 753 states and 960 transitions. Second operand 4 states. [2019-11-23 22:47:26,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:26,123 INFO L93 Difference]: Finished difference Result 1575 states and 1999 transitions. [2019-11-23 22:47:26,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:47:26,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-23 22:47:26,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:26,127 INFO L225 Difference]: With dead ends: 1575 [2019-11-23 22:47:26,127 INFO L226 Difference]: Without dead ends: 849 [2019-11-23 22:47:26,129 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:47:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2019-11-23 22:47:26,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 767. [2019-11-23 22:47:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-11-23 22:47:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 970 transitions. [2019-11-23 22:47:26,164 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 970 transitions. Word has length 82 [2019-11-23 22:47:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:26,165 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 970 transitions. [2019-11-23 22:47:26,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:47:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 970 transitions. [2019-11-23 22:47:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-23 22:47:26,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:26,166 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:26,167 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:26,167 INFO L82 PathProgramCache]: Analyzing trace with hash 946911315, now seen corresponding path program 1 times [2019-11-23 22:47:26,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:26,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67795201] [2019-11-23 22:47:26,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY