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_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:19:03,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:19:03,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:19:03,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:19:03,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:19:03,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:19:03,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:19:03,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:19:03,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:19:03,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:19:03,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:19:03,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:19:03,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:19:03,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:19:03,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:19:03,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:19:03,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:19:03,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:19:03,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:19:03,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:19:03,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:19:03,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:19:03,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:19:03,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:19:03,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:19:03,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:19:03,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:19:03,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:19:03,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:19:03,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:19:03,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:19:03,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:19:03,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:19:03,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:19:03,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:19:03,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:19:03,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:19:03,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:19:03,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:19:03,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:19:03,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:19:03,398 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-16 16:19:03,411 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:19:03,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:19:03,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:19:03,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:19:03,413 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:19:03,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:19:03,413 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:19:03,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:19:03,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:19:03,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:19:03,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:19:03,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:19:03,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:19:03,414 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:19:03,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:19:03,415 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:19:03,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:19:03,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:19:03,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:19:03,416 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:19:03,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:19:03,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:19:03,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:19:03,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:19:03,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:19:03,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:19:03,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:19:03,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:19:03,418 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:19:03,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:19:03,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:19:03,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:19:03,461 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:19:03,462 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:19:03,463 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2019-09-16 16:19:03,522 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390ca780b/334f999d764c4939ac0c221cb7d82541/FLAG2712cb6d3 [2019-09-16 16:19:03,952 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:19:03,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2019-09-16 16:19:03,961 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390ca780b/334f999d764c4939ac0c221cb7d82541/FLAG2712cb6d3 [2019-09-16 16:19:04,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390ca780b/334f999d764c4939ac0c221cb7d82541 [2019-09-16 16:19:04,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:19:04,345 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:19:04,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:19:04,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:19:04,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:19:04,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:19:04" (1/1) ... [2019-09-16 16:19:04,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b3f85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:04, skipping insertion in model container [2019-09-16 16:19:04,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:19:04" (1/1) ... [2019-09-16 16:19:04,359 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:19:04,376 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:19:04,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:19:04,572 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:19:04,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:19:04,603 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:19:04,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:04 WrapperNode [2019-09-16 16:19:04,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:19:04,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:19:04,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:19:04,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:19:04,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:04" (1/1) ... [2019-09-16 16:19:04,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:04" (1/1) ... [2019-09-16 16:19:04,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:04" (1/1) ... [2019-09-16 16:19:04,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:04" (1/1) ... [2019-09-16 16:19:04,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:04" (1/1) ... [2019-09-16 16:19:04,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:04" (1/1) ... [2019-09-16 16:19:04,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:04" (1/1) ... [2019-09-16 16:19:04,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:19:04,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:19:04,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:19:04,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:19:04,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:04" (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-16 16:19:04,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:19:04,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:19:04,785 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:19:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:19:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:19:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:19:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:19:04,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:19:05,046 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:19:05,047 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 16:19:05,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:19:05 BoogieIcfgContainer [2019-09-16 16:19:05,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:19:05,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:19:05,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:19:05,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:19:05,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:19:04" (1/3) ... [2019-09-16 16:19:05,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1387f250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:19:05, skipping insertion in model container [2019-09-16 16:19:05,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:19:04" (2/3) ... [2019-09-16 16:19:05,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1387f250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:19:05, skipping insertion in model container [2019-09-16 16:19:05,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:19:05" (3/3) ... [2019-09-16 16:19:05,063 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-09-16 16:19:05,086 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:19:05,093 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:19:05,107 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:19:05,134 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:19:05,135 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:19:05,135 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:19:05,135 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:19:05,135 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:19:05,135 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:19:05,135 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:19:05,136 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:19:05,136 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:19:05,153 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-16 16:19:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 16:19:05,157 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:05,158 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:05,160 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:05,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2019-09-16 16:19:05,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:05,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:05,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:05,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:05,315 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-16 16:19:05,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:05,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:05,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:05,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:05,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:05,334 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-09-16 16:19:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:05,383 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2019-09-16 16:19:05,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:05,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-16 16:19:05,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:05,393 INFO L225 Difference]: With dead ends: 57 [2019-09-16 16:19:05,394 INFO L226 Difference]: Without dead ends: 42 [2019-09-16 16:19:05,397 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-16 16:19:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-16 16:19:05,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-09-16 16:19:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-16 16:19:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2019-09-16 16:19:05,432 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2019-09-16 16:19:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:05,432 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2019-09-16 16:19:05,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2019-09-16 16:19:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 16:19:05,433 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:05,433 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:05,434 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:05,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:05,434 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2019-09-16 16:19:05,434 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:05,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:05,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:05,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:05,495 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-16 16:19:05,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:05,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:05,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:05,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:05,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:05,500 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2019-09-16 16:19:05,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:05,532 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2019-09-16 16:19:05,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:05,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-16 16:19:05,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:05,535 INFO L225 Difference]: With dead ends: 67 [2019-09-16 16:19:05,535 INFO L226 Difference]: Without dead ends: 42 [2019-09-16 16:19:05,536 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-16 16:19:05,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-16 16:19:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-09-16 16:19:05,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-16 16:19:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2019-09-16 16:19:05,544 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2019-09-16 16:19:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:05,545 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2019-09-16 16:19:05,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2019-09-16 16:19:05,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 16:19:05,546 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:05,546 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:05,546 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:05,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:05,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2019-09-16 16:19:05,547 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:05,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:05,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:05,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:05,588 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-16 16:19:05,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:05,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:05,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:05,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:05,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:05,595 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2019-09-16 16:19:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:05,628 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2019-09-16 16:19:05,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:05,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-16 16:19:05,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:05,631 INFO L225 Difference]: With dead ends: 63 [2019-09-16 16:19:05,632 INFO L226 Difference]: Without dead ends: 45 [2019-09-16 16:19:05,632 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-16 16:19:05,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-16 16:19:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-09-16 16:19:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-16 16:19:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2019-09-16 16:19:05,641 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2019-09-16 16:19:05,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:05,642 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2019-09-16 16:19:05,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2019-09-16 16:19:05,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 16:19:05,644 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:05,644 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:05,645 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:05,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:05,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2019-09-16 16:19:05,647 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:05,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:05,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:05,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:05,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:05,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:05,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:05,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:05,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:05,698 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2019-09-16 16:19:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:05,733 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2019-09-16 16:19:05,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:05,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-16 16:19:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:05,735 INFO L225 Difference]: With dead ends: 76 [2019-09-16 16:19:05,735 INFO L226 Difference]: Without dead ends: 74 [2019-09-16 16:19:05,736 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-16 16:19:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-16 16:19:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2019-09-16 16:19:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-16 16:19:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2019-09-16 16:19:05,749 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2019-09-16 16:19:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:05,751 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2019-09-16 16:19:05,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2019-09-16 16:19:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 16:19:05,753 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:05,753 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:05,753 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:05,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:05,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2019-09-16 16:19:05,754 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:05,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:05,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:05,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:05,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:05,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:05,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:05,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:05,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:05,802 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2019-09-16 16:19:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:05,821 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2019-09-16 16:19:05,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:05,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-16 16:19:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:05,823 INFO L225 Difference]: With dead ends: 124 [2019-09-16 16:19:05,823 INFO L226 Difference]: Without dead ends: 76 [2019-09-16 16:19:05,824 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-16 16:19:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-16 16:19:05,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-09-16 16:19:05,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-16 16:19:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2019-09-16 16:19:05,833 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2019-09-16 16:19:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:05,833 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2019-09-16 16:19:05,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2019-09-16 16:19:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 16:19:05,835 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:05,835 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:05,835 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:05,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:05,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2019-09-16 16:19:05,836 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:05,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:05,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:05,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:05,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:05,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:05,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:05,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:05,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:05,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:05,865 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2019-09-16 16:19:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:05,887 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2019-09-16 16:19:05,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:05,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-16 16:19:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:05,888 INFO L225 Difference]: With dead ends: 111 [2019-09-16 16:19:05,888 INFO L226 Difference]: Without dead ends: 78 [2019-09-16 16:19:05,889 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-16 16:19:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-16 16:19:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-09-16 16:19:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-16 16:19:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2019-09-16 16:19:05,898 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2019-09-16 16:19:05,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:05,899 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2019-09-16 16:19:05,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:05,899 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2019-09-16 16:19:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 16:19:05,900 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:05,900 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:05,900 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:05,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:05,901 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2019-09-16 16:19:05,901 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:05,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:05,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:05,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:05,926 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-16 16:19:05,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:05,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:05,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:05,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:05,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:05,928 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2019-09-16 16:19:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:05,960 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2019-09-16 16:19:05,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:05,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-16 16:19:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:05,965 INFO L225 Difference]: With dead ends: 132 [2019-09-16 16:19:05,965 INFO L226 Difference]: Without dead ends: 130 [2019-09-16 16:19:05,966 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-16 16:19:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-16 16:19:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2019-09-16 16:19:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-16 16:19:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-09-16 16:19:05,988 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2019-09-16 16:19:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:05,989 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-09-16 16:19:05,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-09-16 16:19:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 16:19:05,990 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:05,990 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:05,991 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:05,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2019-09-16 16:19:05,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:05,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:05,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:05,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:06,025 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-16 16:19:06,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:06,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:06,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:06,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:06,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:06,027 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2019-09-16 16:19:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:06,056 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2019-09-16 16:19:06,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:06,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-16 16:19:06,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:06,058 INFO L225 Difference]: With dead ends: 232 [2019-09-16 16:19:06,058 INFO L226 Difference]: Without dead ends: 138 [2019-09-16 16:19:06,059 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-16 16:19:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-16 16:19:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-09-16 16:19:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-16 16:19:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2019-09-16 16:19:06,073 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2019-09-16 16:19:06,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:06,073 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2019-09-16 16:19:06,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:06,073 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2019-09-16 16:19:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 16:19:06,075 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:06,075 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-16 16:19:06,076 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:06,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:06,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2019-09-16 16:19:06,076 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:06,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:06,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:06,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:06,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:06,125 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-16 16:19:06,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:06,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:06,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:06,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:06,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:06,127 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2019-09-16 16:19:06,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:06,159 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2019-09-16 16:19:06,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:06,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 16:19:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:06,161 INFO L225 Difference]: With dead ends: 204 [2019-09-16 16:19:06,161 INFO L226 Difference]: Without dead ends: 142 [2019-09-16 16:19:06,164 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-16 16:19:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-16 16:19:06,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-09-16 16:19:06,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-16 16:19:06,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-09-16 16:19:06,186 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2019-09-16 16:19:06,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:06,190 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-09-16 16:19:06,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:06,190 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-09-16 16:19:06,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 16:19:06,192 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:06,192 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-16 16:19:06,192 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:06,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2019-09-16 16:19:06,193 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:06,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:06,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:06,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:06,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:06,221 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-16 16:19:06,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:06,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:06,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:06,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:06,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:06,223 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2019-09-16 16:19:06,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:06,257 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2019-09-16 16:19:06,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:06,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 16:19:06,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:06,260 INFO L225 Difference]: With dead ends: 236 [2019-09-16 16:19:06,260 INFO L226 Difference]: Without dead ends: 234 [2019-09-16 16:19:06,261 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-16 16:19:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-16 16:19:06,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2019-09-16 16:19:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-16 16:19:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2019-09-16 16:19:06,287 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2019-09-16 16:19:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:06,287 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2019-09-16 16:19:06,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2019-09-16 16:19:06,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 16:19:06,291 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:06,291 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-16 16:19:06,291 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:06,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:06,292 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2019-09-16 16:19:06,294 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:06,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:06,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:06,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:06,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:06,333 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-16 16:19:06,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:06,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:06,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:06,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:06,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:06,335 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2019-09-16 16:19:06,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:06,373 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2019-09-16 16:19:06,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:06,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 16:19:06,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:06,375 INFO L225 Difference]: With dead ends: 444 [2019-09-16 16:19:06,375 INFO L226 Difference]: Without dead ends: 258 [2019-09-16 16:19:06,376 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-16 16:19:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-16 16:19:06,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-16 16:19:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-16 16:19:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2019-09-16 16:19:06,388 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2019-09-16 16:19:06,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:06,388 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2019-09-16 16:19:06,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2019-09-16 16:19:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 16:19:06,390 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:06,390 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-16 16:19:06,390 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:06,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:06,390 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2019-09-16 16:19:06,391 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:06,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:06,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:06,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:06,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:06,412 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-16 16:19:06,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:06,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:06,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:06,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:06,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:06,414 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2019-09-16 16:19:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:06,430 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2019-09-16 16:19:06,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:06,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 16:19:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:06,432 INFO L225 Difference]: With dead ends: 384 [2019-09-16 16:19:06,432 INFO L226 Difference]: Without dead ends: 266 [2019-09-16 16:19:06,433 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-16 16:19:06,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-16 16:19:06,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2019-09-16 16:19:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-16 16:19:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2019-09-16 16:19:06,444 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2019-09-16 16:19:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:06,444 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2019-09-16 16:19:06,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2019-09-16 16:19:06,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 16:19:06,445 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:06,445 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-16 16:19:06,445 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:06,446 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2019-09-16 16:19:06,446 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:06,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:06,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:06,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:06,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:06,489 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-16 16:19:06,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:06,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:06,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:06,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:06,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:06,491 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2019-09-16 16:19:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:06,513 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2019-09-16 16:19:06,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:06,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 16:19:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:06,516 INFO L225 Difference]: With dead ends: 426 [2019-09-16 16:19:06,516 INFO L226 Difference]: Without dead ends: 424 [2019-09-16 16:19:06,517 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-16 16:19:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-16 16:19:06,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2019-09-16 16:19:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-16 16:19:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2019-09-16 16:19:06,530 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2019-09-16 16:19:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:06,530 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2019-09-16 16:19:06,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2019-09-16 16:19:06,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 16:19:06,532 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:06,532 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-16 16:19:06,532 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:06,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:06,533 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2019-09-16 16:19:06,533 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:06,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:06,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:06,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:06,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:06,567 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-16 16:19:06,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:06,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:06,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:06,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:06,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:06,569 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2019-09-16 16:19:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:06,594 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2019-09-16 16:19:06,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:06,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 16:19:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:06,595 INFO L225 Difference]: With dead ends: 856 [2019-09-16 16:19:06,595 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:19:06,602 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-16 16:19:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:19:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:19:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:19:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:19:06,603 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-09-16 16:19:06,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:06,603 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:19:06,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:19:06,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:19:06,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:19:06,633 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-16 16:19:06,633 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:19:06,633 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:19:06,633 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-16 16:19:06,633 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:19:06,633 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:19:06,633 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-09-16 16:19:06,634 INFO L446 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2019-09-16 16:19:06,634 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2019-09-16 16:19:06,634 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2019-09-16 16:19:06,634 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-09-16 16:19:06,634 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2019-09-16 16:19:06,634 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2019-09-16 16:19:06,634 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2019-09-16 16:19:06,634 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2019-09-16 16:19:06,635 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2019-09-16 16:19:06,635 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-09-16 16:19:06,635 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-09-16 16:19:06,635 INFO L443 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2019-09-16 16:19:06,635 INFO L446 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2019-09-16 16:19:06,635 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-09-16 16:19:06,635 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2019-09-16 16:19:06,635 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2019-09-16 16:19:06,635 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2019-09-16 16:19:06,636 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-09-16 16:19:06,636 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-09-16 16:19:06,636 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-09-16 16:19:06,636 INFO L439 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2019-09-16 16:19:06,636 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2019-09-16 16:19:06,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:19:06 BoogieIcfgContainer [2019-09-16 16:19:06,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:19:06,644 INFO L168 Benchmark]: Toolchain (without parser) took 2298.71 ms. Allocated memory was 137.9 MB in the beginning and 219.2 MB in the end (delta: 81.3 MB). Free memory was 85.6 MB in the beginning and 151.2 MB in the end (delta: -65.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-09-16 16:19:06,645 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 103.8 MB in the beginning and 103.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:19:06,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.91 ms. Allocated memory is still 137.9 MB. Free memory was 85.4 MB in the beginning and 75.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:19:06,647 INFO L168 Benchmark]: Boogie Preprocessor took 128.32 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 75.5 MB in the beginning and 175.5 MB in the end (delta: -100.0 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-09-16 16:19:06,648 INFO L168 Benchmark]: RCFGBuilder took 314.48 ms. Allocated memory is still 198.2 MB. Free memory was 175.5 MB in the beginning and 160.6 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:19:06,649 INFO L168 Benchmark]: TraceAbstraction took 1588.35 ms. Allocated memory was 198.2 MB in the beginning and 219.2 MB in the end (delta: 21.0 MB). Free memory was 160.6 MB in the beginning and 151.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:19:06,652 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 103.8 MB in the beginning and 103.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 258.91 ms. Allocated memory is still 137.9 MB. Free memory was 85.4 MB in the beginning and 75.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.32 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 75.5 MB in the beginning and 175.5 MB in the end (delta: -100.0 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 314.48 ms. Allocated memory is still 198.2 MB. Free memory was 175.5 MB in the beginning and 160.6 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1588.35 ms. Allocated memory was 198.2 MB in the beginning and 219.2 MB in the end (delta: 21.0 MB). Free memory was 160.6 MB in the beginning and 151.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 24]: 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, 29 locations, 1 error locations. SAFE Result, 1.5s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=13, 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 6424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...