java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:00:23,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:00:23,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:00:23,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:00:23,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:00:23,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:00:23,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:00:23,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:00:23,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:00:23,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:00:23,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:00:23,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:00:23,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:00:23,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:00:23,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:00:23,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:00:23,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:00:23,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:00:23,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:00:23,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:00:23,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:00:23,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:00:23,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:00:23,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:00:23,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:00:23,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:00:23,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:00:23,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:00:23,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:00:23,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:00:23,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:00:23,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:00:23,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:00:23,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:00:23,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:00:23,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:00:23,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:00:23,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:00:23,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:00:23,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:00:23,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:00:23,333 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 13:00:23,354 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:00:23,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:00:23,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:00:23,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:00:23,360 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:00:23,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:00:23,362 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:00:23,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:00:23,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:00:23,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:00:23,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:00:23,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:00:23,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:00:23,365 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:00:23,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:00:23,366 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:00:23,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:00:23,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:00:23,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:00:23,366 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:00:23,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:00:23,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:00:23,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:00:23,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:00:23,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:00:23,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:00:23,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:00:23,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:00:23,369 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:00:23,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:00:23,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:00:23,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:00:23,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:00:23,437 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:00:23,437 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2019-09-20 13:00:23,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b15a11cc/e2850d3ad5e145289ac37d1ee760002f/FLAG989d733ed [2019-09-20 13:00:23,913 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:00:23,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2019-09-20 13:00:23,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b15a11cc/e2850d3ad5e145289ac37d1ee760002f/FLAG989d733ed [2019-09-20 13:00:24,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b15a11cc/e2850d3ad5e145289ac37d1ee760002f [2019-09-20 13:00:24,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:00:24,368 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:00:24,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:24,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:00:24,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:00:24,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec8f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24, skipping insertion in model container [2019-09-20 13:00:24,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,385 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:00:24,409 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:00:24,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:24,651 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:00:24,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:24,773 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:00:24,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24 WrapperNode [2019-09-20 13:00:24,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:24,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:00:24,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:00:24,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:00:24,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... [2019-09-20 13:00:24,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:00:24,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:00:24,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:00:24,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:00:24,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:00:24,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:00:24,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:00:24,878 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:00:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:00:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:00:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:00:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:00:24,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:00:25,229 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:00:25,229 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:00:25,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:25 BoogieIcfgContainer [2019-09-20 13:00:25,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:00:25,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:00:25,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:00:25,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:00:25,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:00:24" (1/3) ... [2019-09-20 13:00:25,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19831bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:25, skipping insertion in model container [2019-09-20 13:00:25,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:24" (2/3) ... [2019-09-20 13:00:25,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19831bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:25, skipping insertion in model container [2019-09-20 13:00:25,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:25" (3/3) ... [2019-09-20 13:00:25,240 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-09-20 13:00:25,249 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:00:25,255 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:00:25,269 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:00:25,300 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:00:25,301 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:00:25,301 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:00:25,301 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:00:25,302 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:00:25,302 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:00:25,302 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:00:25,302 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:00:25,303 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:00:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-09-20 13:00:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:00:25,329 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,331 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,333 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,339 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2019-09-20 13:00:25,341 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:25,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:25,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:25,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:25,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:25,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,534 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-09-20 13:00:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:25,613 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2019-09-20 13:00:25,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:25,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:00:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:25,632 INFO L225 Difference]: With dead ends: 75 [2019-09-20 13:00:25,633 INFO L226 Difference]: Without dead ends: 60 [2019-09-20 13:00:25,641 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-20 13:00:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-09-20 13:00:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-20 13:00:25,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-09-20 13:00:25,710 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2019-09-20 13:00:25,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,711 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-09-20 13:00:25,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-09-20 13:00:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:00:25,713 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,714 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,714 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2019-09-20 13:00:25,717 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:25,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:25,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:25,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:25,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:25,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,806 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-09-20 13:00:25,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:25,850 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2019-09-20 13:00:25,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:25,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:00:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:25,855 INFO L225 Difference]: With dead ends: 97 [2019-09-20 13:00:25,855 INFO L226 Difference]: Without dead ends: 60 [2019-09-20 13:00:25,857 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-20 13:00:25,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-09-20 13:00:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-20 13:00:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2019-09-20 13:00:25,878 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2019-09-20 13:00:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,879 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2019-09-20 13:00:25,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,880 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2019-09-20 13:00:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:00:25,881 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,881 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,881 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,882 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2019-09-20 13:00:25,882 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:25,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:25,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:25,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:25,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:25,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,927 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2019-09-20 13:00:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:25,952 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2019-09-20 13:00:25,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:25,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:00:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:25,954 INFO L225 Difference]: With dead ends: 90 [2019-09-20 13:00:25,955 INFO L226 Difference]: Without dead ends: 63 [2019-09-20 13:00:25,955 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-20 13:00:25,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-09-20 13:00:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-20 13:00:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2019-09-20 13:00:25,964 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2019-09-20 13:00:25,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,965 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2019-09-20 13:00:25,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2019-09-20 13:00:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:00:25,966 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,967 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:25,967 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2019-09-20 13:00:25,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,011 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2019-09-20 13:00:26,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,040 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2019-09-20 13:00:26,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:00:26,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,043 INFO L225 Difference]: With dead ends: 112 [2019-09-20 13:00:26,043 INFO L226 Difference]: Without dead ends: 110 [2019-09-20 13:00:26,043 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-20 13:00:26,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2019-09-20 13:00:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-20 13:00:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2019-09-20 13:00:26,054 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2019-09-20 13:00:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,055 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2019-09-20 13:00:26,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2019-09-20 13:00:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:00:26,056 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,056 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,057 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2019-09-20 13:00:26,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,099 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2019-09-20 13:00:26,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,122 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2019-09-20 13:00:26,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:00:26,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,127 INFO L225 Difference]: With dead ends: 184 [2019-09-20 13:00:26,127 INFO L226 Difference]: Without dead ends: 112 [2019-09-20 13:00:26,128 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-20 13:00:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-09-20 13:00:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-20 13:00:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2019-09-20 13:00:26,140 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2019-09-20 13:00:26,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,141 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2019-09-20 13:00:26,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2019-09-20 13:00:26,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:00:26,143 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,143 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,143 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,144 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2019-09-20 13:00:26,144 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,199 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2019-09-20 13:00:26,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,227 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2019-09-20 13:00:26,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:00:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,229 INFO L225 Difference]: With dead ends: 165 [2019-09-20 13:00:26,229 INFO L226 Difference]: Without dead ends: 114 [2019-09-20 13:00:26,230 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-20 13:00:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-09-20 13:00:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-20 13:00:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2019-09-20 13:00:26,241 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2019-09-20 13:00:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,242 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2019-09-20 13:00:26,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2019-09-20 13:00:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:00:26,243 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,244 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,244 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,245 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2019-09-20 13:00:26,245 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,307 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2019-09-20 13:00:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,332 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2019-09-20 13:00:26,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:00:26,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,334 INFO L225 Difference]: With dead ends: 204 [2019-09-20 13:00:26,335 INFO L226 Difference]: Without dead ends: 202 [2019-09-20 13:00:26,335 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-20 13:00:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2019-09-20 13:00:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-20 13:00:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2019-09-20 13:00:26,348 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2019-09-20 13:00:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,349 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2019-09-20 13:00:26,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2019-09-20 13:00:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:00:26,353 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,353 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,353 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2019-09-20 13:00:26,354 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,413 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2019-09-20 13:00:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,451 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2019-09-20 13:00:26,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:00:26,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,454 INFO L225 Difference]: With dead ends: 352 [2019-09-20 13:00:26,454 INFO L226 Difference]: Without dead ends: 210 [2019-09-20 13:00:26,455 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-20 13:00:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2019-09-20 13:00:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-20 13:00:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2019-09-20 13:00:26,468 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2019-09-20 13:00:26,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,469 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2019-09-20 13:00:26,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2019-09-20 13:00:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:26,481 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,481 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,481 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,482 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2019-09-20 13:00:26,482 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,520 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2019-09-20 13:00:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,548 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2019-09-20 13:00:26,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,551 INFO L225 Difference]: With dead ends: 312 [2019-09-20 13:00:26,551 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:00:26,552 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:00:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-09-20 13:00:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-20 13:00:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2019-09-20 13:00:26,563 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2019-09-20 13:00:26,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,563 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2019-09-20 13:00:26,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,563 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2019-09-20 13:00:26,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:26,565 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,565 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,565 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,566 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2019-09-20 13:00:26,566 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,600 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2019-09-20 13:00:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,627 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2019-09-20 13:00:26,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:26,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,633 INFO L225 Difference]: With dead ends: 380 [2019-09-20 13:00:26,633 INFO L226 Difference]: Without dead ends: 378 [2019-09-20 13:00:26,634 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-20 13:00:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2019-09-20 13:00:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-20 13:00:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2019-09-20 13:00:26,650 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2019-09-20 13:00:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,651 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2019-09-20 13:00:26,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2019-09-20 13:00:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:26,654 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,657 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,658 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,659 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2019-09-20 13:00:26,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,700 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2019-09-20 13:00:26,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,729 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2019-09-20 13:00:26,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:00:26,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,733 INFO L225 Difference]: With dead ends: 684 [2019-09-20 13:00:26,733 INFO L226 Difference]: Without dead ends: 402 [2019-09-20 13:00:26,734 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-20 13:00:26,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2019-09-20 13:00:26,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-20 13:00:26,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2019-09-20 13:00:26,749 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2019-09-20 13:00:26,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,750 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2019-09-20 13:00:26,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,750 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2019-09-20 13:00:26,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:00:26,751 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,751 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,752 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2019-09-20 13:00:26,752 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,783 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2019-09-20 13:00:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,808 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2019-09-20 13:00:26,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:00:26,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,811 INFO L225 Difference]: With dead ends: 600 [2019-09-20 13:00:26,812 INFO L226 Difference]: Without dead ends: 410 [2019-09-20 13:00:26,813 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-20 13:00:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2019-09-20 13:00:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-20 13:00:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2019-09-20 13:00:26,832 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2019-09-20 13:00:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,834 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2019-09-20 13:00:26,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2019-09-20 13:00:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:00:26,836 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,836 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,836 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2019-09-20 13:00:26,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,878 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2019-09-20 13:00:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,901 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2019-09-20 13:00:26,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:00:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,906 INFO L225 Difference]: With dead ends: 716 [2019-09-20 13:00:26,906 INFO L226 Difference]: Without dead ends: 714 [2019-09-20 13:00:26,906 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-20 13:00:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2019-09-20 13:00:26,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-20 13:00:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2019-09-20 13:00:26,925 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2019-09-20 13:00:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,925 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2019-09-20 13:00:26,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2019-09-20 13:00:26,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:00:26,927 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,927 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:26,927 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,927 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2019-09-20 13:00:26,928 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:26,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,947 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2019-09-20 13:00:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:26,982 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2019-09-20 13:00:26,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:26,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:00:26,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:26,991 INFO L225 Difference]: With dead ends: 1340 [2019-09-20 13:00:26,992 INFO L226 Difference]: Without dead ends: 778 [2019-09-20 13:00:26,994 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-20 13:00:27,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2019-09-20 13:00:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-09-20 13:00:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2019-09-20 13:00:27,021 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2019-09-20 13:00:27,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,022 INFO L475 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2019-09-20 13:00:27,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2019-09-20 13:00:27,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:27,024 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,024 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,024 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2019-09-20 13:00:27,025 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:27,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,056 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2019-09-20 13:00:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,081 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2019-09-20 13:00:27,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,085 INFO L225 Difference]: With dead ends: 1164 [2019-09-20 13:00:27,085 INFO L226 Difference]: Without dead ends: 794 [2019-09-20 13:00:27,088 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-09-20 13:00:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2019-09-20 13:00:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-09-20 13:00:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2019-09-20 13:00:27,116 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2019-09-20 13:00:27,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,116 INFO L475 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2019-09-20 13:00:27,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,116 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2019-09-20 13:00:27,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:27,118 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,118 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,118 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2019-09-20 13:00:27,119 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:27,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,153 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2019-09-20 13:00:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,190 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2019-09-20 13:00:27,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,197 INFO L225 Difference]: With dead ends: 1356 [2019-09-20 13:00:27,198 INFO L226 Difference]: Without dead ends: 1354 [2019-09-20 13:00:27,199 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-20 13:00:27,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2019-09-20 13:00:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-09-20 13:00:27,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2019-09-20 13:00:27,241 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2019-09-20 13:00:27,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,241 INFO L475 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2019-09-20 13:00:27,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2019-09-20 13:00:27,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:27,245 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,245 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,245 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2019-09-20 13:00:27,246 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:27,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,270 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2019-09-20 13:00:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,329 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2019-09-20 13:00:27,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:27,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,336 INFO L225 Difference]: With dead ends: 2636 [2019-09-20 13:00:27,337 INFO L226 Difference]: Without dead ends: 1514 [2019-09-20 13:00:27,339 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-09-20 13:00:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2019-09-20 13:00:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-09-20 13:00:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2019-09-20 13:00:27,386 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2019-09-20 13:00:27,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,386 INFO L475 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2019-09-20 13:00:27,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2019-09-20 13:00:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:27,388 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,389 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,389 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2019-09-20 13:00:27,389 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:27,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,406 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2019-09-20 13:00:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,442 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2019-09-20 13:00:27,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,449 INFO L225 Difference]: With dead ends: 2268 [2019-09-20 13:00:27,449 INFO L226 Difference]: Without dead ends: 1546 [2019-09-20 13:00:27,451 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-09-20 13:00:27,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2019-09-20 13:00:27,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-09-20 13:00:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2019-09-20 13:00:27,498 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2019-09-20 13:00:27,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,498 INFO L475 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2019-09-20 13:00:27,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2019-09-20 13:00:27,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:27,500 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,501 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,501 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2019-09-20 13:00:27,501 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:27,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,517 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2019-09-20 13:00:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,569 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2019-09-20 13:00:27,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:27,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,585 INFO L225 Difference]: With dead ends: 2572 [2019-09-20 13:00:27,585 INFO L226 Difference]: Without dead ends: 2570 [2019-09-20 13:00:27,587 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2019-09-20 13:00:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2019-09-20 13:00:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-09-20 13:00:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2019-09-20 13:00:27,689 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2019-09-20 13:00:27,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:27,690 INFO L475 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2019-09-20 13:00:27,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2019-09-20 13:00:27,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:27,695 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:27,696 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:27,696 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:27,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:27,697 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2019-09-20 13:00:27,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:27,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:27,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:27,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:27,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:27,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:27,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:27,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:27,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,721 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2019-09-20 13:00:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,834 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2019-09-20 13:00:27,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:27,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,851 INFO L225 Difference]: With dead ends: 5196 [2019-09-20 13:00:27,851 INFO L226 Difference]: Without dead ends: 2954 [2019-09-20 13:00:27,856 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-09-20 13:00:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2019-09-20 13:00:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-09-20 13:00:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2019-09-20 13:00:28,005 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2019-09-20 13:00:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:28,006 INFO L475 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2019-09-20 13:00:28,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2019-09-20 13:00:28,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:28,012 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:28,013 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:28,013 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:28,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:28,013 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2019-09-20 13:00:28,013 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:28,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:28,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:28,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:28,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:28,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:28,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:28,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:28,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,036 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2019-09-20 13:00:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:28,097 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2019-09-20 13:00:28,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:28,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:28,110 INFO L225 Difference]: With dead ends: 4428 [2019-09-20 13:00:28,111 INFO L226 Difference]: Without dead ends: 3018 [2019-09-20 13:00:28,114 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2019-09-20 13:00:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2019-09-20 13:00:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-09-20 13:00:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2019-09-20 13:00:28,207 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2019-09-20 13:00:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:28,207 INFO L475 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2019-09-20 13:00:28,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2019-09-20 13:00:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:28,211 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:28,211 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:28,212 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:28,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:28,212 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2019-09-20 13:00:28,212 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:28,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:28,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:28,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:28,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:28,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:28,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:28,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:28,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,233 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2019-09-20 13:00:28,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:28,360 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2019-09-20 13:00:28,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:28,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:28,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:28,378 INFO L225 Difference]: With dead ends: 8650 [2019-09-20 13:00:28,378 INFO L226 Difference]: Without dead ends: 3016 [2019-09-20 13:00:28,391 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2019-09-20 13:00:28,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2019-09-20 13:00:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-09-20 13:00:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2019-09-20 13:00:28,510 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2019-09-20 13:00:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:28,510 INFO L475 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2019-09-20 13:00:28,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2019-09-20 13:00:28,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:28,517 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:28,517 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:28,517 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:28,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:28,518 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2019-09-20 13:00:28,518 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:28,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:28,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:28,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:28,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:28,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:28,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:28,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:28,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,542 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2019-09-20 13:00:28,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:28,632 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2019-09-20 13:00:28,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:28,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:28,634 INFO L225 Difference]: With dead ends: 3016 [2019-09-20 13:00:28,634 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:00:28,642 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:28,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:00:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:00:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:00:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:00:28,643 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-09-20 13:00:28,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:28,644 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:00:28,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:00:28,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:00:28,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 13:00:28,677 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-20 13:00:28,678 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:28,678 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:28,678 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-20 13:00:28,678 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-20 13:00:28,678 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-20 13:00:28,679 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-09-20 13:00:28,679 INFO L439 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-09-20 13:00:28,679 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2019-09-20 13:00:28,679 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2019-09-20 13:00:28,679 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-09-20 13:00:28,680 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-09-20 13:00:28,680 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-09-20 13:00:28,680 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-09-20 13:00:28,680 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-09-20 13:00:28,680 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2019-09-20 13:00:28,680 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-09-20 13:00:28,681 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2019-09-20 13:00:28,681 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-09-20 13:00:28,681 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2019-09-20 13:00:28,681 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-09-20 13:00:28,681 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2019-09-20 13:00:28,681 INFO L443 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2019-09-20 13:00:28,681 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-09-20 13:00:28,682 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2019-09-20 13:00:28,682 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-09-20 13:00:28,682 INFO L446 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-09-20 13:00:28,682 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-09-20 13:00:28,682 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-09-20 13:00:28,682 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-09-20 13:00:28,682 INFO L443 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-09-20 13:00:28,683 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-09-20 13:00:28,683 INFO L446 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-09-20 13:00:28,683 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-09-20 13:00:28,683 INFO L443 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2019-09-20 13:00:28,683 INFO L443 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-09-20 13:00:28,683 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-09-20 13:00:28,683 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2019-09-20 13:00:28,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:00:28 BoogieIcfgContainer [2019-09-20 13:00:28,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:00:28,697 INFO L168 Benchmark]: Toolchain (without parser) took 4327.69 ms. Allocated memory was 134.7 MB in the beginning and 318.8 MB in the end (delta: 184.0 MB). Free memory was 90.9 MB in the beginning and 276.4 MB in the end (delta: -185.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-20 13:00:28,698 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 134.7 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-09-20 13:00:28,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.98 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 90.5 MB in the beginning and 176.2 MB in the end (delta: -85.7 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:28,700 INFO L168 Benchmark]: Boogie Preprocessor took 42.81 ms. Allocated memory is still 198.7 MB. Free memory was 176.2 MB in the beginning and 174.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:28,701 INFO L168 Benchmark]: RCFGBuilder took 413.65 ms. Allocated memory is still 198.7 MB. Free memory was 174.0 MB in the beginning and 156.9 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:28,702 INFO L168 Benchmark]: TraceAbstraction took 3461.72 ms. Allocated memory was 198.7 MB in the beginning and 318.8 MB in the end (delta: 120.1 MB). Free memory was 156.3 MB in the beginning and 276.4 MB in the end (delta: -120.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-20 13:00:28,705 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.42 ms. Allocated memory is still 134.7 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 404.98 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 90.5 MB in the beginning and 176.2 MB in the end (delta: -85.7 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.81 ms. Allocated memory is still 198.7 MB. Free memory was 176.2 MB in the beginning and 174.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 413.65 ms. Allocated memory is still 198.7 MB. Free memory was 174.0 MB in the beginning and 156.9 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3461.72 ms. Allocated memory was 198.7 MB in the beginning and 318.8 MB in the end (delta: 120.1 MB). Free memory was 156.3 MB in the beginning and 276.4 MB in the end (delta: -120.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. SAFE Result, 3.3s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...