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/psyco/psyco_security.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 23:56:49,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 23:56:49,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 23:56:49,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 23:56:49,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 23:56:49,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 23:56:49,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 23:56:49,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 23:56:49,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 23:56:49,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 23:56:49,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 23:56:49,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 23:56:49,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 23:56:49,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 23:56:49,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 23:56:49,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 23:56:49,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 23:56:49,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 23:56:49,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 23:56:49,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 23:56:49,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 23:56:49,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 23:56:49,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 23:56:49,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 23:56:49,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 23:56:49,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 23:56:49,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 23:56:49,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 23:56:49,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 23:56:49,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 23:56:49,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 23:56:49,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 23:56:49,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 23:56:49,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 23:56:49,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 23:56:49,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 23:56:49,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 23:56:49,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 23:56:49,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 23:56:49,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 23:56:49,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 23:56:49,390 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-09 23:56:49,404 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 23:56:49,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 23:56:49,404 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 23:56:49,405 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 23:56:49,405 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 23:56:49,405 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 23:56:49,406 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 23:56:49,406 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 23:56:49,406 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 23:56:49,406 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 23:56:49,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 23:56:49,407 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 23:56:49,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 23:56:49,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 23:56:49,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 23:56:49,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 23:56:49,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 23:56:49,408 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 23:56:49,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 23:56:49,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 23:56:49,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 23:56:49,409 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 23:56:49,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 23:56:49,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 23:56:49,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 23:56:49,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 23:56:49,410 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 23:56:49,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 23:56:49,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 23:56:49,411 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 23:56:49,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 23:56:49,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 23:56:49,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 23:56:49,456 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 23:56:49,456 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 23:56:49,457 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_security.c [2019-09-09 23:56:49,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f02061d/495766e06df64e0d8b096e111330e36d/FLAG3eef5bfa0 [2019-09-09 23:56:49,962 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 23:56:49,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_security.c [2019-09-09 23:56:49,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f02061d/495766e06df64e0d8b096e111330e36d/FLAG3eef5bfa0 [2019-09-09 23:56:50,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f02061d/495766e06df64e0d8b096e111330e36d [2019-09-09 23:56:50,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 23:56:50,339 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 23:56:50,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 23:56:50,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 23:56:50,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 23:56:50,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 11:56:50" (1/1) ... [2019-09-09 23:56:50,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6718885b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:56:50, skipping insertion in model container [2019-09-09 23:56:50,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 11:56:50" (1/1) ... [2019-09-09 23:56:50,359 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 23:56:50,402 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 23:56:50,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 23:56:50,592 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 23:56:50,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 23:56:50,734 INFO L192 MainTranslator]: Completed translation [2019-09-09 23:56:50,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:56:50 WrapperNode [2019-09-09 23:56:50,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 23:56:50,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 23:56:50,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 23:56:50,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 23:56:50,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:56:50" (1/1) ... [2019-09-09 23:56:50,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:56:50" (1/1) ... [2019-09-09 23:56:50,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:56:50" (1/1) ... [2019-09-09 23:56:50,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:56:50" (1/1) ... [2019-09-09 23:56:50,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:56:50" (1/1) ... [2019-09-09 23:56:50,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:56:50" (1/1) ... [2019-09-09 23:56:50,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:56:50" (1/1) ... [2019-09-09 23:56:50,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 23:56:50,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 23:56:50,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 23:56:50,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 23:56:50,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:56:50" (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-09 23:56:50,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 23:56:50,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 23:56:50,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 23:56:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 23:56:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 23:56:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 23:56:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 23:56:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 23:56:51,334 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 23:56:51,334 INFO L283 CfgBuilder]: Removed 18 assume(true) statements. [2019-09-09 23:56:51,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 11:56:51 BoogieIcfgContainer [2019-09-09 23:56:51,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 23:56:51,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 23:56:51,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 23:56:51,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 23:56:51,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 11:56:50" (1/3) ... [2019-09-09 23:56:51,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e9221e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 11:56:51, skipping insertion in model container [2019-09-09 23:56:51,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:56:50" (2/3) ... [2019-09-09 23:56:51,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e9221e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 11:56:51, skipping insertion in model container [2019-09-09 23:56:51,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 11:56:51" (3/3) ... [2019-09-09 23:56:51,345 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2019-09-09 23:56:51,355 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 23:56:51,364 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 23:56:51,382 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 23:56:51,411 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 23:56:51,412 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 23:56:51,412 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 23:56:51,412 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 23:56:51,412 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 23:56:51,413 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 23:56:51,413 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 23:56:51,413 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 23:56:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2019-09-09 23:56:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-09 23:56:51,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:56:51,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:56:51,450 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:56:51,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:56:51,457 INFO L82 PathProgramCache]: Analyzing trace with hash 400350089, now seen corresponding path program 1 times [2019-09-09 23:56:51,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:56:51,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:51,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:56:51,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:51,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:56:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:56:51,582 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-09 23:56:51,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:56:51,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-09 23:56:51,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:56:51,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 23:56:51,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 23:56:51,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 23:56:51,607 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 2 states. [2019-09-09 23:56:51,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:56:51,629 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2019-09-09 23:56:51,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 23:56:51,631 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-09-09 23:56:51,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:56:51,643 INFO L225 Difference]: With dead ends: 83 [2019-09-09 23:56:51,644 INFO L226 Difference]: Without dead ends: 78 [2019-09-09 23:56:51,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 23:56:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-09 23:56:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-09 23:56:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-09 23:56:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2019-09-09 23:56:51,701 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 113 transitions. Word has length 12 [2019-09-09 23:56:51,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:56:51,702 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 113 transitions. [2019-09-09 23:56:51,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 23:56:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2019-09-09 23:56:51,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-09 23:56:51,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:56:51,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:56:51,704 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:56:51,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:56:51,704 INFO L82 PathProgramCache]: Analyzing trace with hash 58442800, now seen corresponding path program 1 times [2019-09-09 23:56:51,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:56:51,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:51,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:56:51,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:51,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:56:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:56:51,752 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-09 23:56:51,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:56:51,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:56:51,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:56:51,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:56:51,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:56:51,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:51,758 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. Second operand 3 states. [2019-09-09 23:56:51,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:56:51,842 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2019-09-09 23:56:51,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:56:51,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-09 23:56:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:56:51,844 INFO L225 Difference]: With dead ends: 81 [2019-09-09 23:56:51,844 INFO L226 Difference]: Without dead ends: 81 [2019-09-09 23:56:51,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-09 23:56:51,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-09-09 23:56:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-09 23:56:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2019-09-09 23:56:51,856 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 13 [2019-09-09 23:56:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:56:51,856 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2019-09-09 23:56:51,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:56:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2019-09-09 23:56:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-09 23:56:51,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:56:51,858 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:56:51,858 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:56:51,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:56:51,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1372485752, now seen corresponding path program 1 times [2019-09-09 23:56:51,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:56:51,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:51,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:56:51,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:51,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:56:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:56:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:56:51,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:56:51,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:56:51,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:56:51,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:56:51,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:56:51,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:51,917 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand 3 states. [2019-09-09 23:56:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:56:51,989 INFO L93 Difference]: Finished difference Result 72 states and 102 transitions. [2019-09-09 23:56:51,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:56:51,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-09 23:56:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:56:51,993 INFO L225 Difference]: With dead ends: 72 [2019-09-09 23:56:51,994 INFO L226 Difference]: Without dead ends: 72 [2019-09-09 23:56:51,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-09 23:56:52,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-09 23:56:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-09 23:56:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2019-09-09 23:56:52,004 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 18 [2019-09-09 23:56:52,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:56:52,007 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2019-09-09 23:56:52,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:56:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2019-09-09 23:56:52,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 23:56:52,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:56:52,008 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:56:52,009 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:56:52,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:56:52,010 INFO L82 PathProgramCache]: Analyzing trace with hash 482960671, now seen corresponding path program 1 times [2019-09-09 23:56:52,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:56:52,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:56:52,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:56:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:56:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:56:52,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:56:52,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:56:52,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:56:52,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:56:52,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:56:52,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,063 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand 3 states. [2019-09-09 23:56:52,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:56:52,196 INFO L93 Difference]: Finished difference Result 132 states and 176 transitions. [2019-09-09 23:56:52,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:56:52,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-09 23:56:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:56:52,198 INFO L225 Difference]: With dead ends: 132 [2019-09-09 23:56:52,199 INFO L226 Difference]: Without dead ends: 122 [2019-09-09 23:56:52,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-09 23:56:52,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2019-09-09 23:56:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-09 23:56:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2019-09-09 23:56:52,209 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 21 [2019-09-09 23:56:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:56:52,210 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2019-09-09 23:56:52,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:56:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2019-09-09 23:56:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 23:56:52,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:56:52,211 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:56:52,212 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:56:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:56:52,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1554417674, now seen corresponding path program 1 times [2019-09-09 23:56:52,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:56:52,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:56:52,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:56:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:56:52,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:56:52,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:56:52,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:56:52,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:56:52,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:56:52,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:56:52,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,256 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2019-09-09 23:56:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:56:52,312 INFO L93 Difference]: Finished difference Result 87 states and 118 transitions. [2019-09-09 23:56:52,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:56:52,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-09 23:56:52,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:56:52,315 INFO L225 Difference]: With dead ends: 87 [2019-09-09 23:56:52,315 INFO L226 Difference]: Without dead ends: 87 [2019-09-09 23:56:52,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-09 23:56:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-09-09 23:56:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-09 23:56:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2019-09-09 23:56:52,346 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 22 [2019-09-09 23:56:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:56:52,346 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2019-09-09 23:56:52,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:56:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2019-09-09 23:56:52,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 23:56:52,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:56:52,351 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:56:52,351 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:56:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:56:52,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1458108167, now seen corresponding path program 1 times [2019-09-09 23:56:52,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:56:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:56:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:56:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:56:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-09 23:56:52,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:56:52,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:56:52,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:56:52,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:56:52,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:56:52,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,408 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand 3 states. [2019-09-09 23:56:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:56:52,440 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2019-09-09 23:56:52,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:56:52,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 23:56:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:56:52,441 INFO L225 Difference]: With dead ends: 70 [2019-09-09 23:56:52,441 INFO L226 Difference]: Without dead ends: 70 [2019-09-09 23:56:52,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-09 23:56:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-09-09 23:56:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-09 23:56:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2019-09-09 23:56:52,447 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 28 [2019-09-09 23:56:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:56:52,447 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2019-09-09 23:56:52,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:56:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2019-09-09 23:56:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-09 23:56:52,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:56:52,449 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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-09 23:56:52,449 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:56:52,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:56:52,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1598009508, now seen corresponding path program 1 times [2019-09-09 23:56:52,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:56:52,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:56:52,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:56:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:56:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-09 23:56:52,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:56:52,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:56:52,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:56:52,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:56:52,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:56:52,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,516 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 3 states. [2019-09-09 23:56:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:56:52,588 INFO L93 Difference]: Finished difference Result 113 states and 151 transitions. [2019-09-09 23:56:52,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:56:52,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-09 23:56:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:56:52,590 INFO L225 Difference]: With dead ends: 113 [2019-09-09 23:56:52,590 INFO L226 Difference]: Without dead ends: 111 [2019-09-09 23:56:52,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-09 23:56:52,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2019-09-09 23:56:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-09 23:56:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2019-09-09 23:56:52,600 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 29 [2019-09-09 23:56:52,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:56:52,601 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2019-09-09 23:56:52,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:56:52,601 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2019-09-09 23:56:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 23:56:52,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:56:52,602 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:56:52,603 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:56:52,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:56:52,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2139556318, now seen corresponding path program 1 times [2019-09-09 23:56:52,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:56:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:56:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:56:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:56:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-09 23:56:52,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:56:52,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:56:52,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:56:52,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:56:52,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:56:52,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,646 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand 3 states. [2019-09-09 23:56:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:56:52,679 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2019-09-09 23:56:52,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:56:52,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 23:56:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:56:52,681 INFO L225 Difference]: With dead ends: 92 [2019-09-09 23:56:52,681 INFO L226 Difference]: Without dead ends: 92 [2019-09-09 23:56:52,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-09 23:56:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-09-09 23:56:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-09 23:56:52,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2019-09-09 23:56:52,686 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 30 [2019-09-09 23:56:52,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:56:52,687 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2019-09-09 23:56:52,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:56:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2019-09-09 23:56:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 23:56:52,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:56:52,688 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:56:52,689 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:56:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:56:52,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1006467019, now seen corresponding path program 1 times [2019-09-09 23:56:52,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:56:52,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:56:52,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:56:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:56:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-09 23:56:52,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:56:52,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:56:52,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:56:52,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:56:52,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:56:52,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,721 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand 3 states. [2019-09-09 23:56:52,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:56:52,751 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2019-09-09 23:56:52,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:56:52,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 23:56:52,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:56:52,752 INFO L225 Difference]: With dead ends: 72 [2019-09-09 23:56:52,753 INFO L226 Difference]: Without dead ends: 72 [2019-09-09 23:56:52,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-09 23:56:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-09 23:56:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-09 23:56:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2019-09-09 23:56:52,757 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 30 [2019-09-09 23:56:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:56:52,757 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2019-09-09 23:56:52,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:56:52,757 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2019-09-09 23:56:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-09 23:56:52,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:56:52,758 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:56:52,759 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:56:52,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:56:52,759 INFO L82 PathProgramCache]: Analyzing trace with hash -614548945, now seen corresponding path program 1 times [2019-09-09 23:56:52,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:56:52,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:56:52,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:56:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:56:52,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-09 23:56:52,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:56:52,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:56:52,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:56:52,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:56:52,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:56:52,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,795 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 3 states. [2019-09-09 23:56:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:56:52,835 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2019-09-09 23:56:52,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:56:52,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-09 23:56:52,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:56:52,837 INFO L225 Difference]: With dead ends: 72 [2019-09-09 23:56:52,837 INFO L226 Difference]: Without dead ends: 70 [2019-09-09 23:56:52,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-09 23:56:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-09-09 23:56:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-09 23:56:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2019-09-09 23:56:52,842 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 31 [2019-09-09 23:56:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:56:52,842 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2019-09-09 23:56:52,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:56:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2019-09-09 23:56:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-09 23:56:52,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:56:52,843 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:56:52,844 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:56:52,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:56:52,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1859697889, now seen corresponding path program 1 times [2019-09-09 23:56:52,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:56:52,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:56:52,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:56:52,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:56:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:56:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-09 23:56:52,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:56:52,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:56:52,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:56:52,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:56:52,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:56:52,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,891 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 3 states. [2019-09-09 23:56:52,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:56:52,912 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2019-09-09 23:56:52,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:56:52,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-09 23:56:52,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:56:52,915 INFO L225 Difference]: With dead ends: 66 [2019-09-09 23:56:52,915 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 23:56:52,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:56:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 23:56:52,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 23:56:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 23:56:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 23:56:52,917 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-09-09 23:56:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:56:52,917 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 23:56:52,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:56:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 23:56:52,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 23:56:52,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 11:56:52 BoogieIcfgContainer [2019-09-09 23:56:52,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 23:56:52,927 INFO L168 Benchmark]: Toolchain (without parser) took 2585.44 ms. Allocated memory was 142.6 MB in the beginning and 232.8 MB in the end (delta: 90.2 MB). Free memory was 88.6 MB in the beginning and 133.4 MB in the end (delta: -44.9 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. [2019-09-09 23:56:52,927 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 142.6 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-09 23:56:52,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.45 ms. Allocated memory was 142.6 MB in the beginning and 202.4 MB in the end (delta: 59.8 MB). Free memory was 88.6 MB in the beginning and 180.1 MB in the end (delta: -91.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-09-09 23:56:52,931 INFO L168 Benchmark]: Boogie Preprocessor took 47.47 ms. Allocated memory is still 202.4 MB. Free memory was 180.1 MB in the beginning and 177.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-09-09 23:56:52,932 INFO L168 Benchmark]: RCFGBuilder took 553.03 ms. Allocated memory is still 202.4 MB. Free memory was 177.6 MB in the beginning and 150.1 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2019-09-09 23:56:52,938 INFO L168 Benchmark]: TraceAbstraction took 1586.19 ms. Allocated memory was 202.4 MB in the beginning and 232.8 MB in the end (delta: 30.4 MB). Free memory was 150.1 MB in the beginning and 133.4 MB in the end (delta: 16.6 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-09-09 23:56:52,944 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 142.6 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 391.45 ms. Allocated memory was 142.6 MB in the beginning and 202.4 MB in the end (delta: 59.8 MB). Free memory was 88.6 MB in the beginning and 180.1 MB in the end (delta: -91.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.47 ms. Allocated memory is still 202.4 MB. Free memory was 180.1 MB in the beginning and 177.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 553.03 ms. Allocated memory is still 202.4 MB. Free memory was 177.6 MB in the beginning and 150.1 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1586.19 ms. Allocated memory was 202.4 MB in the beginning and 232.8 MB in the end (delta: 30.4 MB). Free memory was 150.1 MB in the beginning and 133.4 MB in the end (delta: 16.6 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: 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, 83 locations, 1 error locations. SAFE Result, 1.5s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1008 SDtfs, 338 SDslu, 455 SDs, 0 SdLazy, 217 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 9889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 40/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...