java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:05:11,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:05:11,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:05:11,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:05:11,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:05:11,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:05:11,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:05:11,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:05:11,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:05:11,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:05:11,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:05:11,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:05:11,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:05:11,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:05:11,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:05:11,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:05:11,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:05:11,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:05:11,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:05:11,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:05:11,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:05:11,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:05:11,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:05:11,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:05:11,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:05:11,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:05:11,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:05:11,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:05:11,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:05:11,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:05:11,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:05:11,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:05:11,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:05:11,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:05:11,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:05:11,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:05:11,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:05:11,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:05:11,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:05:11,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:05:11,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:05:11,128 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-09-07 13:05:11,142 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:05:11,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:05:11,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:05:11,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:05:11,144 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:05:11,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:05:11,145 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:05:11,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:05:11,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:05:11,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:05:11,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:05:11,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:05:11,146 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:05:11,146 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:05:11,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:05:11,146 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:05:11,147 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:05:11,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:05:11,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:05:11,147 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:05:11,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:05:11,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:05:11,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:05:11,148 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:05:11,148 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:05:11,148 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:05:11,149 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:05:11,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:05:11,149 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:05:11,180 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:05:11,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:05:11,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:05:11,196 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:05:11,197 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:05:11,197 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2019-09-07 13:05:11,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841e8ab5e/cbcad73d1c004c40aef14a0437fb993d/FLAG996459d42 [2019-09-07 13:05:11,709 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:05:11,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2019-09-07 13:05:11,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841e8ab5e/cbcad73d1c004c40aef14a0437fb993d/FLAG996459d42 [2019-09-07 13:05:12,118 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841e8ab5e/cbcad73d1c004c40aef14a0437fb993d [2019-09-07 13:05:12,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:05:12,130 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:05:12,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:05:12,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:05:12,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:05:12,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:05:12" (1/1) ... [2019-09-07 13:05:12,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1feca7eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:12, skipping insertion in model container [2019-09-07 13:05:12,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:05:12" (1/1) ... [2019-09-07 13:05:12,145 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:05:12,167 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:05:12,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:05:12,355 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:05:12,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:05:12,476 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:05:12,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:12 WrapperNode [2019-09-07 13:05:12,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:05:12,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:05:12,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:05:12,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:05:12,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:12" (1/1) ... [2019-09-07 13:05:12,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:12" (1/1) ... [2019-09-07 13:05:12,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:12" (1/1) ... [2019-09-07 13:05:12,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:12" (1/1) ... [2019-09-07 13:05:12,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:12" (1/1) ... [2019-09-07 13:05:12,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:12" (1/1) ... [2019-09-07 13:05:12,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:12" (1/1) ... [2019-09-07 13:05:12,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:05:12,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:05:12,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:05:12,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:05:12,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:12" (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-09-07 13:05:12,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:05:12,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:05:12,555 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:05:12,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:05:12,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:05:12,555 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:05:12,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:05:12,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:05:12,872 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:05:12,872 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:05:12,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:05:12 BoogieIcfgContainer [2019-09-07 13:05:12,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:05:12,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:05:12,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:05:12,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:05:12,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:05:12" (1/3) ... [2019-09-07 13:05:12,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afd9a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:05:12, skipping insertion in model container [2019-09-07 13:05:12,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:12" (2/3) ... [2019-09-07 13:05:12,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afd9a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:05:12, skipping insertion in model container [2019-09-07 13:05:12,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:05:12" (3/3) ... [2019-09-07 13:05:12,888 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-09-07 13:05:12,895 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:05:12,902 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:05:12,914 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:05:12,942 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:05:12,942 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:05:12,942 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:05:12,942 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:05:12,943 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:05:12,943 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:05:12,943 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:05:12,943 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:05:12,943 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:05:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-09-07 13:05:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 13:05:12,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:12,968 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:12,970 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:12,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:12,976 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2019-09-07 13:05:12,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:12,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:13,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:13,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:13,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:13,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:13,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:13,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:13,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:13,156 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-09-07 13:05:13,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:13,225 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2019-09-07 13:05:13,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:13,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-07 13:05:13,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:13,240 INFO L225 Difference]: With dead ends: 75 [2019-09-07 13:05:13,240 INFO L226 Difference]: Without dead ends: 60 [2019-09-07 13:05:13,244 INFO L628 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-09-07 13:05:13,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-07 13:05:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-09-07 13:05:13,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-07 13:05:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-09-07 13:05:13,296 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2019-09-07 13:05:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:13,297 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-09-07 13:05:13,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-09-07 13:05:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 13:05:13,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:13,299 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:13,300 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:13,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:13,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2019-09-07 13:05:13,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:13,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:13,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:13,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:13,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:13,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:13,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:13,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:13,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:13,379 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-09-07 13:05:13,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:13,436 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2019-09-07 13:05:13,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:13,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-07 13:05:13,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:13,439 INFO L225 Difference]: With dead ends: 97 [2019-09-07 13:05:13,440 INFO L226 Difference]: Without dead ends: 60 [2019-09-07 13:05:13,441 INFO L628 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-09-07 13:05:13,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-07 13:05:13,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-09-07 13:05:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-07 13:05:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2019-09-07 13:05:13,464 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2019-09-07 13:05:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:13,467 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2019-09-07 13:05:13,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2019-09-07 13:05:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 13:05:13,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:13,469 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:13,469 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:13,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:13,470 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2019-09-07 13:05:13,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:13,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:13,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:13,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:13,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:13,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:13,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:13,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:13,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:13,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:13,559 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2019-09-07 13:05:13,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:13,595 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2019-09-07 13:05:13,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:13,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-07 13:05:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:13,599 INFO L225 Difference]: With dead ends: 90 [2019-09-07 13:05:13,600 INFO L226 Difference]: Without dead ends: 63 [2019-09-07 13:05:13,602 INFO L628 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-09-07 13:05:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-07 13:05:13,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-09-07 13:05:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-07 13:05:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2019-09-07 13:05:13,618 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2019-09-07 13:05:13,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:13,621 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2019-09-07 13:05:13,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2019-09-07 13:05:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 13:05:13,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:13,622 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:13,623 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:13,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:13,625 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2019-09-07 13:05:13,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:13,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:13,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:13,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:13,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:13,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:13,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:13,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:13,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:13,706 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2019-09-07 13:05:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:13,736 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2019-09-07 13:05:13,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:13,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-07 13:05:13,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:13,738 INFO L225 Difference]: With dead ends: 112 [2019-09-07 13:05:13,738 INFO L226 Difference]: Without dead ends: 110 [2019-09-07 13:05:13,738 INFO L628 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-09-07 13:05:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-07 13:05:13,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2019-09-07 13:05:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-07 13:05:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2019-09-07 13:05:13,755 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2019-09-07 13:05:13,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:13,755 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2019-09-07 13:05:13,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2019-09-07 13:05:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 13:05:13,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:13,758 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:13,759 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:13,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:13,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2019-09-07 13:05:13,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:13,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:13,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:13,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:13,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:13,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:13,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:13,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:13,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:13,810 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2019-09-07 13:05:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:13,845 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2019-09-07 13:05:13,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:13,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-07 13:05:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:13,848 INFO L225 Difference]: With dead ends: 184 [2019-09-07 13:05:13,848 INFO L226 Difference]: Without dead ends: 112 [2019-09-07 13:05:13,849 INFO L628 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-09-07 13:05:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-07 13:05:13,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-09-07 13:05:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-07 13:05:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2019-09-07 13:05:13,859 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2019-09-07 13:05:13,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:13,859 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2019-09-07 13:05:13,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2019-09-07 13:05:13,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 13:05:13,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:13,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:13,861 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:13,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:13,862 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2019-09-07 13:05:13,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:13,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:13,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:13,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:13,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:13,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:13,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:13,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:13,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:13,912 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2019-09-07 13:05:13,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:13,936 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2019-09-07 13:05:13,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:13,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 13:05:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:13,938 INFO L225 Difference]: With dead ends: 165 [2019-09-07 13:05:13,938 INFO L226 Difference]: Without dead ends: 114 [2019-09-07 13:05:13,939 INFO L628 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-09-07 13:05:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-07 13:05:13,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-09-07 13:05:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-07 13:05:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2019-09-07 13:05:13,961 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2019-09-07 13:05:13,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:13,962 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2019-09-07 13:05:13,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:13,965 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2019-09-07 13:05:13,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 13:05:13,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:13,967 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:13,967 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:13,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:13,969 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2019-09-07 13:05:13,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:13,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:13,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:13,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:14,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:14,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:14,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:14,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:14,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:14,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:14,012 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2019-09-07 13:05:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:14,040 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2019-09-07 13:05:14,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:14,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 13:05:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:14,047 INFO L225 Difference]: With dead ends: 204 [2019-09-07 13:05:14,047 INFO L226 Difference]: Without dead ends: 202 [2019-09-07 13:05:14,048 INFO L628 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-09-07 13:05:14,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-07 13:05:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2019-09-07 13:05:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-07 13:05:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2019-09-07 13:05:14,072 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2019-09-07 13:05:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:14,072 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2019-09-07 13:05:14,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2019-09-07 13:05:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 13:05:14,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:14,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:14,076 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:14,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:14,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2019-09-07 13:05:14,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:14,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:14,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:14,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:14,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:14,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:14,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:14,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:14,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:14,123 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2019-09-07 13:05:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:14,145 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2019-09-07 13:05:14,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:14,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 13:05:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:14,148 INFO L225 Difference]: With dead ends: 352 [2019-09-07 13:05:14,148 INFO L226 Difference]: Without dead ends: 210 [2019-09-07 13:05:14,149 INFO L628 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-09-07 13:05:14,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-07 13:05:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2019-09-07 13:05:14,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-07 13:05:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2019-09-07 13:05:14,165 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2019-09-07 13:05:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:14,166 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2019-09-07 13:05:14,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2019-09-07 13:05:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 13:05:14,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:14,168 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:14,168 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:14,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:14,168 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2019-09-07 13:05:14,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:14,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:14,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:14,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:14,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:14,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:14,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:14,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:14,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:14,203 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2019-09-07 13:05:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:14,224 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2019-09-07 13:05:14,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:14,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-07 13:05:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:14,226 INFO L225 Difference]: With dead ends: 312 [2019-09-07 13:05:14,226 INFO L226 Difference]: Without dead ends: 214 [2019-09-07 13:05:14,227 INFO L628 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-09-07 13:05:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-07 13:05:14,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-09-07 13:05:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-07 13:05:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2019-09-07 13:05:14,245 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2019-09-07 13:05:14,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:14,245 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2019-09-07 13:05:14,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:14,245 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2019-09-07 13:05:14,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 13:05:14,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:14,247 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:14,247 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:14,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:14,247 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2019-09-07 13:05:14,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:14,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:14,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:14,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:14,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:14,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:14,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:14,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:14,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:14,293 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2019-09-07 13:05:14,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:14,317 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2019-09-07 13:05:14,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:14,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-07 13:05:14,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:14,321 INFO L225 Difference]: With dead ends: 380 [2019-09-07 13:05:14,321 INFO L226 Difference]: Without dead ends: 378 [2019-09-07 13:05:14,321 INFO L628 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-09-07 13:05:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-07 13:05:14,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2019-09-07 13:05:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-07 13:05:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2019-09-07 13:05:14,333 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2019-09-07 13:05:14,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:14,333 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2019-09-07 13:05:14,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:14,333 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2019-09-07 13:05:14,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 13:05:14,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:14,335 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:05:14,335 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:14,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:14,335 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2019-09-07 13:05:14,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:14,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:14,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:14,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:14,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:14,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:14,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:14,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:14,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:14,358 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2019-09-07 13:05:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:14,383 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2019-09-07 13:05:14,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:14,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-07 13:05:14,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:14,386 INFO L225 Difference]: With dead ends: 684 [2019-09-07 13:05:14,386 INFO L226 Difference]: Without dead ends: 402 [2019-09-07 13:05:14,388 INFO L628 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-09-07 13:05:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-07 13:05:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2019-09-07 13:05:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-07 13:05:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2019-09-07 13:05:14,401 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2019-09-07 13:05:14,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:14,402 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2019-09-07 13:05:14,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2019-09-07 13:05:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 13:05:14,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:14,403 INFO L399 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] [2019-09-07 13:05:14,403 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2019-09-07 13:05:14,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:14,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:14,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:14,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:14,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:14,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:14,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:14,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:14,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:14,422 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2019-09-07 13:05:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:14,439 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2019-09-07 13:05:14,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:14,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-07 13:05:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:14,441 INFO L225 Difference]: With dead ends: 600 [2019-09-07 13:05:14,442 INFO L226 Difference]: Without dead ends: 410 [2019-09-07 13:05:14,442 INFO L628 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-09-07 13:05:14,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-07 13:05:14,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2019-09-07 13:05:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-07 13:05:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2019-09-07 13:05:14,456 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2019-09-07 13:05:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:14,456 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2019-09-07 13:05:14,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2019-09-07 13:05:14,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 13:05:14,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:14,460 INFO L399 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] [2019-09-07 13:05:14,460 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:14,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:14,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2019-09-07 13:05:14,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:14,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:14,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:14,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:14,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:14,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:14,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:14,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:14,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:14,508 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2019-09-07 13:05:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:14,533 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2019-09-07 13:05:14,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:14,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-07 13:05:14,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:14,539 INFO L225 Difference]: With dead ends: 716 [2019-09-07 13:05:14,539 INFO L226 Difference]: Without dead ends: 714 [2019-09-07 13:05:14,540 INFO L628 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-09-07 13:05:14,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-07 13:05:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2019-09-07 13:05:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-07 13:05:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2019-09-07 13:05:14,564 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2019-09-07 13:05:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:14,564 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2019-09-07 13:05:14,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2019-09-07 13:05:14,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 13:05:14,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:14,566 INFO L399 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] [2019-09-07 13:05:14,567 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:14,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:14,567 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2019-09-07 13:05:14,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:14,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:14,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:14,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:14,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:14,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:14,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:14,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:14,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:14,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:14,595 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2019-09-07 13:05:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:14,632 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2019-09-07 13:05:14,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:14,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-07 13:05:14,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:14,637 INFO L225 Difference]: With dead ends: 1340 [2019-09-07 13:05:14,638 INFO L226 Difference]: Without dead ends: 778 [2019-09-07 13:05:14,643 INFO L628 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-09-07 13:05:14,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-07 13:05:14,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2019-09-07 13:05:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-09-07 13:05:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2019-09-07 13:05:14,669 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2019-09-07 13:05:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:14,670 INFO L475 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2019-09-07 13:05:14,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:14,670 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2019-09-07 13:05:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 13:05:14,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:14,672 INFO L399 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] [2019-09-07 13:05:14,672 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:14,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:14,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2019-09-07 13:05:14,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:14,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:14,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:14,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:14,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:14,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:14,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:14,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:14,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:14,697 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2019-09-07 13:05:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:14,721 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2019-09-07 13:05:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:14,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-07 13:05:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:14,725 INFO L225 Difference]: With dead ends: 1164 [2019-09-07 13:05:14,726 INFO L226 Difference]: Without dead ends: 794 [2019-09-07 13:05:14,728 INFO L628 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-09-07 13:05:14,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-09-07 13:05:14,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2019-09-07 13:05:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-09-07 13:05:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2019-09-07 13:05:14,752 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2019-09-07 13:05:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:14,752 INFO L475 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2019-09-07 13:05:14,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2019-09-07 13:05:14,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 13:05:14,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:14,754 INFO L399 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] [2019-09-07 13:05:14,754 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:14,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:14,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2019-09-07 13:05:14,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:14,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:14,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:14,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:14,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:14,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:14,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:14,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:14,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:14,780 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2019-09-07 13:05:14,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:14,814 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2019-09-07 13:05:14,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:14,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-07 13:05:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:14,821 INFO L225 Difference]: With dead ends: 1356 [2019-09-07 13:05:14,821 INFO L226 Difference]: Without dead ends: 1354 [2019-09-07 13:05:14,822 INFO L628 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-09-07 13:05:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-07 13:05:14,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2019-09-07 13:05:14,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-09-07 13:05:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2019-09-07 13:05:14,861 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2019-09-07 13:05:14,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:14,861 INFO L475 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2019-09-07 13:05:14,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2019-09-07 13:05:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 13:05:14,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:14,864 INFO L399 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] [2019-09-07 13:05:14,864 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:14,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:14,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2019-09-07 13:05:14,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:14,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:14,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:14,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:14,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:14,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:14,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:14,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:14,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:14,884 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2019-09-07 13:05:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:14,939 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2019-09-07 13:05:14,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:14,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-07 13:05:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:14,946 INFO L225 Difference]: With dead ends: 2636 [2019-09-07 13:05:14,946 INFO L226 Difference]: Without dead ends: 1514 [2019-09-07 13:05:14,949 INFO L628 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-09-07 13:05:14,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-09-07 13:05:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2019-09-07 13:05:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-09-07 13:05:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2019-09-07 13:05:14,992 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2019-09-07 13:05:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:14,993 INFO L475 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2019-09-07 13:05:14,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2019-09-07 13:05:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 13:05:14,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:14,996 INFO L399 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] [2019-09-07 13:05:14,996 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:14,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:14,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2019-09-07 13:05:14,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:14,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:14,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:14,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:14,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:15,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:15,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:15,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:15,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:15,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:15,016 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2019-09-07 13:05:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:15,052 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2019-09-07 13:05:15,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:15,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-07 13:05:15,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:15,063 INFO L225 Difference]: With dead ends: 2268 [2019-09-07 13:05:15,063 INFO L226 Difference]: Without dead ends: 1546 [2019-09-07 13:05:15,065 INFO L628 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-09-07 13:05:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-09-07 13:05:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2019-09-07 13:05:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-09-07 13:05:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2019-09-07 13:05:15,129 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2019-09-07 13:05:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:15,129 INFO L475 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2019-09-07 13:05:15,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2019-09-07 13:05:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 13:05:15,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:15,133 INFO L399 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] [2019-09-07 13:05:15,133 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:15,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:15,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2019-09-07 13:05:15,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:15,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:15,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:15,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:15,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:15,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:15,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:15,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:15,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:15,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:15,156 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2019-09-07 13:05:15,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:15,233 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2019-09-07 13:05:15,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:15,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-07 13:05:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:15,250 INFO L225 Difference]: With dead ends: 2572 [2019-09-07 13:05:15,250 INFO L226 Difference]: Without dead ends: 2570 [2019-09-07 13:05:15,251 INFO L628 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-09-07 13:05:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2019-09-07 13:05:15,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2019-09-07 13:05:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-09-07 13:05:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2019-09-07 13:05:15,340 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2019-09-07 13:05:15,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:15,340 INFO L475 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2019-09-07 13:05:15,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2019-09-07 13:05:15,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 13:05:15,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:15,345 INFO L399 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] [2019-09-07 13:05:15,345 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:15,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:15,346 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2019-09-07 13:05:15,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:15,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:15,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:15,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:15,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:15,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:15,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:15,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:15,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:15,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:15,367 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2019-09-07 13:05:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:15,452 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2019-09-07 13:05:15,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:15,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-07 13:05:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:15,467 INFO L225 Difference]: With dead ends: 5196 [2019-09-07 13:05:15,467 INFO L226 Difference]: Without dead ends: 2954 [2019-09-07 13:05:15,471 INFO L628 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-09-07 13:05:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-09-07 13:05:15,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2019-09-07 13:05:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-09-07 13:05:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2019-09-07 13:05:15,615 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2019-09-07 13:05:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:15,616 INFO L475 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2019-09-07 13:05:15,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2019-09-07 13:05:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 13:05:15,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:15,620 INFO L399 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] [2019-09-07 13:05:15,620 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:15,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:15,621 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2019-09-07 13:05:15,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:15,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:15,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:15,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:15,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:15,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:15,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:15,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:15,642 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2019-09-07 13:05:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:15,698 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2019-09-07 13:05:15,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:15,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-07 13:05:15,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:15,712 INFO L225 Difference]: With dead ends: 4428 [2019-09-07 13:05:15,712 INFO L226 Difference]: Without dead ends: 3018 [2019-09-07 13:05:15,715 INFO L628 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-09-07 13:05:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2019-09-07 13:05:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2019-09-07 13:05:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-09-07 13:05:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2019-09-07 13:05:15,805 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2019-09-07 13:05:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:15,805 INFO L475 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2019-09-07 13:05:15,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2019-09-07 13:05:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 13:05:15,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:15,810 INFO L399 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] [2019-09-07 13:05:15,810 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:15,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:15,811 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2019-09-07 13:05:15,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:15,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:15,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:15,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:15,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:15,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:15,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:15,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:15,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:15,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:15,844 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2019-09-07 13:05:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:15,943 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2019-09-07 13:05:15,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:15,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-07 13:05:15,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:15,961 INFO L225 Difference]: With dead ends: 8650 [2019-09-07 13:05:15,961 INFO L226 Difference]: Without dead ends: 3016 [2019-09-07 13:05:15,974 INFO L628 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-09-07 13:05:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2019-09-07 13:05:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2019-09-07 13:05:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-09-07 13:05:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2019-09-07 13:05:16,089 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2019-09-07 13:05:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:16,090 INFO L475 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2019-09-07 13:05:16,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2019-09-07 13:05:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 13:05:16,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:05:16,096 INFO L399 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] [2019-09-07 13:05:16,096 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:05:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:05:16,097 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2019-09-07 13:05:16,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:05:16,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:05:16,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:16,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:05:16,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:05:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:05:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:05:16,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:05:16,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:05:16,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:05:16,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:05:16,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:05:16,122 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2019-09-07 13:05:16,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:05:16,189 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2019-09-07 13:05:16,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:05:16,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-07 13:05:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:05:16,191 INFO L225 Difference]: With dead ends: 3016 [2019-09-07 13:05:16,191 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 13:05:16,196 INFO L628 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-09-07 13:05:16,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 13:05:16,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 13:05:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 13:05:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 13:05:16,197 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-09-07 13:05:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:05:16,197 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 13:05:16,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:05:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 13:05:16,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 13:05:16,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 13:05:16,221 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-07 13:05:16,221 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:05:16,221 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:05:16,221 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-07 13:05:16,221 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:05:16,222 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:05:16,222 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-09-07 13:05:16,222 INFO L439 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-09-07 13:05:16,222 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2019-09-07 13:05:16,222 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2019-09-07 13:05:16,222 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-09-07 13:05:16,222 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-09-07 13:05:16,223 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-09-07 13:05:16,223 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-09-07 13:05:16,223 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2019-09-07 13:05:16,223 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-09-07 13:05:16,223 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2019-09-07 13:05:16,223 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-09-07 13:05:16,223 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2019-09-07 13:05:16,223 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-09-07 13:05:16,223 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2019-09-07 13:05:16,224 INFO L443 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2019-09-07 13:05:16,224 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-09-07 13:05:16,224 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2019-09-07 13:05:16,224 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-09-07 13:05:16,224 INFO L446 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-09-07 13:05:16,226 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-09-07 13:05:16,227 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-09-07 13:05:16,227 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-09-07 13:05:16,227 INFO L443 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-09-07 13:05:16,227 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-09-07 13:05:16,227 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-09-07 13:05:16,227 INFO L446 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-09-07 13:05:16,227 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-09-07 13:05:16,228 INFO L443 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2019-09-07 13:05:16,228 INFO L443 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-09-07 13:05:16,228 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-09-07 13:05:16,228 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2019-09-07 13:05:16,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 01:05:16 BoogieIcfgContainer [2019-09-07 13:05:16,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 13:05:16,249 INFO L168 Benchmark]: Toolchain (without parser) took 4112.44 ms. Allocated memory was 134.2 MB in the beginning and 327.7 MB in the end (delta: 193.5 MB). Free memory was 88.8 MB in the beginning and 284.9 MB in the end (delta: -196.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-07 13:05:16,250 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 134.2 MB. Free memory is still 107.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-07 13:05:16,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.10 ms. Allocated memory was 134.2 MB in the beginning and 200.8 MB in the end (delta: 66.6 MB). Free memory was 88.4 MB in the beginning and 178.1 MB in the end (delta: -89.7 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:16,251 INFO L168 Benchmark]: Boogie Preprocessor took 29.66 ms. Allocated memory is still 200.8 MB. Free memory was 178.1 MB in the beginning and 176.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:16,252 INFO L168 Benchmark]: RCFGBuilder took 366.05 ms. Allocated memory is still 200.8 MB. Free memory was 176.0 MB in the beginning and 159.3 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2019-09-07 13:05:16,256 INFO L168 Benchmark]: TraceAbstraction took 3366.28 ms. Allocated memory was 200.8 MB in the beginning and 327.7 MB in the end (delta: 126.9 MB). Free memory was 158.4 MB in the beginning and 284.9 MB in the end (delta: -126.4 MB). Peak memory consumption was 439.0 kB. Max. memory is 7.1 GB. [2019-09-07 13:05:16,265 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 134.2 MB. Free memory is still 107.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 346.10 ms. Allocated memory was 134.2 MB in the beginning and 200.8 MB in the end (delta: 66.6 MB). Free memory was 88.4 MB in the beginning and 178.1 MB in the end (delta: -89.7 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.66 ms. Allocated memory is still 200.8 MB. Free memory was 178.1 MB in the beginning and 176.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 366.05 ms. Allocated memory is still 200.8 MB. Free memory was 176.0 MB in the beginning and 159.3 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3366.28 ms. Allocated memory was 200.8 MB in the beginning and 327.7 MB in the end (delta: 126.9 MB). Free memory was 158.4 MB in the beginning and 284.9 MB in the end (delta: -126.4 MB). Peak memory consumption was 439.0 kB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. SAFE Result, 3.2s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...