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-673a906-m [2019-10-03 02:59:26,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:59:26,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:59:26,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:59:26,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:59:26,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:59:26,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:59:26,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:59:26,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:59:26,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:59:26,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:59:26,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:59:26,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:59:26,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:59:26,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:59:26,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:59:26,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:59:26,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:59:26,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:59:26,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:59:26,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:59:26,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:59:26,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:59:26,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:59:26,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:59:26,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:59:26,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:59:26,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:59:26,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:59:26,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:59:26,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:59:26,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:59:26,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:59:26,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:59:26,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:59:26,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:59:26,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:59:26,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:59:26,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:59:26,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:59:26,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:59:26,693 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-10-03 02:59:26,718 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:59:26,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:59:26,719 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:59:26,721 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:59:26,721 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:59:26,722 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:59:26,722 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:59:26,722 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:59:26,722 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:59:26,722 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:59:26,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:59:26,725 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:59:26,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:59:26,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:59:26,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:59:26,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:59:26,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:59:26,727 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:59:26,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:59:26,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:59:26,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:59:26,728 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:59:26,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:59:26,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:59:26,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:59:26,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:59:26,729 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:59:26,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:59:26,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:59:26,730 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:59:26,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:59:26,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:59:26,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:59:26,805 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:59:26,805 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:59:26,806 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_security.c [2019-10-03 02:59:26,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3f838c3/b5ce025b71b849559386fd42747658b0/FLAG2bdff666e [2019-10-03 02:59:27,344 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:59:27,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_security.c [2019-10-03 02:59:27,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3f838c3/b5ce025b71b849559386fd42747658b0/FLAG2bdff666e [2019-10-03 02:59:27,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3f838c3/b5ce025b71b849559386fd42747658b0 [2019-10-03 02:59:27,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:59:27,703 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:59:27,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:59:27,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:59:27,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:59:27,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:59:27" (1/1) ... [2019-10-03 02:59:27,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7a5bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:27, skipping insertion in model container [2019-10-03 02:59:27,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:59:27" (1/1) ... [2019-10-03 02:59:27,721 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:59:27,767 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:59:27,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:59:27,974 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:59:28,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:59:28,209 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:59:28,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:28 WrapperNode [2019-10-03 02:59:28,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:59:28,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:59:28,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:59:28,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:59:28,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:28" (1/1) ... [2019-10-03 02:59:28,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:28" (1/1) ... [2019-10-03 02:59:28,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:28" (1/1) ... [2019-10-03 02:59:28,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:28" (1/1) ... [2019-10-03 02:59:28,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:28" (1/1) ... [2019-10-03 02:59:28,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:28" (1/1) ... [2019-10-03 02:59:28,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:28" (1/1) ... [2019-10-03 02:59:28,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:59:28,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:59:28,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:59:28,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:59:28,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:59:28,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:59:28,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:59:28,381 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:59:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:59:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:59:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:59:28,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:59:28,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:59:28,899 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:59:28,899 INFO L283 CfgBuilder]: Removed 18 assume(true) statements. [2019-10-03 02:59:28,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:59:28 BoogieIcfgContainer [2019-10-03 02:59:28,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:59:28,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:59:28,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:59:28,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:59:28,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:59:27" (1/3) ... [2019-10-03 02:59:28,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431feabd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:59:28, skipping insertion in model container [2019-10-03 02:59:28,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:28" (2/3) ... [2019-10-03 02:59:28,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431feabd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:59:28, skipping insertion in model container [2019-10-03 02:59:28,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:59:28" (3/3) ... [2019-10-03 02:59:28,909 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2019-10-03 02:59:28,916 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:59:28,923 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:59:28,937 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:59:28,965 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:59:28,965 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:59:28,965 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:59:28,965 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:59:28,966 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:59:28,966 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:59:28,966 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:59:28,966 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:59:28,984 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2019-10-03 02:59:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-03 02:59:28,993 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:28,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:28,996 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:29,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:29,001 INFO L82 PathProgramCache]: Analyzing trace with hash 400350089, now seen corresponding path program 1 times [2019-10-03 02:59:29,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:29,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:29,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:29,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:29,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:59:29,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:29,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:59:29,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:59:29,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:59:29,156 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 2 states. [2019-10-03 02:59:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:29,177 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2019-10-03 02:59:29,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:59:29,179 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-03 02:59:29,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:29,190 INFO L225 Difference]: With dead ends: 83 [2019-10-03 02:59:29,191 INFO L226 Difference]: Without dead ends: 78 [2019-10-03 02:59:29,193 INFO L640 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-10-03 02:59:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-03 02:59:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-03 02:59:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-03 02:59:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2019-10-03 02:59:29,240 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 113 transitions. Word has length 12 [2019-10-03 02:59:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:29,240 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 113 transitions. [2019-10-03 02:59:29,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:59:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2019-10-03 02:59:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-03 02:59:29,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:29,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:29,243 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:29,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:29,243 INFO L82 PathProgramCache]: Analyzing trace with hash 58442800, now seen corresponding path program 1 times [2019-10-03 02:59:29,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:29,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:29,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:29,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:29,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:29,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:29,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:29,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:29,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:29,297 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. Second operand 3 states. [2019-10-03 02:59:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:29,420 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2019-10-03 02:59:29,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:29,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-03 02:59:29,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:29,423 INFO L225 Difference]: With dead ends: 81 [2019-10-03 02:59:29,423 INFO L226 Difference]: Without dead ends: 81 [2019-10-03 02:59:29,424 INFO L640 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-10-03 02:59:29,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-03 02:59:29,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-03 02:59:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-03 02:59:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2019-10-03 02:59:29,441 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 13 [2019-10-03 02:59:29,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:29,441 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2019-10-03 02:59:29,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:29,441 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2019-10-03 02:59:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:59:29,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:29,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:29,446 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:29,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:29,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1372485752, now seen corresponding path program 1 times [2019-10-03 02:59:29,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:29,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:29,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:29,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:29,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:29,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:29,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:29,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:29,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:29,543 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand 3 states. [2019-10-03 02:59:29,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:29,636 INFO L93 Difference]: Finished difference Result 72 states and 102 transitions. [2019-10-03 02:59:29,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:29,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-03 02:59:29,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:29,638 INFO L225 Difference]: With dead ends: 72 [2019-10-03 02:59:29,639 INFO L226 Difference]: Without dead ends: 72 [2019-10-03 02:59:29,639 INFO L640 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-10-03 02:59:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-03 02:59:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-03 02:59:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-03 02:59:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2019-10-03 02:59:29,647 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 18 [2019-10-03 02:59:29,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:29,648 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2019-10-03 02:59:29,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2019-10-03 02:59:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:59:29,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:29,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:29,650 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:29,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash 482960671, now seen corresponding path program 1 times [2019-10-03 02:59:29,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:29,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:29,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:29,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:29,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:29,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:29,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:29,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:29,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:29,723 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand 3 states. [2019-10-03 02:59:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:29,882 INFO L93 Difference]: Finished difference Result 132 states and 176 transitions. [2019-10-03 02:59:29,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:29,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:59:29,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:29,885 INFO L225 Difference]: With dead ends: 132 [2019-10-03 02:59:29,886 INFO L226 Difference]: Without dead ends: 122 [2019-10-03 02:59:29,886 INFO L640 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-10-03 02:59:29,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-03 02:59:29,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2019-10-03 02:59:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-03 02:59:29,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2019-10-03 02:59:29,898 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 21 [2019-10-03 02:59:29,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:29,898 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2019-10-03 02:59:29,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:29,899 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2019-10-03 02:59:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 02:59:29,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:29,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:29,916 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:29,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:29,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1554417674, now seen corresponding path program 1 times [2019-10-03 02:59:29,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:29,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:29,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:29,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:29,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:29,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:29,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:29,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:29,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:29,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:29,963 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2019-10-03 02:59:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:30,020 INFO L93 Difference]: Finished difference Result 87 states and 118 transitions. [2019-10-03 02:59:30,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:30,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-03 02:59:30,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:30,024 INFO L225 Difference]: With dead ends: 87 [2019-10-03 02:59:30,025 INFO L226 Difference]: Without dead ends: 87 [2019-10-03 02:59:30,025 INFO L640 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-10-03 02:59:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-03 02:59:30,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-03 02:59:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-03 02:59:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2019-10-03 02:59:30,033 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 22 [2019-10-03 02:59:30,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:30,034 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2019-10-03 02:59:30,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2019-10-03 02:59:30,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:59:30,035 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:30,036 INFO L411 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-10-03 02:59:30,036 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:30,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:30,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1458108167, now seen corresponding path program 1 times [2019-10-03 02:59:30,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:30,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:30,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:59:30,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:30,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:30,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:30,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:30,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:30,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:30,091 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand 3 states. [2019-10-03 02:59:30,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:30,134 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2019-10-03 02:59:30,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:30,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-03 02:59:30,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:30,136 INFO L225 Difference]: With dead ends: 70 [2019-10-03 02:59:30,136 INFO L226 Difference]: Without dead ends: 70 [2019-10-03 02:59:30,137 INFO L640 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-10-03 02:59:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-03 02:59:30,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-03 02:59:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-03 02:59:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2019-10-03 02:59:30,142 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 28 [2019-10-03 02:59:30,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:30,143 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2019-10-03 02:59:30,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2019-10-03 02:59:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:59:30,145 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:30,145 INFO L411 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-10-03 02:59:30,146 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:30,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1598009508, now seen corresponding path program 1 times [2019-10-03 02:59:30,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:59:30,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:30,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:30,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:30,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:30,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:30,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:30,242 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 3 states. [2019-10-03 02:59:30,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:30,325 INFO L93 Difference]: Finished difference Result 113 states and 151 transitions. [2019-10-03 02:59:30,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:30,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-03 02:59:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:30,327 INFO L225 Difference]: With dead ends: 113 [2019-10-03 02:59:30,327 INFO L226 Difference]: Without dead ends: 111 [2019-10-03 02:59:30,328 INFO L640 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-10-03 02:59:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-03 02:59:30,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2019-10-03 02:59:30,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-03 02:59:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2019-10-03 02:59:30,335 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 29 [2019-10-03 02:59:30,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:30,335 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2019-10-03 02:59:30,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:30,336 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2019-10-03 02:59:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 02:59:30,337 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:30,337 INFO L411 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-10-03 02:59:30,337 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:30,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:30,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2139556318, now seen corresponding path program 1 times [2019-10-03 02:59:30,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:30,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:30,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:59:30,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:30,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:30,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:30,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:30,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:30,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:30,386 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand 3 states. [2019-10-03 02:59:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:30,418 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2019-10-03 02:59:30,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:30,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-03 02:59:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:30,420 INFO L225 Difference]: With dead ends: 92 [2019-10-03 02:59:30,420 INFO L226 Difference]: Without dead ends: 92 [2019-10-03 02:59:30,420 INFO L640 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-10-03 02:59:30,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-03 02:59:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-10-03 02:59:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-03 02:59:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2019-10-03 02:59:30,427 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 30 [2019-10-03 02:59:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:30,428 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2019-10-03 02:59:30,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2019-10-03 02:59:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 02:59:30,429 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:30,430 INFO L411 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-10-03 02:59:30,430 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:30,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:30,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1006467019, now seen corresponding path program 1 times [2019-10-03 02:59:30,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:30,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:30,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:59:30,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:30,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:30,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:30,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:30,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:30,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:30,495 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand 3 states. [2019-10-03 02:59:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:30,526 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2019-10-03 02:59:30,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:30,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-03 02:59:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:30,528 INFO L225 Difference]: With dead ends: 72 [2019-10-03 02:59:30,528 INFO L226 Difference]: Without dead ends: 72 [2019-10-03 02:59:30,528 INFO L640 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-10-03 02:59:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-03 02:59:30,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-03 02:59:30,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-03 02:59:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2019-10-03 02:59:30,532 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 30 [2019-10-03 02:59:30,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:30,533 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2019-10-03 02:59:30,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:30,533 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2019-10-03 02:59:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-03 02:59:30,534 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:30,534 INFO L411 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-10-03 02:59:30,535 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:30,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:30,535 INFO L82 PathProgramCache]: Analyzing trace with hash -614548945, now seen corresponding path program 1 times [2019-10-03 02:59:30,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:30,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:30,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:59:30,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:30,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:30,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:30,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:30,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:30,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:30,564 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 3 states. [2019-10-03 02:59:30,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:30,596 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2019-10-03 02:59:30,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:30,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-03 02:59:30,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:30,598 INFO L225 Difference]: With dead ends: 72 [2019-10-03 02:59:30,598 INFO L226 Difference]: Without dead ends: 70 [2019-10-03 02:59:30,598 INFO L640 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-10-03 02:59:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-03 02:59:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-03 02:59:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-03 02:59:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2019-10-03 02:59:30,602 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 31 [2019-10-03 02:59:30,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:30,603 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2019-10-03 02:59:30,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2019-10-03 02:59:30,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 02:59:30,604 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:30,604 INFO L411 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-10-03 02:59:30,605 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:30,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:30,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1859697889, now seen corresponding path program 1 times [2019-10-03 02:59:30,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:30,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:30,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:30,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:59:30,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:30,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:30,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:30,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:30,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:30,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:30,633 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 3 states. [2019-10-03 02:59:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:30,655 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2019-10-03 02:59:30,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:30,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-03 02:59:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:30,656 INFO L225 Difference]: With dead ends: 66 [2019-10-03 02:59:30,656 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:59:30,656 INFO L640 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-10-03 02:59:30,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:59:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:59:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:59:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:59:30,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-10-03 02:59:30,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:30,658 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:59:30,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:30,658 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:59:30,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:59:30,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:59:30 BoogieIcfgContainer [2019-10-03 02:59:30,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:59:30,667 INFO L168 Benchmark]: Toolchain (without parser) took 2961.99 ms. Allocated memory was 137.9 MB in the beginning and 237.0 MB in the end (delta: 99.1 MB). Free memory was 93.5 MB in the beginning and 126.3 MB in the end (delta: -32.8 MB). Peak memory consumption was 66.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:30,667 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 112.1 MB in the beginning and 111.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:59:30,668 INFO L168 Benchmark]: CACSL2BoogieTranslator took 505.68 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 93.3 MB in the beginning and 179.1 MB in the end (delta: -85.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:30,669 INFO L168 Benchmark]: Boogie Preprocessor took 93.21 ms. Allocated memory is still 202.9 MB. Free memory was 179.1 MB in the beginning and 176.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:30,670 INFO L168 Benchmark]: RCFGBuilder took 597.17 ms. Allocated memory is still 202.9 MB. Free memory was 176.5 MB in the beginning and 148.6 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:30,671 INFO L168 Benchmark]: TraceAbstraction took 1761.75 ms. Allocated memory was 202.9 MB in the beginning and 237.0 MB in the end (delta: 34.1 MB). Free memory was 148.6 MB in the beginning and 126.3 MB in the end (delta: 22.3 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:30,675 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 112.1 MB in the beginning and 111.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 505.68 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 93.3 MB in the beginning and 179.1 MB in the end (delta: -85.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 93.21 ms. Allocated memory is still 202.9 MB. Free memory was 179.1 MB in the beginning and 176.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 597.17 ms. Allocated memory is still 202.9 MB. Free memory was 176.5 MB in the beginning and 148.6 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1761.75 ms. Allocated memory was 202.9 MB in the beginning and 237.0 MB in the end (delta: 34.1 MB). Free memory was 148.6 MB in the beginning and 126.3 MB in the end (delta: 22.3 MB). Peak memory consumption was 56.4 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.7s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 0.7s 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.4s 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...