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/recursive-simple/fibo_2calls_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:26:43,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:26:43,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:26:43,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:26:43,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:26:43,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:26:43,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:26:43,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:26:43,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:26:43,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:26:43,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:26:43,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:26:43,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:26:43,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:26:43,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:26:43,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:26:43,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:26:43,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:26:43,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:26:43,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:26:43,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:26:43,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:26:43,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:26:43,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:26:43,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:26:43,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:26:43,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:26:43,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:26:43,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:26:43,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:26:43,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:26:43,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:26:43,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:26:43,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:26:43,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:26:43,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:26:43,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:26:43,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:26:43,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:26:43,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:26:43,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:26:43,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 06:26:43,300 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:26:43,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:26:43,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:26:43,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:26:43,303 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:26:43,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:26:43,304 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:26:43,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:26:43,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:26:43,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:26:43,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:26:43,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:26:43,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:26:43,305 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:26:43,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:26:43,305 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:26:43,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:26:43,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:26:43,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:26:43,306 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:26:43,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:26:43,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:26:43,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:26:43,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:26:43,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:26:43,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:26:43,308 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:26:43,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:26:43,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:26:43,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:26:43,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:26:43,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:26:43,380 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:26:43,380 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:26:43,381 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2019-09-08 06:26:43,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed1b70e2/f6217bf499ff4fc980cdfbbb139fb20c/FLAG9cf9e2b29 [2019-09-08 06:26:44,059 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:26:44,063 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2019-09-08 06:26:44,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed1b70e2/f6217bf499ff4fc980cdfbbb139fb20c/FLAG9cf9e2b29 [2019-09-08 06:26:44,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed1b70e2/f6217bf499ff4fc980cdfbbb139fb20c [2019-09-08 06:26:44,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:26:44,381 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:26:44,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:26:44,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:26:44,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:26:44,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:26:44" (1/1) ... [2019-09-08 06:26:44,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6598ff7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:26:44, skipping insertion in model container [2019-09-08 06:26:44,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:26:44" (1/1) ... [2019-09-08 06:26:44,400 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:26:44,424 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:26:44,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:26:44,676 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:26:44,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:26:44,707 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:26:44,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:26:44 WrapperNode [2019-09-08 06:26:44,708 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:26:44,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:26:44,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:26:44,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:26:44,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:26:44" (1/1) ... [2019-09-08 06:26:44,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:26:44" (1/1) ... [2019-09-08 06:26:44,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:26:44" (1/1) ... [2019-09-08 06:26:44,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:26:44" (1/1) ... [2019-09-08 06:26:44,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:26:44" (1/1) ... [2019-09-08 06:26:44,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:26:44" (1/1) ... [2019-09-08 06:26:44,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:26:44" (1/1) ... [2019-09-08 06:26:44,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:26:44,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:26:44,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:26:44,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:26:44,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:26:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:26:44,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:26:44,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:26:44,946 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-09-08 06:26:44,946 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-09-08 06:26:44,946 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:26:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:26:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:26:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-09-08 06:26:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-09-08 06:26:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:26:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:26:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:26:45,227 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:26:45,228 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 06:26:45,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:26:45 BoogieIcfgContainer [2019-09-08 06:26:45,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:26:45,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:26:45,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:26:45,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:26:45,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:26:44" (1/3) ... [2019-09-08 06:26:45,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265f6892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:26:45, skipping insertion in model container [2019-09-08 06:26:45,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:26:44" (2/3) ... [2019-09-08 06:26:45,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265f6892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:26:45, skipping insertion in model container [2019-09-08 06:26:45,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:26:45" (3/3) ... [2019-09-08 06:26:45,274 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2019-09-08 06:26:45,289 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:26:45,300 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:26:45,335 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:26:45,402 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:26:45,404 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:26:45,404 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:26:45,404 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:26:45,404 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:26:45,405 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:26:45,405 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:26:45,405 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:26:45,405 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:26:45,426 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-08 06:26:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 06:26:45,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:26:45,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:26:45,435 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:26:45,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:26:45,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2019-09-08 06:26:45,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:26:45,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:26:45,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:45,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:45,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:45,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:26:45,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:26:45,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:26:45,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:26:45,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:26:45,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:26:45,678 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2019-09-08 06:26:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:26:45,831 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-09-08 06:26:45,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:26:45,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-08 06:26:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:26:45,850 INFO L225 Difference]: With dead ends: 44 [2019-09-08 06:26:45,850 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 06:26:45,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:26:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 06:26:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-08 06:26:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 06:26:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-08 06:26:45,932 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2019-09-08 06:26:45,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:26:45,933 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-08 06:26:45,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:26:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-08 06:26:45,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 06:26:45,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:26:45,939 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:26:45,940 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:26:45,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:26:45,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2019-09-08 06:26:45,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:26:45,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:26:45,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:45,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:45,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:26:46,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:26:46,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:26:46,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:26:46,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:26:46,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:26:46,061 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2019-09-08 06:26:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:26:46,191 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-09-08 06:26:46,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:26:46,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-08 06:26:46,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:26:46,194 INFO L225 Difference]: With dead ends: 36 [2019-09-08 06:26:46,194 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 06:26:46,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:26:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 06:26:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-09-08 06:26:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 06:26:46,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-08 06:26:46,207 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2019-09-08 06:26:46,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:26:46,208 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-08 06:26:46,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:26:46,208 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-08 06:26:46,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 06:26:46,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:26:46,210 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:26:46,211 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:26:46,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:26:46,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2019-09-08 06:26:46,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:26:46,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:26:46,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:46,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:46,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 06:26:46,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:26:46,342 INFO L223 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-09-08 06:26:46,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:46,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:26:46,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:26:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 06:26:46,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:26:46,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2019-09-08 06:26:46,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:26:46,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:26:46,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:26:46,552 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2019-09-08 06:26:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:26:46,940 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2019-09-08 06:26:46,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 06:26:46,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-09-08 06:26:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:26:46,945 INFO L225 Difference]: With dead ends: 58 [2019-09-08 06:26:46,945 INFO L226 Difference]: Without dead ends: 34 [2019-09-08 06:26:46,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:26:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-08 06:26:46,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-08 06:26:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-08 06:26:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-09-08 06:26:46,974 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2019-09-08 06:26:46,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:26:46,976 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-09-08 06:26:46,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:26:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-09-08 06:26:46,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 06:26:46,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:26:46,981 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:26:46,982 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:26:46,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:26:46,983 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2019-09-08 06:26:46,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:26:46,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:26:46,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:46,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:46,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 06:26:47,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:26:47,151 INFO L223 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-09-08 06:26:47,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:47,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:26:47,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:26:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 06:26:47,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:26:47,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 06:26:47,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:26:47,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:26:47,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:26:47,251 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2019-09-08 06:26:47,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:26:47,407 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2019-09-08 06:26:47,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:26:47,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-09-08 06:26:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:26:47,410 INFO L225 Difference]: With dead ends: 43 [2019-09-08 06:26:47,410 INFO L226 Difference]: Without dead ends: 39 [2019-09-08 06:26:47,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:26:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-08 06:26:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-09-08 06:26:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 06:26:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-09-08 06:26:47,424 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2019-09-08 06:26:47,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:26:47,428 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-09-08 06:26:47,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:26:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2019-09-08 06:26:47,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 06:26:47,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:26:47,430 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 06:26:47,432 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:26:47,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:26:47,432 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2019-09-08 06:26:47,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:26:47,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:26:47,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:47,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:47,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 06:26:47,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:26:47,553 INFO L223 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-09-08 06:26:47,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:47,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:26:47,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:26:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:26:47,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:26:47,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2019-09-08 06:26:47,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 06:26:47,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 06:26:47,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:26:47,691 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 10 states. [2019-09-08 06:26:48,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:26:48,012 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2019-09-08 06:26:48,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:26:48,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-09-08 06:26:48,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:26:48,015 INFO L225 Difference]: With dead ends: 70 [2019-09-08 06:26:48,015 INFO L226 Difference]: Without dead ends: 39 [2019-09-08 06:26:48,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:26:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-08 06:26:48,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-08 06:26:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 06:26:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-09-08 06:26:48,028 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 39 [2019-09-08 06:26:48,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:26:48,029 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-09-08 06:26:48,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 06:26:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2019-09-08 06:26:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 06:26:48,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:26:48,031 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 06:26:48,032 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:26:48,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:26:48,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2019-09-08 06:26:48,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:26:48,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:26:48,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:48,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:48,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:48,233 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 06:26:48,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:26:48,234 INFO L223 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-09-08 06:26:48,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:48,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:26:48,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:26:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 06:26:48,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:26:48,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-09-08 06:26:48,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 06:26:48,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 06:26:48,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:26:48,431 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 14 states. [2019-09-08 06:26:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:26:49,121 INFO L93 Difference]: Finished difference Result 102 states and 162 transitions. [2019-09-08 06:26:49,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 06:26:49,122 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-09-08 06:26:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:26:49,124 INFO L225 Difference]: With dead ends: 102 [2019-09-08 06:26:49,125 INFO L226 Difference]: Without dead ends: 69 [2019-09-08 06:26:49,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2019-09-08 06:26:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-08 06:26:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-09-08 06:26:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-08 06:26:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2019-09-08 06:26:49,163 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 40 [2019-09-08 06:26:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:26:49,163 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2019-09-08 06:26:49,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 06:26:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2019-09-08 06:26:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 06:26:49,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:26:49,167 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-09-08 06:26:49,168 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:26:49,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:26:49,168 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2019-09-08 06:26:49,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:26:49,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:26:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:49,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:26:49,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:26:49,289 INFO L223 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-09-08 06:26:49,313 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-09-08 06:26:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:49,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 06:26:49,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:26:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 06:26:49,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:26:49,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2019-09-08 06:26:49,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 06:26:49,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 06:26:49,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:26:49,428 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand 12 states. [2019-09-08 06:26:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:26:49,776 INFO L93 Difference]: Finished difference Result 106 states and 197 transitions. [2019-09-08 06:26:49,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 06:26:49,776 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-09-08 06:26:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:26:49,780 INFO L225 Difference]: With dead ends: 106 [2019-09-08 06:26:49,780 INFO L226 Difference]: Without dead ends: 102 [2019-09-08 06:26:49,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-09-08 06:26:49,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-08 06:26:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 68. [2019-09-08 06:26:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-08 06:26:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 110 transitions. [2019-09-08 06:26:49,805 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 110 transitions. Word has length 54 [2019-09-08 06:26:49,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:26:49,806 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 110 transitions. [2019-09-08 06:26:49,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 06:26:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 110 transitions. [2019-09-08 06:26:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 06:26:49,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:26:49,812 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:26:49,813 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:26:49,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:26:49,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2119203654, now seen corresponding path program 1 times [2019-09-08 06:26:49,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:26:49,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:26:49,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:49,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:49,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 81 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-09-08 06:26:50,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:26:50,029 INFO L223 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-09-08 06:26:50,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:50,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:26:50,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:26:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 36 proven. 58 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-08 06:26:50,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:26:50,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2019-09-08 06:26:50,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 06:26:50,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 06:26:50,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:26:50,245 INFO L87 Difference]: Start difference. First operand 68 states and 110 transitions. Second operand 15 states. [2019-09-08 06:26:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:26:51,025 INFO L93 Difference]: Finished difference Result 167 states and 346 transitions. [2019-09-08 06:26:51,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 06:26:51,026 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 110 [2019-09-08 06:26:51,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:26:51,031 INFO L225 Difference]: With dead ends: 167 [2019-09-08 06:26:51,032 INFO L226 Difference]: Without dead ends: 105 [2019-09-08 06:26:51,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2019-09-08 06:26:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-08 06:26:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2019-09-08 06:26:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-08 06:26:51,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 154 transitions. [2019-09-08 06:26:51,063 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 154 transitions. Word has length 110 [2019-09-08 06:26:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:26:51,064 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 154 transitions. [2019-09-08 06:26:51,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 06:26:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 154 transitions. [2019-09-08 06:26:51,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 06:26:51,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:26:51,068 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:26:51,069 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:26:51,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:26:51,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2011292190, now seen corresponding path program 1 times [2019-09-08 06:26:51,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:26:51,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:26:51,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:51,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:51,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 103 proven. 27 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2019-09-08 06:26:51,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:26:51,260 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:26:51,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:51,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 06:26:51,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:26:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 117 proven. 47 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:26:51,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:26:51,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2019-09-08 06:26:51,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 06:26:51,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 06:26:51,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:26:51,485 INFO L87 Difference]: Start difference. First operand 99 states and 154 transitions. Second operand 14 states. [2019-09-08 06:26:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:26:51,867 INFO L93 Difference]: Finished difference Result 133 states and 223 transitions. [2019-09-08 06:26:51,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 06:26:51,868 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 136 [2019-09-08 06:26:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:26:51,877 INFO L225 Difference]: With dead ends: 133 [2019-09-08 06:26:51,878 INFO L226 Difference]: Without dead ends: 129 [2019-09-08 06:26:51,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-09-08 06:26:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-08 06:26:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2019-09-08 06:26:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-08 06:26:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 177 transitions. [2019-09-08 06:26:51,937 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 177 transitions. Word has length 136 [2019-09-08 06:26:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:26:51,939 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 177 transitions. [2019-09-08 06:26:51,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 06:26:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 177 transitions. [2019-09-08 06:26:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 06:26:51,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:26:51,944 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:26:51,944 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:26:51,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:26:51,945 INFO L82 PathProgramCache]: Analyzing trace with hash 265701462, now seen corresponding path program 2 times [2019-09-08 06:26:51,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:26:51,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:26:51,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:51,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:51,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 55 proven. 61 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-09-08 06:26:52,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:26:52,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:26:52,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:26:52,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:26:52,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:26:52,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 06:26:52,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:26:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 55 proven. 61 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-09-08 06:26:52,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:26:52,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-08 06:26:52,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:26:52,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:26:52,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:26:52,260 INFO L87 Difference]: Start difference. First operand 108 states and 177 transitions. Second operand 9 states. [2019-09-08 06:26:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:26:52,498 INFO L93 Difference]: Finished difference Result 146 states and 273 transitions. [2019-09-08 06:26:52,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:26:52,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2019-09-08 06:26:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:26:52,503 INFO L225 Difference]: With dead ends: 146 [2019-09-08 06:26:52,504 INFO L226 Difference]: Without dead ends: 108 [2019-09-08 06:26:52,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 06:26:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-08 06:26:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-09-08 06:26:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-08 06:26:52,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2019-09-08 06:26:52,524 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 110 [2019-09-08 06:26:52,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:26:52,525 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2019-09-08 06:26:52,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:26:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2019-09-08 06:26:52,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 06:26:52,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:26:52,530 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:26:52,530 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:26:52,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:26:52,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1677699577, now seen corresponding path program 3 times [2019-09-08 06:26:52,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:26:52,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:26:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:52,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:26:52,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:52,798 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 57 proven. 61 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 06:26:52,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:26:52,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:26:52,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:26:52,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 06:26:52,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:26:52,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:26:52,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:26:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 64 proven. 4 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-09-08 06:26:52,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:26:52,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 17 [2019-09-08 06:26:52,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 06:26:52,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 06:26:52,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 06:26:52,934 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand 17 states. [2019-09-08 06:26:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:26:53,569 INFO L93 Difference]: Finished difference Result 221 states and 363 transitions. [2019-09-08 06:26:53,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 06:26:53,570 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-09-08 06:26:53,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:26:53,573 INFO L225 Difference]: With dead ends: 221 [2019-09-08 06:26:53,573 INFO L226 Difference]: Without dead ends: 125 [2019-09-08 06:26:53,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2019-09-08 06:26:53,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-08 06:26:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2019-09-08 06:26:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-08 06:26:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2019-09-08 06:26:53,594 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 96 [2019-09-08 06:26:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:26:53,595 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2019-09-08 06:26:53,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 06:26:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2019-09-08 06:26:53,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 06:26:53,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:26:53,598 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:26:53,599 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:26:53,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:26:53,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1540036056, now seen corresponding path program 4 times [2019-09-08 06:26:53,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:26:53,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:26:53,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:53,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:26:53,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-09-08 06:26:54,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:26:54,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:26:54,205 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:26:54,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:26:54,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:26:54,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-08 06:26:54,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:26:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-09-08 06:26:54,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:26:54,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 28 [2019-09-08 06:26:54,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 06:26:54,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 06:26:54,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2019-09-08 06:26:54,625 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand 28 states. [2019-09-08 06:26:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:26:54,960 INFO L93 Difference]: Finished difference Result 151 states and 231 transitions. [2019-09-08 06:26:54,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 06:26:54,961 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 109 [2019-09-08 06:26:54,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:26:54,964 INFO L225 Difference]: With dead ends: 151 [2019-09-08 06:26:54,964 INFO L226 Difference]: Without dead ends: 147 [2019-09-08 06:26:54,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 106 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2019-09-08 06:26:54,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-08 06:26:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 116. [2019-09-08 06:26:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-08 06:26:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 171 transitions. [2019-09-08 06:26:54,980 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 171 transitions. Word has length 109 [2019-09-08 06:26:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:26:54,980 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 171 transitions. [2019-09-08 06:26:54,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 06:26:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 171 transitions. [2019-09-08 06:26:54,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 06:26:54,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:26:54,983 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:26:54,984 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:26:54,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:26:54,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2095197631, now seen corresponding path program 1 times [2019-09-08 06:26:54,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:26:54,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:26:54,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:54,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:26:54,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:26:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 46 proven. 118 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-09-08 06:26:55,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:26:55,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:26:55,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:26:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:26:55,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 06:26:55,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:26:55,287 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 50 proven. 112 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-08 06:26:55,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:26:55,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2019-09-08 06:26:55,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 06:26:55,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 06:26:55,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:26:55,295 INFO L87 Difference]: Start difference. First operand 116 states and 171 transitions. Second operand 14 states. [2019-09-08 06:26:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:26:55,565 INFO L93 Difference]: Finished difference Result 131 states and 201 transitions. [2019-09-08 06:26:55,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:26:55,566 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 123 [2019-09-08 06:26:55,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:26:55,571 INFO L225 Difference]: With dead ends: 131 [2019-09-08 06:26:55,571 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 06:26:55,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-09-08 06:26:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 06:26:55,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 06:26:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 06:26:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 06:26:55,574 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2019-09-08 06:26:55,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:26:55,574 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 06:26:55,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 06:26:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 06:26:55,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 06:26:55,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 06:26:56,567 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 23 [2019-09-08 06:26:56,944 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 25 [2019-09-08 06:26:56,948 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-08 06:26:56,949 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 06:26:56,949 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 06:26:56,949 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-08 06:26:56,949 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 06:26:56,949 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 06:26:56,949 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2019-09-08 06:26:56,949 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 35 42) no Hoare annotation was computed. [2019-09-08 06:26:56,950 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-09-08 06:26:56,950 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 35 42) no Hoare annotation was computed. [2019-09-08 06:26:56,950 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-09-08 06:26:56,950 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-09-08 06:26:56,950 INFO L439 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (and (<= 5 main_~x~0) (<= main_~x~0 5)) [2019-09-08 06:26:56,950 INFO L443 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2019-09-08 06:26:56,950 INFO L443 ceAbstractionStarter]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2019-09-08 06:26:56,952 INFO L446 ceAbstractionStarter]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2019-09-08 06:26:56,952 INFO L439 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (<= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| fibo2_~n) (<= 2 |fibo2_#in~n|)) [2019-09-08 06:26:56,952 INFO L443 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-09-08 06:26:56,952 INFO L439 ceAbstractionStarter]: At program point L23-2(line 23) the Hoare annotation is: (and (<= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| fibo2_~n) (or (and (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 1) (<= |fibo2_#in~n| 3) (<= 2 |fibo2_#in~n|)) (<= 5 |fibo2_#in~n|) (and (<= |fibo2_#t~ret2| 2) (<= 4 fibo2_~n) (<= 2 |fibo2_#t~ret2|)))) [2019-09-08 06:26:56,954 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. [2019-09-08 06:26:56,954 INFO L443 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2019-09-08 06:26:56,954 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 24) no Hoare annotation was computed. [2019-09-08 06:26:56,954 INFO L443 ceAbstractionStarter]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2019-09-08 06:26:56,955 INFO L443 ceAbstractionStarter]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2019-09-08 06:26:56,955 INFO L446 ceAbstractionStarter]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2019-09-08 06:26:56,955 INFO L439 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: (and (<= fibo1_~n |fibo1_#in~n|) (< 1 fibo1_~n) (<= |fibo1_#in~n| fibo1_~n)) [2019-09-08 06:26:56,956 INFO L443 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2019-09-08 06:26:56,957 INFO L439 ceAbstractionStarter]: At program point L13-2(line 13) the Hoare annotation is: (and (<= fibo1_~n |fibo1_#in~n|) (not (<= |fibo1_#in~n| 1)) (or (and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1)) (<= 4 |fibo1_#in~n|)) (let ((.cse0 (<= |fibo1_#in~n| fibo1_~n))) (or (and (<= 6 |fibo1_#in~n|) .cse0) (and (<= 3 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 3) .cse0) (and .cse0 (<= |fibo1_#in~n| 4))))) [2019-09-08 06:26:56,957 INFO L443 ceAbstractionStarter]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2019-09-08 06:26:56,957 INFO L443 ceAbstractionStarter]: For program point L10(lines 10 14) no Hoare annotation was computed. [2019-09-08 06:26:56,957 INFO L443 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-09-08 06:26:56,958 INFO L443 ceAbstractionStarter]: For program point L8(lines 8 14) no Hoare annotation was computed. [2019-09-08 06:26:56,961 INFO L443 ceAbstractionStarter]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2019-09-08 06:26:56,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 06:26:56 BoogieIcfgContainer [2019-09-08 06:26:56,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 06:26:56,982 INFO L168 Benchmark]: Toolchain (without parser) took 12594.81 ms. Allocated memory was 133.2 MB in the beginning and 344.5 MB in the end (delta: 211.3 MB). Free memory was 89.6 MB in the beginning and 105.8 MB in the end (delta: -16.2 MB). Peak memory consumption was 195.1 MB. Max. memory is 7.1 GB. [2019-09-08 06:26:56,983 INFO L168 Benchmark]: CDTParser took 0.69 ms. Allocated memory is still 133.2 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-08 06:26:56,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.45 ms. Allocated memory is still 133.2 MB. Free memory was 89.2 MB in the beginning and 79.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-09-08 06:26:56,989 INFO L168 Benchmark]: Boogie Preprocessor took 166.69 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 79.5 MB in the beginning and 177.7 MB in the end (delta: -98.3 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-09-08 06:26:56,992 INFO L168 Benchmark]: RCFGBuilder took 355.62 ms. Allocated memory is still 200.8 MB. Free memory was 176.8 MB in the beginning and 164.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2019-09-08 06:26:56,993 INFO L168 Benchmark]: TraceAbstraction took 11726.41 ms. Allocated memory was 200.8 MB in the beginning and 344.5 MB in the end (delta: 143.7 MB). Free memory was 164.3 MB in the beginning and 105.8 MB in the end (delta: 58.5 MB). Peak memory consumption was 202.2 MB. Max. memory is 7.1 GB. [2019-09-08 06:26:57,002 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.69 ms. Allocated memory is still 133.2 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 325.45 ms. Allocated memory is still 133.2 MB. Free memory was 89.2 MB in the beginning and 79.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 166.69 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 79.5 MB in the beginning and 177.7 MB in the end (delta: -98.3 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 355.62 ms. Allocated memory is still 200.8 MB. Free memory was 176.8 MB in the beginning and 164.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11726.41 ms. Allocated memory was 200.8 MB in the beginning and 344.5 MB in the end (delta: 143.7 MB). Free memory was 164.3 MB in the beginning and 105.8 MB in the end (delta: 58.5 MB). Peak memory consumption was 202.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. SAFE Result, 11.5s OverallTime, 13 OverallIterations, 10 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 406 SDtfs, 389 SDslu, 2767 SDs, 0 SdLazy, 2502 SolverSat, 356 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1091 GetRequests, 875 SyntacticMatches, 12 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=12, 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.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 118 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 221 PreInvPairs, 559 NumberOfFragments, 113 HoareAnnotationTreeSize, 221 FomulaSimplifications, 10003 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 11 FomulaSimplificationsInter, 1747 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1767 NumberOfCodeBlocks, 1706 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1743 ConstructedInterpolants, 0 QuantifiedInterpolants, 337839 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1807 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 2875/3758 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...