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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:14:51,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:14:51,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:14:51,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:14:51,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:14:51,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:14:51,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:14:51,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:14:51,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:14:51,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:14:51,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:14:51,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:14:51,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:14:51,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:14:51,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:14:51,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:14:51,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:14:51,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:14:51,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:14:51,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:14:51,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:14:51,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:14:51,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:14:51,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:14:51,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:14:51,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:14:51,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:14:51,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:14:51,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:14:51,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:14:51,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:14:51,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:14:51,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:14:51,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:14:51,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:14:51,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:14:51,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:14:51,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:14:51,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:14:51,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:14:51,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:14:51,243 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-10-13 19:14:51,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:14:51,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:14:51,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:14:51,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:14:51,264 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:14:51,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:14:51,264 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:14:51,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:14:51,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:14:51,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:14:51,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:14:51,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:14:51,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:14:51,267 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:14:51,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:14:51,267 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:14:51,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:14:51,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:14:51,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:14:51,268 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:14:51,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:14:51,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:14:51,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:14:51,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:14:51,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:14:51,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:14:51,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:14:51,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:14:51,270 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:14:51,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:14:51,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:14:51,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:14:51,585 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:14:51,586 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:14:51,587 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2019-10-13 19:14:51,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4e5e5157/2dd0e64898f447af9850b51763b44cd8/FLAG262749ee5 [2019-10-13 19:14:52,095 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:14:52,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2019-10-13 19:14:52,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4e5e5157/2dd0e64898f447af9850b51763b44cd8/FLAG262749ee5 [2019-10-13 19:14:52,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4e5e5157/2dd0e64898f447af9850b51763b44cd8 [2019-10-13 19:14:52,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:14:52,462 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:14:52,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:52,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:14:52,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:14:52,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404140b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52, skipping insertion in model container [2019-10-13 19:14:52,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,479 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:14:52,502 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:14:52,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:52,713 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:14:52,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:52,753 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:14:52,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52 WrapperNode [2019-10-13 19:14:52,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:52,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:14:52,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:14:52,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:14:52,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (1/1) ... [2019-10-13 19:14:52,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:14:52,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:14:52,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:14:52,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:14:52,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (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-10-13 19:14:52,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:14:52,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:14:52,932 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:14:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:14:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:14:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:14:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:14:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:14:53,184 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:14:53,184 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:14:53,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:53 BoogieIcfgContainer [2019-10-13 19:14:53,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:14:53,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:14:53,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:14:53,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:14:53,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:14:52" (1/3) ... [2019-10-13 19:14:53,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279b0aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:53, skipping insertion in model container [2019-10-13 19:14:53,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:52" (2/3) ... [2019-10-13 19:14:53,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279b0aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:53, skipping insertion in model container [2019-10-13 19:14:53,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:53" (3/3) ... [2019-10-13 19:14:53,196 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-10-13 19:14:53,216 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:14:53,248 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:14:53,277 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:14:53,333 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:14:53,333 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:14:53,334 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:14:53,334 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:14:53,334 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:14:53,334 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:14:53,334 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:14:53,335 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:14:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-13 19:14:53,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:14:53,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,358 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,360 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2019-10-13 19:14:53,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821544454] [2019-10-13 19:14:53,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821544454] [2019-10-13 19:14:53,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859208353] [2019-10-13 19:14:53,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,557 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-10-13 19:14:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,616 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2019-10-13 19:14:53,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 19:14:53,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,631 INFO L225 Difference]: With dead ends: 69 [2019-10-13 19:14:53,632 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 19:14:53,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 19:14:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-10-13 19:14:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 19:14:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2019-10-13 19:14:53,689 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2019-10-13 19:14:53,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,689 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2019-10-13 19:14:53,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2019-10-13 19:14:53,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:14:53,691 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,691 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,692 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2019-10-13 19:14:53,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949101500] [2019-10-13 19:14:53,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949101500] [2019-10-13 19:14:53,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771583] [2019-10-13 19:14:53,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,806 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2019-10-13 19:14:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,856 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2019-10-13 19:14:53,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 19:14:53,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,860 INFO L225 Difference]: With dead ends: 87 [2019-10-13 19:14:53,860 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 19:14:53,863 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 19:14:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-10-13 19:14:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 19:14:53,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2019-10-13 19:14:53,884 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2019-10-13 19:14:53,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,884 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2019-10-13 19:14:53,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2019-10-13 19:14:53,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:14:53,888 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,889 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:53,889 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,890 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2019-10-13 19:14:53,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360608575] [2019-10-13 19:14:53,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360608575] [2019-10-13 19:14:53,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681519222] [2019-10-13 19:14:53,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,976 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2019-10-13 19:14:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,010 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2019-10-13 19:14:54,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 19:14:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,013 INFO L225 Difference]: With dead ends: 81 [2019-10-13 19:14:54,013 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 19:14:54,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 19:14:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-13 19:14:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-13 19:14:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2019-10-13 19:14:54,029 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2019-10-13 19:14:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,029 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2019-10-13 19:14:54,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2019-10-13 19:14:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:14:54,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,033 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,034 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2019-10-13 19:14:54,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020899960] [2019-10-13 19:14:54,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020899960] [2019-10-13 19:14:54,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431829990] [2019-10-13 19:14:54,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,097 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2019-10-13 19:14:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,117 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2019-10-13 19:14:54,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 19:14:54,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,120 INFO L225 Difference]: With dead ends: 100 [2019-10-13 19:14:54,120 INFO L226 Difference]: Without dead ends: 98 [2019-10-13 19:14:54,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-13 19:14:54,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2019-10-13 19:14:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 19:14:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2019-10-13 19:14:54,134 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2019-10-13 19:14:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,134 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2019-10-13 19:14:54,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2019-10-13 19:14:54,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:14:54,136 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,136 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,137 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,137 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2019-10-13 19:14:54,137 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992002150] [2019-10-13 19:14:54,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992002150] [2019-10-13 19:14:54,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128214378] [2019-10-13 19:14:54,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,182 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2019-10-13 19:14:54,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,215 INFO L93 Difference]: Finished difference Result 164 states and 278 transitions. [2019-10-13 19:14:54,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 19:14:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,217 INFO L225 Difference]: With dead ends: 164 [2019-10-13 19:14:54,217 INFO L226 Difference]: Without dead ends: 100 [2019-10-13 19:14:54,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-13 19:14:54,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-10-13 19:14:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-13 19:14:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2019-10-13 19:14:54,229 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2019-10-13 19:14:54,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,229 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2019-10-13 19:14:54,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,229 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2019-10-13 19:14:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:14:54,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,230 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,231 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2019-10-13 19:14:54,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538364264] [2019-10-13 19:14:54,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538364264] [2019-10-13 19:14:54,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232088690] [2019-10-13 19:14:54,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,278 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2019-10-13 19:14:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,307 INFO L93 Difference]: Finished difference Result 147 states and 241 transitions. [2019-10-13 19:14:54,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 19:14:54,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,309 INFO L225 Difference]: With dead ends: 147 [2019-10-13 19:14:54,309 INFO L226 Difference]: Without dead ends: 102 [2019-10-13 19:14:54,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-13 19:14:54,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-10-13 19:14:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-13 19:14:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2019-10-13 19:14:54,326 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2019-10-13 19:14:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,326 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2019-10-13 19:14:54,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2019-10-13 19:14:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:14:54,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,328 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,329 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2019-10-13 19:14:54,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409973932] [2019-10-13 19:14:54,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409973932] [2019-10-13 19:14:54,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324508965] [2019-10-13 19:14:54,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,369 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2019-10-13 19:14:54,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,391 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2019-10-13 19:14:54,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 19:14:54,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,394 INFO L225 Difference]: With dead ends: 180 [2019-10-13 19:14:54,394 INFO L226 Difference]: Without dead ends: 178 [2019-10-13 19:14:54,394 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-13 19:14:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2019-10-13 19:14:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-13 19:14:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2019-10-13 19:14:54,406 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2019-10-13 19:14:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,406 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2019-10-13 19:14:54,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2019-10-13 19:14:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:14:54,408 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,408 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,409 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2019-10-13 19:14:54,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83262358] [2019-10-13 19:14:54,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83262358] [2019-10-13 19:14:54,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577466194] [2019-10-13 19:14:54,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,448 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2019-10-13 19:14:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,490 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2019-10-13 19:14:54,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-13 19:14:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,492 INFO L225 Difference]: With dead ends: 312 [2019-10-13 19:14:54,493 INFO L226 Difference]: Without dead ends: 186 [2019-10-13 19:14:54,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-13 19:14:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-10-13 19:14:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-13 19:14:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2019-10-13 19:14:54,506 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2019-10-13 19:14:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,507 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2019-10-13 19:14:54,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2019-10-13 19:14:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:14:54,509 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,509 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,509 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2019-10-13 19:14:54,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724096063] [2019-10-13 19:14:54,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724096063] [2019-10-13 19:14:54,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832524485] [2019-10-13 19:14:54,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,538 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2019-10-13 19:14:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,563 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2019-10-13 19:14:54,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 19:14:54,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,565 INFO L225 Difference]: With dead ends: 276 [2019-10-13 19:14:54,566 INFO L226 Difference]: Without dead ends: 190 [2019-10-13 19:14:54,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-13 19:14:54,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2019-10-13 19:14:54,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-13 19:14:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2019-10-13 19:14:54,584 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2019-10-13 19:14:54,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,586 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2019-10-13 19:14:54,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,586 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2019-10-13 19:14:54,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:14:54,588 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,588 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,588 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2019-10-13 19:14:54,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263168734] [2019-10-13 19:14:54,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263168734] [2019-10-13 19:14:54,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772213944] [2019-10-13 19:14:54,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,620 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2019-10-13 19:14:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,640 INFO L93 Difference]: Finished difference Result 332 states and 520 transitions. [2019-10-13 19:14:54,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 19:14:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,646 INFO L225 Difference]: With dead ends: 332 [2019-10-13 19:14:54,646 INFO L226 Difference]: Without dead ends: 330 [2019-10-13 19:14:54,647 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-10-13 19:14:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2019-10-13 19:14:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-13 19:14:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2019-10-13 19:14:54,658 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2019-10-13 19:14:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,658 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2019-10-13 19:14:54,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2019-10-13 19:14:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:14:54,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,660 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,661 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2019-10-13 19:14:54,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759433515] [2019-10-13 19:14:54,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759433515] [2019-10-13 19:14:54,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103397289] [2019-10-13 19:14:54,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,691 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2019-10-13 19:14:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,716 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2019-10-13 19:14:54,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 19:14:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,718 INFO L225 Difference]: With dead ends: 604 [2019-10-13 19:14:54,719 INFO L226 Difference]: Without dead ends: 354 [2019-10-13 19:14:54,720 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-13 19:14:54,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-10-13 19:14:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-13 19:14:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2019-10-13 19:14:54,734 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2019-10-13 19:14:54,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,734 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2019-10-13 19:14:54,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2019-10-13 19:14:54,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:54,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,736 INFO L380 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-10-13 19:14:54,736 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2019-10-13 19:14:54,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024447311] [2019-10-13 19:14:54,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024447311] [2019-10-13 19:14:54,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711314278] [2019-10-13 19:14:54,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,761 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2019-10-13 19:14:54,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,787 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2019-10-13 19:14:54,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,789 INFO L225 Difference]: With dead ends: 528 [2019-10-13 19:14:54,789 INFO L226 Difference]: Without dead ends: 362 [2019-10-13 19:14:54,790 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-10-13 19:14:54,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-10-13 19:14:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-13 19:14:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2019-10-13 19:14:54,803 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2019-10-13 19:14:54,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,803 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2019-10-13 19:14:54,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2019-10-13 19:14:54,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:54,805 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,805 INFO L380 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-10-13 19:14:54,805 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2019-10-13 19:14:54,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522445294] [2019-10-13 19:14:54,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522445294] [2019-10-13 19:14:54,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314462806] [2019-10-13 19:14:54,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,840 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2019-10-13 19:14:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,873 INFO L93 Difference]: Finished difference Result 620 states and 904 transitions. [2019-10-13 19:14:54,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,878 INFO L225 Difference]: With dead ends: 620 [2019-10-13 19:14:54,878 INFO L226 Difference]: Without dead ends: 618 [2019-10-13 19:14:54,879 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-13 19:14:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2019-10-13 19:14:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-10-13 19:14:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2019-10-13 19:14:54,900 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2019-10-13 19:14:54,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,901 INFO L462 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2019-10-13 19:14:54,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2019-10-13 19:14:54,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:14:54,903 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,904 INFO L380 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-10-13 19:14:54,904 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2019-10-13 19:14:54,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685730792] [2019-10-13 19:14:54,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:54,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685730792] [2019-10-13 19:14:54,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709614400] [2019-10-13 19:14:54,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,939 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2019-10-13 19:14:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,969 INFO L93 Difference]: Finished difference Result 1180 states and 1640 transitions. [2019-10-13 19:14:54,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 19:14:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,974 INFO L225 Difference]: With dead ends: 1180 [2019-10-13 19:14:54,974 INFO L226 Difference]: Without dead ends: 682 [2019-10-13 19:14:54,975 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-10-13 19:14:54,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-10-13 19:14:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-10-13 19:14:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2019-10-13 19:14:55,001 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2019-10-13 19:14:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,001 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2019-10-13 19:14:55,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2019-10-13 19:14:55,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:55,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,003 INFO L380 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-10-13 19:14:55,004 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,004 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2019-10-13 19:14:55,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991079539] [2019-10-13 19:14:55,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:55,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991079539] [2019-10-13 19:14:55,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778743323] [2019-10-13 19:14:55,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,026 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2019-10-13 19:14:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,052 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2019-10-13 19:14:55,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,056 INFO L225 Difference]: With dead ends: 1020 [2019-10-13 19:14:55,056 INFO L226 Difference]: Without dead ends: 698 [2019-10-13 19:14:55,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:55,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-10-13 19:14:55,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-10-13 19:14:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-10-13 19:14:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2019-10-13 19:14:55,079 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2019-10-13 19:14:55,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,080 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2019-10-13 19:14:55,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,080 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2019-10-13 19:14:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:55,082 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,082 INFO L380 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-10-13 19:14:55,082 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,083 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2019-10-13 19:14:55,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750635945] [2019-10-13 19:14:55,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:55,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750635945] [2019-10-13 19:14:55,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828948167] [2019-10-13 19:14:55,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,107 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2019-10-13 19:14:55,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,139 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2019-10-13 19:14:55,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,145 INFO L225 Difference]: With dead ends: 1164 [2019-10-13 19:14:55,146 INFO L226 Difference]: Without dead ends: 1162 [2019-10-13 19:14:55,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-10-13 19:14:55,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2019-10-13 19:14:55,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-10-13 19:14:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2019-10-13 19:14:55,182 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2019-10-13 19:14:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,183 INFO L462 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2019-10-13 19:14:55,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2019-10-13 19:14:55,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:55,185 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,186 INFO L380 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-10-13 19:14:55,186 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,186 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2019-10-13 19:14:55,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274764324] [2019-10-13 19:14:55,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:55,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274764324] [2019-10-13 19:14:55,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130912006] [2019-10-13 19:14:55,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,208 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2019-10-13 19:14:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,262 INFO L93 Difference]: Finished difference Result 2316 states and 2920 transitions. [2019-10-13 19:14:55,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,268 INFO L225 Difference]: With dead ends: 2316 [2019-10-13 19:14:55,268 INFO L226 Difference]: Without dead ends: 1322 [2019-10-13 19:14:55,271 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-10-13 19:14:55,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2019-10-13 19:14:55,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-10-13 19:14:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2019-10-13 19:14:55,312 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2019-10-13 19:14:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,312 INFO L462 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2019-10-13 19:14:55,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2019-10-13 19:14:55,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:55,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,315 INFO L380 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-10-13 19:14:55,315 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,316 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2019-10-13 19:14:55,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656578174] [2019-10-13 19:14:55,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:55,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656578174] [2019-10-13 19:14:55,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740579532] [2019-10-13 19:14:55,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,340 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2019-10-13 19:14:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,387 INFO L93 Difference]: Finished difference Result 1980 states and 2392 transitions. [2019-10-13 19:14:55,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,396 INFO L225 Difference]: With dead ends: 1980 [2019-10-13 19:14:55,396 INFO L226 Difference]: Without dead ends: 1354 [2019-10-13 19:14:55,398 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-10-13 19:14:55,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-10-13 19:14:55,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-10-13 19:14:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2019-10-13 19:14:55,444 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2019-10-13 19:14:55,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,444 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2019-10-13 19:14:55,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2019-10-13 19:14:55,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:55,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,447 INFO L380 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-10-13 19:14:55,447 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2019-10-13 19:14:55,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800999193] [2019-10-13 19:14:55,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:55,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800999193] [2019-10-13 19:14:55,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495529956] [2019-10-13 19:14:55,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,469 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2019-10-13 19:14:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,517 INFO L93 Difference]: Finished difference Result 2186 states and 2567 transitions. [2019-10-13 19:14:55,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,527 INFO L225 Difference]: With dead ends: 2186 [2019-10-13 19:14:55,528 INFO L226 Difference]: Without dead ends: 2184 [2019-10-13 19:14:55,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-10-13 19:14:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2019-10-13 19:14:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-10-13 19:14:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2019-10-13 19:14:55,592 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2019-10-13 19:14:55,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,593 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2019-10-13 19:14:55,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2019-10-13 19:14:55,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:55,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,597 INFO L380 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-10-13 19:14:55,597 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2019-10-13 19:14:55,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790751092] [2019-10-13 19:14:55,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:55,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790751092] [2019-10-13 19:14:55,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738561040] [2019-10-13 19:14:55,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,618 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2019-10-13 19:14:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,683 INFO L93 Difference]: Finished difference Result 4552 states and 5126 transitions. [2019-10-13 19:14:55,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:55,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,684 INFO L225 Difference]: With dead ends: 4552 [2019-10-13 19:14:55,684 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:14:55,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-13 19:14:55,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:14:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:14:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:14:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:14:55,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-10-13 19:14:55,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,693 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:14:55,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:14:55,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:14:55,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:14:55,717 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 19:14:55,717 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:55,717 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:55,717 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:14:55,717 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:14:55,717 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:14:55,718 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2019-10-13 19:14:55,718 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-10-13 19:14:55,718 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 19:14:55,718 INFO L446 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2019-10-13 19:14:55,718 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-10-13 19:14:55,718 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-13 19:14:55,718 INFO L439 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2019-10-13 19:14:55,719 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2019-10-13 19:14:55,719 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 19:14:55,719 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 19:14:55,719 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 19:14:55,719 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2019-10-13 19:14:55,719 INFO L443 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 19:14:55,719 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-13 19:14:55,719 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 19:14:55,720 INFO L443 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 19:14:55,720 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2019-10-13 19:14:55,720 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-10-13 19:14:55,720 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-13 19:14:55,720 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-10-13 19:14:55,720 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 19:14:55,720 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 19:14:55,721 INFO L443 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 19:14:55,721 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-10-13 19:14:55,721 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 19:14:55,721 INFO L446 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2019-10-13 19:14:55,721 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-10-13 19:14:55,721 INFO L443 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2019-10-13 19:14:55,721 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2019-10-13 19:14:55,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:14:55 BoogieIcfgContainer [2019-10-13 19:14:55,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:14:55,733 INFO L168 Benchmark]: Toolchain (without parser) took 3269.98 ms. Allocated memory was 138.4 MB in the beginning and 245.4 MB in the end (delta: 107.0 MB). Free memory was 103.4 MB in the beginning and 105.2 MB in the end (delta: -1.7 MB). Peak memory consumption was 105.2 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:55,734 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 19:14:55,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.21 ms. Allocated memory is still 138.4 MB. Free memory was 103.0 MB in the beginning and 92.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:55,735 INFO L168 Benchmark]: Boogie Preprocessor took 122.01 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 92.9 MB in the beginning and 180.1 MB in the end (delta: -87.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:55,736 INFO L168 Benchmark]: RCFGBuilder took 307.69 ms. Allocated memory is still 201.9 MB. Free memory was 180.1 MB in the beginning and 163.5 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:55,737 INFO L168 Benchmark]: TraceAbstraction took 2543.47 ms. Allocated memory was 201.9 MB in the beginning and 245.4 MB in the end (delta: 43.5 MB). Free memory was 163.5 MB in the beginning and 105.2 MB in the end (delta: 58.4 MB). Peak memory consumption was 101.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:55,743 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.21 ms. Allocated memory is still 138.4 MB. Free memory was 103.0 MB in the beginning and 92.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.01 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 92.9 MB in the beginning and 180.1 MB in the end (delta: -87.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 307.69 ms. Allocated memory is still 201.9 MB. Free memory was 180.1 MB in the beginning and 163.5 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2543.47 ms. Allocated memory was 201.9 MB in the beginning and 245.4 MB in the end (delta: 43.5 MB). Free memory was 163.5 MB in the beginning and 105.2 MB in the end (delta: 58.4 MB). Peak memory consumption was 101.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: 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, 35 locations, 1 error locations. Result: SAFE, OverallTime: 2.3s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...