java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:27:02,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:27:02,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:27:02,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:27:02,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:27:02,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:27:02,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:27:02,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:27:02,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:27:02,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:27:02,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:27:02,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:27:02,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:27:02,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:27:02,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:27:02,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:27:02,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:27:02,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:27:02,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:27:02,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:27:02,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:27:02,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:27:02,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:27:02,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:27:02,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:27:02,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:27:02,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:27:02,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:27:02,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:27:02,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:27:02,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:27:02,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:27:02,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:27:02,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:27:02,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:27:02,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:27:02,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:27:02,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:27:02,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:27:02,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:27:02,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:27:02,094 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 14:27:02,115 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:27:02,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:27:02,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:27:02,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:27:02,117 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:27:02,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:27:02,117 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:27:02,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:27:02,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:27:02,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:27:02,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:27:02,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:27:02,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:27:02,118 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:27:02,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:27:02,119 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:27:02,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:27:02,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:27:02,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:27:02,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:27:02,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:27:02,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:27:02,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:27:02,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:27:02,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:27:02,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:27:02,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:27:02,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:27:02,123 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:27:02,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:27:02,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:27:02,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:27:02,172 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:27:02,173 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:27:02,174 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-10-02 14:27:02,244 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f920cea/c0aaff140e9e49f3b0663edeeeb45ce2/FLAG17b8703a3 [2019-10-02 14:27:02,748 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:27:02,749 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-10-02 14:27:02,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f920cea/c0aaff140e9e49f3b0663edeeeb45ce2/FLAG17b8703a3 [2019-10-02 14:27:03,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f920cea/c0aaff140e9e49f3b0663edeeeb45ce2 [2019-10-02 14:27:03,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:27:03,078 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:27:03,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:27:03,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:27:03,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:27:03,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:27:03" (1/1) ... [2019-10-02 14:27:03,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343d4392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:03, skipping insertion in model container [2019-10-02 14:27:03,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:27:03" (1/1) ... [2019-10-02 14:27:03,094 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:27:03,148 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:27:03,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:03,559 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:27:03,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:03,664 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:27:03,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:03 WrapperNode [2019-10-02 14:27:03,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:27:03,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:27:03,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:27:03,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:27:03,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:03" (1/1) ... [2019-10-02 14:27:03,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:03" (1/1) ... [2019-10-02 14:27:03,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:03" (1/1) ... [2019-10-02 14:27:03,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:03" (1/1) ... [2019-10-02 14:27:03,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:03" (1/1) ... [2019-10-02 14:27:03,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:03" (1/1) ... [2019-10-02 14:27:03,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:03" (1/1) ... [2019-10-02 14:27:03,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:27:03,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:27:03,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:27:03,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:27:03,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:03" (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-02 14:27:03,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:27:03,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:27:03,827 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:27:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:27:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:27:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:27:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:27:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:27:04,795 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:27:04,795 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 14:27:04,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:04 BoogieIcfgContainer [2019-10-02 14:27:04,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:27:04,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:27:04,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:27:04,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:27:04,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:27:03" (1/3) ... [2019-10-02 14:27:04,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:04, skipping insertion in model container [2019-10-02 14:27:04,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:03" (2/3) ... [2019-10-02 14:27:04,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:04, skipping insertion in model container [2019-10-02 14:27:04,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:04" (3/3) ... [2019-10-02 14:27:04,805 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2019-10-02 14:27:04,815 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:27:04,822 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:27:04,838 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:27:04,869 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:27:04,870 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:27:04,870 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:27:04,870 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:27:04,870 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:27:04,871 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:27:04,871 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:27:04,871 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:27:04,871 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:27:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2019-10-02 14:27:04,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 14:27:04,896 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:04,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:04,898 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:04,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:04,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1483071650, now seen corresponding path program 1 times [2019-10-02 14:27:04,905 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:04,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:04,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:04,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:04,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:05,043 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-02 14:27:05,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:05,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:27:05,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:27:05,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:27:05,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:27:05,062 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2019-10-02 14:27:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:05,096 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2019-10-02 14:27:05,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:27:05,098 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-02 14:27:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:05,110 INFO L225 Difference]: With dead ends: 222 [2019-10-02 14:27:05,110 INFO L226 Difference]: Without dead ends: 104 [2019-10-02 14:27:05,114 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-02 14:27:05,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-02 14:27:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-10-02 14:27:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-02 14:27:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2019-10-02 14:27:05,157 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2019-10-02 14:27:05,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:05,158 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2019-10-02 14:27:05,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:27:05,158 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2019-10-02 14:27:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 14:27:05,160 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:05,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:05,160 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:05,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:05,161 INFO L82 PathProgramCache]: Analyzing trace with hash -736931587, now seen corresponding path program 1 times [2019-10-02 14:27:05,161 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:05,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:05,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:05,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:05,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:05,226 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-02 14:27:05,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:05,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:05,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:05,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:05,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:05,230 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2019-10-02 14:27:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:05,320 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2019-10-02 14:27:05,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:05,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-02 14:27:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:05,322 INFO L225 Difference]: With dead ends: 205 [2019-10-02 14:27:05,322 INFO L226 Difference]: Without dead ends: 107 [2019-10-02 14:27:05,324 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-02 14:27:05,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-02 14:27:05,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-10-02 14:27:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-02 14:27:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2019-10-02 14:27:05,336 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2019-10-02 14:27:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:05,337 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2019-10-02 14:27:05,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2019-10-02 14:27:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 14:27:05,363 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:05,363 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:05,364 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:05,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:05,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1504395429, now seen corresponding path program 1 times [2019-10-02 14:27:05,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:05,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:05,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:10,052 WARN L191 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 113 DAG size of output: 41 [2019-10-02 14:27:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:10,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:10,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:27:10,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:27:10,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:27:10,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:27:10,058 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 4 states. [2019-10-02 14:27:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:10,447 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2019-10-02 14:27:10,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:10,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-02 14:27:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:10,450 INFO L225 Difference]: With dead ends: 209 [2019-10-02 14:27:10,450 INFO L226 Difference]: Without dead ends: 190 [2019-10-02 14:27:10,451 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:27:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-02 14:27:10,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2019-10-02 14:27:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-02 14:27:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2019-10-02 14:27:10,466 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2019-10-02 14:27:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:10,467 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2019-10-02 14:27:10,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:27:10,468 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2019-10-02 14:27:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 14:27:10,469 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:10,470 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:10,470 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:10,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:10,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2142865338, now seen corresponding path program 1 times [2019-10-02 14:27:10,472 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:10,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:10,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:10,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:10,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:10,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:10,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:10,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:10,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:10,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:10,539 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2019-10-02 14:27:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:10,580 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2019-10-02 14:27:10,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:10,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-02 14:27:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:10,582 INFO L225 Difference]: With dead ends: 297 [2019-10-02 14:27:10,582 INFO L226 Difference]: Without dead ends: 128 [2019-10-02 14:27:10,586 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-02 14:27:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-02 14:27:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2019-10-02 14:27:10,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-02 14:27:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2019-10-02 14:27:10,596 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2019-10-02 14:27:10,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:10,597 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2019-10-02 14:27:10,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2019-10-02 14:27:10,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 14:27:10,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:10,599 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:10,599 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:10,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:10,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2011475352, now seen corresponding path program 1 times [2019-10-02 14:27:10,599 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:10,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:10,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:10,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:10,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 14:27:10,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:10,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:10,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:10,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:10,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:10,645 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2019-10-02 14:27:10,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:10,686 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2019-10-02 14:27:10,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:10,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 14:27:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:10,688 INFO L225 Difference]: With dead ends: 230 [2019-10-02 14:27:10,688 INFO L226 Difference]: Without dead ends: 111 [2019-10-02 14:27:10,689 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-02 14:27:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-02 14:27:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2019-10-02 14:27:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-02 14:27:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2019-10-02 14:27:10,697 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2019-10-02 14:27:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:10,698 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2019-10-02 14:27:10,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2019-10-02 14:27:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 14:27:10,699 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:10,700 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:10,700 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:10,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:10,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1818456969, now seen corresponding path program 1 times [2019-10-02 14:27:10,701 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:10,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:10,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:10,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:10,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:18,983 WARN L191 SmtUtils]: Spent 8.15 s on a formula simplification. DAG size of input: 79 DAG size of output: 27 [2019-10-02 14:27:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:18,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:18,990 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:19,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:19,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:27:19,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:19,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:19,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-10-02 14:27:19,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:27:19,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:27:19,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:27:19,148 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 7 states. [2019-10-02 14:27:19,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:19,779 INFO L93 Difference]: Finished difference Result 363 states and 568 transitions. [2019-10-02 14:27:19,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:27:19,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-10-02 14:27:19,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:19,783 INFO L225 Difference]: With dead ends: 363 [2019-10-02 14:27:19,784 INFO L226 Difference]: Without dead ends: 323 [2019-10-02 14:27:19,785 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:27:19,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-02 14:27:19,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 279. [2019-10-02 14:27:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-10-02 14:27:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 438 transitions. [2019-10-02 14:27:19,803 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 438 transitions. Word has length 27 [2019-10-02 14:27:19,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:19,803 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 438 transitions. [2019-10-02 14:27:19,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:27:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 438 transitions. [2019-10-02 14:27:19,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 14:27:19,805 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:19,805 INFO L411 BasicCegarLoop]: trace histogram [3, 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-02 14:27:19,805 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:19,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:19,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1113591962, now seen corresponding path program 1 times [2019-10-02 14:27:19,806 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:19,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:19,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:19,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:19,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 14:27:19,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:19,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:19,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:19,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:19,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:19,856 INFO L87 Difference]: Start difference. First operand 279 states and 438 transitions. Second operand 3 states. [2019-10-02 14:27:19,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:19,893 INFO L93 Difference]: Finished difference Result 552 states and 865 transitions. [2019-10-02 14:27:19,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:19,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-02 14:27:19,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:19,896 INFO L225 Difference]: With dead ends: 552 [2019-10-02 14:27:19,896 INFO L226 Difference]: Without dead ends: 301 [2019-10-02 14:27:19,897 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-02 14:27:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-02 14:27:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2019-10-02 14:27:19,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-10-02 14:27:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 458 transitions. [2019-10-02 14:27:19,915 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 458 transitions. Word has length 29 [2019-10-02 14:27:19,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:19,917 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 458 transitions. [2019-10-02 14:27:19,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 458 transitions. [2019-10-02 14:27:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 14:27:19,923 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:19,923 INFO L411 BasicCegarLoop]: trace histogram [3, 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-02 14:27:19,924 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:19,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:19,924 INFO L82 PathProgramCache]: Analyzing trace with hash 454582667, now seen corresponding path program 1 times [2019-10-02 14:27:19,924 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:19,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:19,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:19,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:19,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:20,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:20,246 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:20,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:20,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:27:20,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 14:27:20,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:27:20,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-10-02 14:27:20,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:27:20,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:27:20,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:27:20,345 INFO L87 Difference]: Start difference. First operand 299 states and 458 transitions. Second operand 6 states. [2019-10-02 14:27:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:20,560 INFO L93 Difference]: Finished difference Result 333 states and 502 transitions. [2019-10-02 14:27:20,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:27:20,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-10-02 14:27:20,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:20,564 INFO L225 Difference]: With dead ends: 333 [2019-10-02 14:27:20,564 INFO L226 Difference]: Without dead ends: 323 [2019-10-02 14:27:20,565 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:27:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-02 14:27:20,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 295. [2019-10-02 14:27:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-02 14:27:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 446 transitions. [2019-10-02 14:27:20,576 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 446 transitions. Word has length 31 [2019-10-02 14:27:20,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:20,577 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 446 transitions. [2019-10-02 14:27:20,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:27:20,577 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 446 transitions. [2019-10-02 14:27:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 14:27:20,578 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:20,579 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:20,579 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:20,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:20,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1646630523, now seen corresponding path program 1 times [2019-10-02 14:27:20,579 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:20,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:20,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:20,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:20,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 14:27:20,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:20,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:20,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:20,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:20,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:20,626 INFO L87 Difference]: Start difference. First operand 295 states and 446 transitions. Second operand 3 states. [2019-10-02 14:27:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:20,662 INFO L93 Difference]: Finished difference Result 514 states and 779 transitions. [2019-10-02 14:27:20,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:20,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-02 14:27:20,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:20,664 INFO L225 Difference]: With dead ends: 514 [2019-10-02 14:27:20,664 INFO L226 Difference]: Without dead ends: 247 [2019-10-02 14:27:20,666 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-02 14:27:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-02 14:27:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2019-10-02 14:27:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-02 14:27:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 365 transitions. [2019-10-02 14:27:20,676 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 365 transitions. Word has length 37 [2019-10-02 14:27:20,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:20,676 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 365 transitions. [2019-10-02 14:27:20,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 365 transitions. [2019-10-02 14:27:20,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 14:27:20,678 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:20,678 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1] [2019-10-02 14:27:20,679 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:20,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:20,679 INFO L82 PathProgramCache]: Analyzing trace with hash -819577482, now seen corresponding path program 1 times [2019-10-02 14:27:20,679 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:20,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:20,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:20,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:20,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 14:27:20,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:20,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:20,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:20,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:20,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:20,744 INFO L87 Difference]: Start difference. First operand 245 states and 365 transitions. Second operand 3 states. [2019-10-02 14:27:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:20,778 INFO L93 Difference]: Finished difference Result 428 states and 636 transitions. [2019-10-02 14:27:20,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:20,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-02 14:27:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:20,780 INFO L225 Difference]: With dead ends: 428 [2019-10-02 14:27:20,780 INFO L226 Difference]: Without dead ends: 229 [2019-10-02 14:27:20,781 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-02 14:27:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-02 14:27:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-10-02 14:27:20,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-02 14:27:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2019-10-02 14:27:20,790 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 41 [2019-10-02 14:27:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:20,790 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2019-10-02 14:27:20,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2019-10-02 14:27:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 14:27:20,791 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:20,791 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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, 1, 1, 1] [2019-10-02 14:27:20,792 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:20,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:20,792 INFO L82 PathProgramCache]: Analyzing trace with hash 711556807, now seen corresponding path program 1 times [2019-10-02 14:27:20,792 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:20,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:20,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:20,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:20,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 14:27:20,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:20,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:20,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:20,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:20,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:20,835 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand 3 states. [2019-10-02 14:27:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:20,862 INFO L93 Difference]: Finished difference Result 309 states and 446 transitions. [2019-10-02 14:27:20,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:20,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-02 14:27:20,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:20,864 INFO L225 Difference]: With dead ends: 309 [2019-10-02 14:27:20,864 INFO L226 Difference]: Without dead ends: 147 [2019-10-02 14:27:20,865 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-02 14:27:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-02 14:27:20,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-10-02 14:27:20,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-02 14:27:20,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2019-10-02 14:27:20,871 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 50 [2019-10-02 14:27:20,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:20,872 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2019-10-02 14:27:20,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2019-10-02 14:27:20,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 14:27:20,873 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:20,873 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:20,873 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:20,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:20,873 INFO L82 PathProgramCache]: Analyzing trace with hash -370372205, now seen corresponding path program 1 times [2019-10-02 14:27:20,873 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:20,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:20,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:20,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:20,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 14:27:21,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:21,055 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:21,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:21,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 14:27:21,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:21,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:21,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-10-02 14:27:21,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:27:21,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:27:21,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:27:21,212 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 10 states. [2019-10-02 14:27:21,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:21,308 INFO L93 Difference]: Finished difference Result 171 states and 237 transitions. [2019-10-02 14:27:21,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:27:21,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-10-02 14:27:21,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:21,310 INFO L225 Difference]: With dead ends: 171 [2019-10-02 14:27:21,310 INFO L226 Difference]: Without dead ends: 164 [2019-10-02 14:27:21,311 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:27:21,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-02 14:27:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2019-10-02 14:27:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-02 14:27:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 224 transitions. [2019-10-02 14:27:21,318 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 224 transitions. Word has length 51 [2019-10-02 14:27:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:21,318 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 224 transitions. [2019-10-02 14:27:21,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:27:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 224 transitions. [2019-10-02 14:27:21,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 14:27:21,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:21,319 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:21,319 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:21,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:21,320 INFO L82 PathProgramCache]: Analyzing trace with hash -379328264, now seen corresponding path program 1 times [2019-10-02 14:27:21,320 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:21,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:21,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:21,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:21,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:21,917 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 26 [2019-10-02 14:27:26,149 WARN L191 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 114 DAG size of output: 24 [2019-10-02 14:27:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:26,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:26,164 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:26,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:26,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 14:27:26,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:26,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:26,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 14:27:26,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:26,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:26,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:26,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:26,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:26,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:26,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2019-10-02 14:27:26,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:27:26,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:27:26,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:27:26,470 INFO L87 Difference]: Start difference. First operand 162 states and 224 transitions. Second operand 12 states. [2019-10-02 14:27:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:27,148 INFO L93 Difference]: Finished difference Result 198 states and 266 transitions. [2019-10-02 14:27:27,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:27:27,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-10-02 14:27:27,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:27,151 INFO L225 Difference]: With dead ends: 198 [2019-10-02 14:27:27,151 INFO L226 Difference]: Without dead ends: 196 [2019-10-02 14:27:27,152 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-10-02 14:27:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-02 14:27:27,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 178. [2019-10-02 14:27:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-10-02 14:27:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 247 transitions. [2019-10-02 14:27:27,161 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 247 transitions. Word has length 61 [2019-10-02 14:27:27,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:27,161 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 247 transitions. [2019-10-02 14:27:27,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:27:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 247 transitions. [2019-10-02 14:27:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 14:27:27,162 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:27,163 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-10-02 14:27:27,163 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:27,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:27,163 INFO L82 PathProgramCache]: Analyzing trace with hash 638427137, now seen corresponding path program 1 times [2019-10-02 14:27:27,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:27,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:27,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:27,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:27,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:27,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:27,625 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:27:27,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:27,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 14:27:27,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:27,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:27,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2019-10-02 14:27:27,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:27:27,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:27:27,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:27:27,821 INFO L87 Difference]: Start difference. First operand 178 states and 247 transitions. Second operand 9 states. [2019-10-02 14:27:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:27,928 INFO L93 Difference]: Finished difference Result 198 states and 274 transitions. [2019-10-02 14:27:27,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:27:27,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-10-02 14:27:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:27,930 INFO L225 Difference]: With dead ends: 198 [2019-10-02 14:27:27,931 INFO L226 Difference]: Without dead ends: 196 [2019-10-02 14:27:27,932 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:27:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-02 14:27:27,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-10-02 14:27:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-02 14:27:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 272 transitions. [2019-10-02 14:27:27,940 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 272 transitions. Word has length 70 [2019-10-02 14:27:27,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:27,941 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 272 transitions. [2019-10-02 14:27:27,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:27:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 272 transitions. [2019-10-02 14:27:27,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 14:27:27,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:27,942 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02 14:27:27,942 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:27,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:27,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1961279789, now seen corresponding path program 1 times [2019-10-02 14:27:27,943 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:27,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:27,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:27,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:27,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:36,527 WARN L191 SmtUtils]: Spent 8.14 s on a formula simplification. DAG size of input: 76 DAG size of output: 23 [2019-10-02 14:27:45,016 WARN L191 SmtUtils]: Spent 8.38 s on a formula simplification. DAG size of input: 185 DAG size of output: 31 [2019-10-02 14:27:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 90 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 14:27:45,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:45,043 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:45,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:45,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-02 14:27:45,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:45,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:27:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:45,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:45,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-10-02 14:27:45,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 14:27:45,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 14:27:45,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:27:45,430 INFO L87 Difference]: Start difference. First operand 196 states and 272 transitions. Second operand 16 states. [2019-10-02 14:27:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:45,701 INFO L93 Difference]: Finished difference Result 215 states and 299 transitions. [2019-10-02 14:27:45,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:27:45,701 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2019-10-02 14:27:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:45,702 INFO L225 Difference]: With dead ends: 215 [2019-10-02 14:27:45,702 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 14:27:45,703 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-10-02 14:27:45,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 14:27:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 14:27:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 14:27:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 14:27:45,706 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2019-10-02 14:27:45,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:45,707 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 14:27:45,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 14:27:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 14:27:45,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 14:27:45,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 14:27:46,133 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-10-02 14:27:46,137 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 14:27:46,137 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-02 14:27:46,138 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 14:27:46,138 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 14:27:46,138 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 14:27:46,138 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 14:27:46,138 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 14:27:46,138 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed. [2019-10-02 14:27:46,138 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2019-10-02 14:27:46,139 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-10-02 14:27:46,139 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-10-02 14:27:46,139 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2019-10-02 14:27:46,140 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed. [2019-10-02 14:27:46,140 INFO L443 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2019-10-02 14:27:46,140 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2019-10-02 14:27:46,140 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2019-10-02 14:27:46,140 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2019-10-02 14:27:46,140 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2019-10-02 14:27:46,140 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2019-10-02 14:27:46,141 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2019-10-02 14:27:46,141 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2019-10-02 14:27:46,141 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2019-10-02 14:27:46,142 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2019-10-02 14:27:46,142 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2019-10-02 14:27:46,142 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2019-10-02 14:27:46,142 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2019-10-02 14:27:46,142 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2019-10-02 14:27:46,143 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2019-10-02 14:27:46,143 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2019-10-02 14:27:46,143 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2019-10-02 14:27:46,143 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2019-10-02 14:27:46,143 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2019-10-02 14:27:46,143 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2019-10-02 14:27:46,143 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2019-10-02 14:27:46,143 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2019-10-02 14:27:46,143 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2019-10-02 14:27:46,144 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2019-10-02 14:27:46,144 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2019-10-02 14:27:46,144 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2019-10-02 14:27:46,144 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-10-02 14:27:46,144 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-10-02 14:27:46,144 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2019-10-02 14:27:46,144 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2019-10-02 14:27:46,144 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2019-10-02 14:27:46,144 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2019-10-02 14:27:46,145 INFO L443 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2019-10-02 14:27:46,145 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2019-10-02 14:27:46,145 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2019-10-02 14:27:46,145 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2019-10-02 14:27:46,145 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2019-10-02 14:27:46,145 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-10-02 14:27:46,145 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2019-10-02 14:27:46,145 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2019-10-02 14:27:46,145 INFO L443 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-10-02 14:27:46,145 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-10-02 14:27:46,146 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2019-10-02 14:27:46,146 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2019-10-02 14:27:46,146 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-10-02 14:27:46,146 INFO L443 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-10-02 14:27:46,146 INFO L439 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2019-10-02 14:27:46,146 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2019-10-02 14:27:46,147 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-10-02 14:27:46,147 INFO L443 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2019-10-02 14:27:46,147 INFO L439 ceAbstractionStarter]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= 5 main_~q~0) (<= 0 (+ main_~P8~0 2147483648)) (<= main_~P8~0 2147483647) .cse0 (<= main_~this_expect~0 (+ (* 2 (div (+ main_~this_expect~0 (- 2)) 2)) 2)) .cse1) (and (<= main_~this_expect~0 0) (<= 0 main_~this_expect~0) (= main_~q~0 0) .cse0 .cse1))) [2019-10-02 14:27:46,147 INFO L443 ceAbstractionStarter]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2019-10-02 14:27:46,148 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2019-10-02 14:27:46,148 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2019-10-02 14:27:46,148 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2019-10-02 14:27:46,148 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2019-10-02 14:27:46,149 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2019-10-02 14:27:46,149 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2019-10-02 14:27:46,149 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2019-10-02 14:27:46,150 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2019-10-02 14:27:46,150 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2019-10-02 14:27:46,150 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2019-10-02 14:27:46,150 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2019-10-02 14:27:46,150 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2019-10-02 14:27:46,151 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-10-02 14:27:46,151 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2019-10-02 14:27:46,151 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2019-10-02 14:27:46,151 INFO L439 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0)) (.cse5 (<= main_~this_expect~0 (+ (* 2 (div (+ main_~this_expect~0 (- 1)) 2)) 1))) (.cse2 (<= 0 (+ main_~P8~0 2147483648))) (.cse3 (<= main_~P8~0 2147483647)) (.cse4 (<= main_~this_expect~0 (+ (* 2 (div (+ main_~this_expect~0 (- 2)) 2)) 2)))) (or (and (<= main_~this_expect~0 0) (= main_~q~0 0) (<= 0 main_~this_expect~0) .cse0 .cse1) (and (<= 5 main_~q~0) .cse2 .cse3 .cse0 .cse4 .cse1) (and .cse2 .cse5 .cse3 (= 3 main_~q~0) .cse0 .cse1) (and (= 4 main_~q~0) (<= main_~this_buffer_empty~0 1) .cse2 .cse5 (<= 1 main_~this_buffer_empty~0) .cse3) (and (and (= main_~this_buffer_empty~0 1) .cse2 .cse3 (= 1 main_~q~0)) .cse4))) [2019-10-02 14:27:46,152 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2019-10-02 14:27:46,152 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2019-10-02 14:27:46,152 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2019-10-02 14:27:46,152 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2019-10-02 14:27:46,154 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2019-10-02 14:27:46,154 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2019-10-02 14:27:46,155 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2019-10-02 14:27:46,155 INFO L443 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2019-10-02 14:27:46,155 INFO L443 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2019-10-02 14:27:46,156 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2019-10-02 14:27:46,156 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2019-10-02 14:27:46,156 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2019-10-02 14:27:46,156 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2019-10-02 14:27:46,156 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true [2019-10-02 14:27:46,156 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2019-10-02 14:27:46,157 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2019-10-02 14:27:46,157 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2019-10-02 14:27:46,157 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2019-10-02 14:27:46,157 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2019-10-02 14:27:46,157 INFO L443 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2019-10-02 14:27:46,158 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2019-10-02 14:27:46,158 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2019-10-02 14:27:46,158 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2019-10-02 14:27:46,158 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-10-02 14:27:46,158 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2019-10-02 14:27:46,158 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2019-10-02 14:27:46,159 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-10-02 14:27:46,159 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2019-10-02 14:27:46,159 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2019-10-02 14:27:46,159 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2019-10-02 14:27:46,159 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2019-10-02 14:27:46,160 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-10-02 14:27:46,160 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-10-02 14:27:46,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 02:27:46 BoogieIcfgContainer [2019-10-02 14:27:46,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 14:27:46,212 INFO L168 Benchmark]: Toolchain (without parser) took 43130.24 ms. Allocated memory was 134.7 MB in the beginning and 341.8 MB in the end (delta: 207.1 MB). Free memory was 89.1 MB in the beginning and 202.4 MB in the end (delta: -113.3 MB). Peak memory consumption was 93.8 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:46,214 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory was 107.8 MB in the beginning and 107.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 14:27:46,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 585.78 ms. Allocated memory was 134.7 MB in the beginning and 201.9 MB in the end (delta: 67.1 MB). Free memory was 88.9 MB in the beginning and 171.7 MB in the end (delta: -82.8 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:46,217 INFO L168 Benchmark]: Boogie Preprocessor took 87.26 ms. Allocated memory is still 201.9 MB. Free memory was 171.7 MB in the beginning and 168.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:46,220 INFO L168 Benchmark]: RCFGBuilder took 1043.84 ms. Allocated memory is still 201.9 MB. Free memory was 168.0 MB in the beginning and 115.2 MB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:46,222 INFO L168 Benchmark]: TraceAbstraction took 41409.33 ms. Allocated memory was 201.9 MB in the beginning and 341.8 MB in the end (delta: 140.0 MB). Free memory was 114.6 MB in the beginning and 202.4 MB in the end (delta: -87.8 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:46,229 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 134.7 MB. Free memory was 107.8 MB in the beginning and 107.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 585.78 ms. Allocated memory was 134.7 MB in the beginning and 201.9 MB in the end (delta: 67.1 MB). Free memory was 88.9 MB in the beginning and 171.7 MB in the end (delta: -82.8 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 87.26 ms. Allocated memory is still 201.9 MB. Free memory was 171.7 MB in the beginning and 168.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1043.84 ms. Allocated memory is still 201.9 MB. Free memory was 168.0 MB in the beginning and 115.2 MB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41409.33 ms. Allocated memory was 201.9 MB in the beginning and 341.8 MB in the end (delta: 140.0 MB). Free memory was 114.6 MB in the beginning and 202.4 MB in the end (delta: -87.8 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((5 <= q && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= this_buffer_empty) || ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((this_expect <= 0 && q == 0) && 0 <= this_expect) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || (((((5 <= q && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= this_buffer_empty)) || (((((0 <= P8 + 2147483648 && this_expect <= 2 * ((this_expect + -1) / 2) + 1) && P8 <= 2147483647) && 3 == q) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || (((((4 == q && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && this_expect <= 2 * ((this_expect + -1) / 2) + 1) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((((this_buffer_empty == 1 && 0 <= P8 + 2147483648) && P8 <= 2147483647) && 1 == q) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 41.2s OverallTime, 15 OverallIterations, 8 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2349 SDtfs, 2277 SDslu, 6319 SDs, 0 SdLazy, 1059 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 335 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 35.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=7, 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, 15 MinimizatonAttempts, 118 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 22 NumberOfFragments, 182 HoareAnnotationTreeSize, 7 FomulaSimplifications, 3613 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 224 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 36.1s InterpolantComputationTime, 892 NumberOfCodeBlocks, 892 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 871 ConstructedInterpolants, 0 QuantifiedInterpolants, 533460 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2228 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 215/668 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...