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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:26:55,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:55,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:55,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:55,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:55,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:55,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:55,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:55,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:55,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:55,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:55,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:55,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:55,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:55,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:55,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:55,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:55,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:55,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:55,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:55,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:55,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:55,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:55,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:55,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:55,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:55,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:55,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:55,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:55,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:55,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:55,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:55,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:55,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:55,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:55,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:55,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:55,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:55,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:55,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:55,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:55,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:26:55,365 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:55,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:55,366 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:55,366 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:55,367 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:55,367 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:55,367 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:55,367 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:55,368 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:55,368 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:55,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:55,369 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:55,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:55,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:55,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:55,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:55,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:55,370 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:55,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:55,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:55,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:55,371 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:55,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:55,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:55,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:55,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:55,372 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:55,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:55,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:55,372 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:55,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:55,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:55,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:55,421 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:55,421 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:55,422 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2019-09-20 13:26:55,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78053e76e/6ba3fd2bb0e44e3586d3a2c696c2b303/FLAG1cad30d3b [2019-09-20 13:26:55,973 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:55,974 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2019-09-20 13:26:55,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78053e76e/6ba3fd2bb0e44e3586d3a2c696c2b303/FLAG1cad30d3b [2019-09-20 13:26:56,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78053e76e/6ba3fd2bb0e44e3586d3a2c696c2b303 [2019-09-20 13:26:56,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:56,312 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:56,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:56,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:56,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:56,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:56" (1/1) ... [2019-09-20 13:26:56,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e770697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:56, skipping insertion in model container [2019-09-20 13:26:56,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:56" (1/1) ... [2019-09-20 13:26:56,336 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:56,364 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:56,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:56,580 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:56,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:56,615 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:56,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:56 WrapperNode [2019-09-20 13:26:56,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:56,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:56,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:56,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:56,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:56" (1/1) ... [2019-09-20 13:26:56,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:56" (1/1) ... [2019-09-20 13:26:56,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:56" (1/1) ... [2019-09-20 13:26:56,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:56" (1/1) ... [2019-09-20 13:26:56,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:56" (1/1) ... [2019-09-20 13:26:56,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:56" (1/1) ... [2019-09-20 13:26:56,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:56" (1/1) ... [2019-09-20 13:26:56,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:56,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:56,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:56,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:56,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:56" (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:26:56,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:56,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:56,819 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:57,175 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:57,175 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:26:57,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:57 BoogieIcfgContainer [2019-09-20 13:26:57,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:57,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:57,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:57,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:57,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:26:56" (1/3) ... [2019-09-20 13:26:57,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614b979e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:57, skipping insertion in model container [2019-09-20 13:26:57,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:56" (2/3) ... [2019-09-20 13:26:57,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614b979e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:57, skipping insertion in model container [2019-09-20 13:26:57,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:57" (3/3) ... [2019-09-20 13:26:57,189 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-09-20 13:26:57,199 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:57,208 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:57,224 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:57,247 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:57,248 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:57,248 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:57,248 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:57,248 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:57,248 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:57,248 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:57,248 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:57,262 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-09-20 13:26:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:26:57,271 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:57,272 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:57,275 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2019-09-20 13:26:57,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:57,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:57,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:57,463 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:26:57,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:57,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:57,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:57,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:57,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:57,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:57,489 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-09-20 13:26:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:57,568 INFO L93 Difference]: Finished difference Result 62 states and 101 transitions. [2019-09-20 13:26:57,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:57,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:26:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:57,590 INFO L225 Difference]: With dead ends: 62 [2019-09-20 13:26:57,590 INFO L226 Difference]: Without dead ends: 54 [2019-09-20 13:26:57,598 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:26:57,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-20 13:26:57,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-09-20 13:26:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-20 13:26:57,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2019-09-20 13:26:57,669 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2019-09-20 13:26:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:57,671 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2019-09-20 13:26:57,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2019-09-20 13:26:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:26:57,674 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:57,674 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:57,675 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:57,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:57,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2019-09-20 13:26:57,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:57,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:57,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:57,790 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:26:57,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:57,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:57,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:57,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:57,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:57,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:57,800 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2019-09-20 13:26:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:57,847 INFO L93 Difference]: Finished difference Result 54 states and 90 transitions. [2019-09-20 13:26:57,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:57,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-20 13:26:57,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:57,850 INFO L225 Difference]: With dead ends: 54 [2019-09-20 13:26:57,850 INFO L226 Difference]: Without dead ends: 54 [2019-09-20 13:26:57,852 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:26:57,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-20 13:26:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-09-20 13:26:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-20 13:26:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2019-09-20 13:26:57,872 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2019-09-20 13:26:57,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:57,872 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2019-09-20 13:26:57,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:57,873 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2019-09-20 13:26:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:26:57,875 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:57,876 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:26:57,876 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:57,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:57,876 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2019-09-20 13:26:57,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:57,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:57,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:57,934 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:26:57,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:57,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:57,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:57,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:57,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:57,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:57,937 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2019-09-20 13:26:57,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:57,965 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2019-09-20 13:26:57,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:57,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:26:57,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:57,967 INFO L225 Difference]: With dead ends: 57 [2019-09-20 13:26:57,968 INFO L226 Difference]: Without dead ends: 57 [2019-09-20 13:26:57,968 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:26:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-20 13:26:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-09-20 13:26:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-20 13:26:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2019-09-20 13:26:57,982 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2019-09-20 13:26:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:57,984 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2019-09-20 13:26:57,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2019-09-20 13:26:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:26:57,992 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:57,992 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:26:57,995 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:57,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:57,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2019-09-20 13:26:57,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:57,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,042 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:26:58,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,045 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2019-09-20 13:26:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,065 INFO L93 Difference]: Finished difference Result 98 states and 165 transitions. [2019-09-20 13:26:58,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:26:58,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,067 INFO L225 Difference]: With dead ends: 98 [2019-09-20 13:26:58,068 INFO L226 Difference]: Without dead ends: 98 [2019-09-20 13:26:58,068 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:26:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-20 13:26:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2019-09-20 13:26:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-20 13:26:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2019-09-20 13:26:58,077 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2019-09-20 13:26:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,078 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2019-09-20 13:26:58,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2019-09-20 13:26:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:26:58,079 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,079 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:26:58,080 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,080 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2019-09-20 13:26:58,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,126 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:26:58,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,128 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2019-09-20 13:26:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,151 INFO L93 Difference]: Finished difference Result 100 states and 163 transitions. [2019-09-20 13:26:58,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-20 13:26:58,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,153 INFO L225 Difference]: With dead ends: 100 [2019-09-20 13:26:58,154 INFO L226 Difference]: Without dead ends: 100 [2019-09-20 13:26:58,154 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:26:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-20 13:26:58,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-09-20 13:26:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-20 13:26:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2019-09-20 13:26:58,164 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2019-09-20 13:26:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,165 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2019-09-20 13:26:58,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2019-09-20 13:26:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:26:58,166 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,166 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:26:58,167 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2019-09-20 13:26:58,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,211 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:26:58,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,214 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2019-09-20 13:26:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,239 INFO L93 Difference]: Finished difference Result 102 states and 163 transitions. [2019-09-20 13:26:58,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:26:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,241 INFO L225 Difference]: With dead ends: 102 [2019-09-20 13:26:58,241 INFO L226 Difference]: Without dead ends: 102 [2019-09-20 13:26:58,242 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:26:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-20 13:26:58,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-09-20 13:26:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-20 13:26:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2019-09-20 13:26:58,252 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2019-09-20 13:26:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,253 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2019-09-20 13:26:58,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2019-09-20 13:26:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:26:58,257 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,257 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:26:58,258 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2019-09-20 13:26:58,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,299 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:26:58,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,301 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2019-09-20 13:26:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,317 INFO L93 Difference]: Finished difference Result 178 states and 291 transitions. [2019-09-20 13:26:58,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:26:58,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,320 INFO L225 Difference]: With dead ends: 178 [2019-09-20 13:26:58,320 INFO L226 Difference]: Without dead ends: 178 [2019-09-20 13:26:58,320 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:26:58,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-20 13:26:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2019-09-20 13:26:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-20 13:26:58,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2019-09-20 13:26:58,331 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2019-09-20 13:26:58,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,332 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2019-09-20 13:26:58,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,332 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2019-09-20 13:26:58,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:26:58,334 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,334 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:26:58,334 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2019-09-20 13:26:58,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,383 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:26:58,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,387 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2019-09-20 13:26:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,420 INFO L93 Difference]: Finished difference Result 186 states and 291 transitions. [2019-09-20 13:26:58,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:26:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,426 INFO L225 Difference]: With dead ends: 186 [2019-09-20 13:26:58,427 INFO L226 Difference]: Without dead ends: 186 [2019-09-20 13:26:58,427 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:26:58,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-20 13:26:58,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-09-20 13:26:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-20 13:26:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2019-09-20 13:26:58,453 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2019-09-20 13:26:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,454 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2019-09-20 13:26:58,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2019-09-20 13:26:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:58,459 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,459 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:26:58,460 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2019-09-20 13:26:58,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,510 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:26:58,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,512 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2019-09-20 13:26:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,530 INFO L93 Difference]: Finished difference Result 190 states and 291 transitions. [2019-09-20 13:26:58,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:58,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,533 INFO L225 Difference]: With dead ends: 190 [2019-09-20 13:26:58,533 INFO L226 Difference]: Without dead ends: 190 [2019-09-20 13:26:58,533 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:26:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-20 13:26:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2019-09-20 13:26:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-20 13:26:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2019-09-20 13:26:58,542 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2019-09-20 13:26:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,542 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2019-09-20 13:26:58,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2019-09-20 13:26:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:58,544 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,545 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:26:58,545 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2019-09-20 13:26:58,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,584 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:26:58,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,586 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2019-09-20 13:26:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,602 INFO L93 Difference]: Finished difference Result 330 states and 511 transitions. [2019-09-20 13:26:58,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,605 INFO L225 Difference]: With dead ends: 330 [2019-09-20 13:26:58,605 INFO L226 Difference]: Without dead ends: 330 [2019-09-20 13:26:58,606 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:26:58,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-20 13:26:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2019-09-20 13:26:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:26:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2019-09-20 13:26:58,635 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2019-09-20 13:26:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,635 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2019-09-20 13:26:58,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2019-09-20 13:26:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:58,637 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,637 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:26:58,638 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2019-09-20 13:26:58,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,664 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:26:58,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,666 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2019-09-20 13:26:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,682 INFO L93 Difference]: Finished difference Result 354 states and 519 transitions. [2019-09-20 13:26:58,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,685 INFO L225 Difference]: With dead ends: 354 [2019-09-20 13:26:58,686 INFO L226 Difference]: Without dead ends: 354 [2019-09-20 13:26:58,686 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:26:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-20 13:26:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-09-20 13:26:58,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-20 13:26:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2019-09-20 13:26:58,696 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2019-09-20 13:26:58,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,696 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2019-09-20 13:26:58,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2019-09-20 13:26:58,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:26:58,698 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,698 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:26:58,698 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2019-09-20 13:26:58,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,717 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:26:58,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,718 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2019-09-20 13:26:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,735 INFO L93 Difference]: Finished difference Result 362 states and 519 transitions. [2019-09-20 13:26:58,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:26:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,737 INFO L225 Difference]: With dead ends: 362 [2019-09-20 13:26:58,738 INFO L226 Difference]: Without dead ends: 362 [2019-09-20 13:26:58,738 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:26:58,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-20 13:26:58,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-09-20 13:26:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-20 13:26:58,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2019-09-20 13:26:58,748 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2019-09-20 13:26:58,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,749 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2019-09-20 13:26:58,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2019-09-20 13:26:58,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:26:58,750 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,750 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:26:58,750 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2019-09-20 13:26:58,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,784 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:26:58,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,786 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2019-09-20 13:26:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,802 INFO L93 Difference]: Finished difference Result 618 states and 887 transitions. [2019-09-20 13:26:58,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:26:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,807 INFO L225 Difference]: With dead ends: 618 [2019-09-20 13:26:58,807 INFO L226 Difference]: Without dead ends: 618 [2019-09-20 13:26:58,807 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:26:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-20 13:26:58,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2019-09-20 13:26:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-09-20 13:26:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2019-09-20 13:26:58,822 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2019-09-20 13:26:58,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,822 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2019-09-20 13:26:58,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,822 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2019-09-20 13:26:58,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:26:58,824 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,824 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:26:58,824 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2019-09-20 13:26:58,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,850 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:26:58,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,853 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2019-09-20 13:26:58,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,876 INFO L93 Difference]: Finished difference Result 682 states and 919 transitions. [2019-09-20 13:26:58,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:26:58,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,881 INFO L225 Difference]: With dead ends: 682 [2019-09-20 13:26:58,881 INFO L226 Difference]: Without dead ends: 682 [2019-09-20 13:26:58,882 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:26:58,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-20 13:26:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-09-20 13:26:58,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-09-20 13:26:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2019-09-20 13:26:58,899 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2019-09-20 13:26:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,899 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2019-09-20 13:26:58,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2019-09-20 13:26:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:26:58,901 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,901 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:26:58,901 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2019-09-20 13:26:58,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:58,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,939 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2019-09-20 13:26:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,955 INFO L93 Difference]: Finished difference Result 698 states and 919 transitions. [2019-09-20 13:26:58,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:26:58,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,960 INFO L225 Difference]: With dead ends: 698 [2019-09-20 13:26:58,960 INFO L226 Difference]: Without dead ends: 698 [2019-09-20 13:26:58,961 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:26:58,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-09-20 13:26:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-09-20 13:26:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-09-20 13:26:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2019-09-20 13:26:58,977 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2019-09-20 13:26:58,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,977 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2019-09-20 13:26:58,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2019-09-20 13:26:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:26:58,979 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,979 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:26:58,979 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,979 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2019-09-20 13:26:58,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,999 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:26:59,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,001 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2019-09-20 13:26:59,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,017 INFO L93 Difference]: Finished difference Result 1162 states and 1511 transitions. [2019-09-20 13:26:59,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:26:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,023 INFO L225 Difference]: With dead ends: 1162 [2019-09-20 13:26:59,023 INFO L226 Difference]: Without dead ends: 1162 [2019-09-20 13:26:59,024 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:26:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-09-20 13:26:59,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2019-09-20 13:26:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-09-20 13:26:59,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2019-09-20 13:26:59,048 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2019-09-20 13:26:59,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,048 INFO L475 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2019-09-20 13:26:59,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2019-09-20 13:26:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:26:59,050 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,050 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:26:59,051 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,051 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2019-09-20 13:26:59,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,070 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:26:59,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,072 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2019-09-20 13:26:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,091 INFO L93 Difference]: Finished difference Result 1322 states and 1607 transitions. [2019-09-20 13:26:59,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:26:59,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,097 INFO L225 Difference]: With dead ends: 1322 [2019-09-20 13:26:59,097 INFO L226 Difference]: Without dead ends: 1322 [2019-09-20 13:26:59,098 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:26:59,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-09-20 13:26:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2019-09-20 13:26:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-09-20 13:26:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2019-09-20 13:26:59,126 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2019-09-20 13:26:59,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,126 INFO L475 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2019-09-20 13:26:59,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2019-09-20 13:26:59,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:26:59,129 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,129 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:26:59,129 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,130 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2019-09-20 13:26:59,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,145 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:26:59,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,147 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2019-09-20 13:26:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,165 INFO L93 Difference]: Finished difference Result 1354 states and 1607 transitions. [2019-09-20 13:26:59,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:26:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,172 INFO L225 Difference]: With dead ends: 1354 [2019-09-20 13:26:59,172 INFO L226 Difference]: Without dead ends: 1354 [2019-09-20 13:26:59,173 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:26:59,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-20 13:26:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-09-20 13:26:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-20 13:26:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2019-09-20 13:26:59,201 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2019-09-20 13:26:59,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,202 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2019-09-20 13:26:59,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2019-09-20 13:26:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:26:59,205 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,205 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:26:59,205 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2019-09-20 13:26:59,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,224 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:26:59,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,226 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2019-09-20 13:26:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,252 INFO L93 Difference]: Finished difference Result 2184 states and 2502 transitions. [2019-09-20 13:26:59,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:26:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,263 INFO L225 Difference]: With dead ends: 2184 [2019-09-20 13:26:59,263 INFO L226 Difference]: Without dead ends: 2184 [2019-09-20 13:26:59,264 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:26:59,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-09-20 13:26:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2019-09-20 13:26:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-09-20 13:26:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2019-09-20 13:26:59,325 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2019-09-20 13:26:59,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,326 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2019-09-20 13:26:59,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2019-09-20 13:26:59,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:26:59,330 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,330 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:26:59,330 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2019-09-20 13:26:59,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,349 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:26:59,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,351 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2019-09-20 13:26:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,379 INFO L93 Difference]: Finished difference Result 2566 states and 2757 transitions. [2019-09-20 13:26:59,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:26:59,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,380 INFO L225 Difference]: With dead ends: 2566 [2019-09-20 13:26:59,380 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:26:59,381 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:26:59,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:26:59,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:26:59,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:26:59,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:26:59,382 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-09-20 13:26:59,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,382 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:26:59,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,382 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:26:59,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:26:59,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:26:59 BoogieIcfgContainer [2019-09-20 13:26:59,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:26:59,393 INFO L168 Benchmark]: Toolchain (without parser) took 3079.87 ms. Allocated memory was 130.5 MB in the beginning and 270.0 MB in the end (delta: 139.5 MB). Free memory was 86.0 MB in the beginning and 222.1 MB in the end (delta: -136.1 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:59,394 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 130.5 MB. Free memory was 104.7 MB in the beginning and 104.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:26:59,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.42 ms. Allocated memory is still 130.5 MB. Free memory was 85.7 MB in the beginning and 75.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:59,396 INFO L168 Benchmark]: Boogie Preprocessor took 135.20 ms. Allocated memory was 130.5 MB in the beginning and 198.2 MB in the end (delta: 67.6 MB). Free memory was 75.6 MB in the beginning and 174.0 MB in the end (delta: -98.4 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:59,397 INFO L168 Benchmark]: RCFGBuilder took 426.98 ms. Allocated memory is still 198.2 MB. Free memory was 173.4 MB in the beginning and 157.2 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:59,398 INFO L168 Benchmark]: TraceAbstraction took 2210.12 ms. Allocated memory was 198.2 MB in the beginning and 270.0 MB in the end (delta: 71.8 MB). Free memory was 157.2 MB in the beginning and 222.1 MB in the end (delta: -64.8 MB). Peak memory consumption was 7.0 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:59,402 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.25 ms. Allocated memory is still 130.5 MB. Free memory was 104.7 MB in the beginning and 104.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 296.42 ms. Allocated memory is still 130.5 MB. Free memory was 85.7 MB in the beginning and 75.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.20 ms. Allocated memory was 130.5 MB in the beginning and 198.2 MB in the end (delta: 67.6 MB). Free memory was 75.6 MB in the beginning and 174.0 MB in the end (delta: -98.4 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 426.98 ms. Allocated memory is still 198.2 MB. Free memory was 173.4 MB in the beginning and 157.2 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2210.12 ms. Allocated memory was 198.2 MB in the beginning and 270.0 MB in the end (delta: 71.8 MB). Free memory was 157.2 MB in the beginning and 222.1 MB in the end (delta: -64.8 MB). Peak memory consumption was 7.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 35 locations, 1 error locations. SAFE Result, 2.1s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...