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/id_o20.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:28:01,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:28:01,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:28:01,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:28:01,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:28:01,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:28:01,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:28:01,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:28:01,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:28:01,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:28:01,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:28:01,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:28:01,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:28:01,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:28:01,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:28:01,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:28:01,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:28:01,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:28:01,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:28:01,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:28:01,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:28:01,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:28:01,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:28:01,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:28:01,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:28:01,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:28:01,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:28:01,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:28:01,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:28:01,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:28:01,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:28:01,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:28:01,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:28:01,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:28:01,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:28:01,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:28:01,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:28:01,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:28:01,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:28:01,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:28:01,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:28:01,418 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:28:01,433 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:28:01,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:28:01,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:28:01,435 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:28:01,435 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:28:01,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:28:01,438 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:28:01,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:28:01,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:28:01,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:28:01,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:28:01,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:28:01,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:28:01,439 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:28:01,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:28:01,440 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:28:01,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:28:01,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:28:01,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:28:01,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:28:01,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:28:01,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:28:01,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:28:01,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:28:01,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:28:01,443 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:28:01,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:28:01,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:28:01,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:28:01,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:28:01,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:28:01,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:28:01,491 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:28:01,492 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:28:01,493 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_o20.c [2019-09-08 06:28:01,557 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0878f2318/2f948b6913a7400eb981d2047712c507/FLAGde5d8105e [2019-09-08 06:28:02,012 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:28:02,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_o20.c [2019-09-08 06:28:02,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0878f2318/2f948b6913a7400eb981d2047712c507/FLAGde5d8105e [2019-09-08 06:28:02,435 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0878f2318/2f948b6913a7400eb981d2047712c507 [2019-09-08 06:28:02,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:28:02,448 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:28:02,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:28:02,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:28:02,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:28:02,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:28:02" (1/1) ... [2019-09-08 06:28:02,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47bcba9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:02, skipping insertion in model container [2019-09-08 06:28:02,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:28:02" (1/1) ... [2019-09-08 06:28:02,464 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:28:02,478 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:28:02,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:28:02,664 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:28:02,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:28:02,688 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:28:02,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:02 WrapperNode [2019-09-08 06:28:02,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:28:02,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:28:02,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:28:02,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:28:02,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:02" (1/1) ... [2019-09-08 06:28:02,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:02" (1/1) ... [2019-09-08 06:28:02,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:02" (1/1) ... [2019-09-08 06:28:02,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:02" (1/1) ... [2019-09-08 06:28:02,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:02" (1/1) ... [2019-09-08 06:28:02,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:02" (1/1) ... [2019-09-08 06:28:02,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:02" (1/1) ... [2019-09-08 06:28:02,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:28:02,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:28:02,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:28:02,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:28:02,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:02" (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:28:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:28:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:28:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-09-08 06:28:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:28:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-08 06:28:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:28:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-09-08 06:28:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:28:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:28:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:28:03,015 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:28:03,015 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 06:28:03,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:28:03 BoogieIcfgContainer [2019-09-08 06:28:03,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:28:03,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:28:03,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:28:03,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:28:03,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:28:02" (1/3) ... [2019-09-08 06:28:03,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da8ecc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:28:03, skipping insertion in model container [2019-09-08 06:28:03,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:28:02" (2/3) ... [2019-09-08 06:28:03,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da8ecc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:28:03, skipping insertion in model container [2019-09-08 06:28:03,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:28:03" (3/3) ... [2019-09-08 06:28:03,026 INFO L109 eAbstractionObserver]: Analyzing ICFG id_o20.c [2019-09-08 06:28:03,035 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:28:03,042 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:28:03,055 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:28:03,086 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:28:03,087 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:28:03,087 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:28:03,087 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:28:03,087 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:28:03,087 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:28:03,088 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:28:03,088 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:28:03,088 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:28:03,106 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-08 06:28:03,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 06:28:03,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:03,112 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:28:03,115 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:03,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:03,121 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2019-09-08 06:28:03,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:03,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:03,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:03,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:28:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:03,397 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:28:03,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:28:03,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:28:03,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:28:03,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:28:03,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:28:03,428 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2019-09-08 06:28:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:28:03,493 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-09-08 06:28:03,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:28:03,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-08 06:28:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:28:03,506 INFO L225 Difference]: With dead ends: 32 [2019-09-08 06:28:03,507 INFO L226 Difference]: Without dead ends: 18 [2019-09-08 06:28:03,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:28:03,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-08 06:28:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-08 06:28:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-08 06:28:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-08 06:28:03,552 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-08 06:28:03,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:28:03,553 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-08 06:28:03,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:28:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-08 06:28:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 06:28:03,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:03,558 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:28:03,559 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:03,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:03,560 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2019-09-08 06:28:03,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:03,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:03,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:03,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:28:03,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 06:28:03,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:28:03,740 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:28:03,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:28:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:03,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 06:28:03,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:28:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 06:28:03,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:28:03,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 06:28:03,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:28:03,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:28:03,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:28:03,861 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2019-09-08 06:28:03,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:28:03,915 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-09-08 06:28:03,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:28:03,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-09-08 06:28:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:28:03,917 INFO L225 Difference]: With dead ends: 25 [2019-09-08 06:28:03,917 INFO L226 Difference]: Without dead ends: 21 [2019-09-08 06:28:03,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:28:03,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-08 06:28:03,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-08 06:28:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 06:28:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-08 06:28:03,925 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-09-08 06:28:03,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:28:03,926 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-08 06:28:03,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:28:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-08 06:28:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 06:28:03,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:03,927 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:28:03,928 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:03,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:03,928 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2019-09-08 06:28:03,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:03,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:03,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:03,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:28:03,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 06:28:04,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:28:04,086 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:28:04,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:28:04,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:28:04,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:28:04,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 06:28:04,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:28:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 06:28:04,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:28:04,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-08 06:28:04,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 06:28:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 06:28:04,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:28:04,199 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2019-09-08 06:28:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:28:04,257 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-09-08 06:28:04,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:28:04,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-09-08 06:28:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:28:04,262 INFO L225 Difference]: With dead ends: 28 [2019-09-08 06:28:04,262 INFO L226 Difference]: Without dead ends: 24 [2019-09-08 06:28:04,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:28:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-08 06:28:04,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-08 06:28:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-08 06:28:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-08 06:28:04,269 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2019-09-08 06:28:04,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:28:04,270 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-08 06:28:04,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 06:28:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-08 06:28:04,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 06:28:04,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:04,272 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:28:04,272 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:04,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:04,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2019-09-08 06:28:04,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:04,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:04,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:04,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:28:04,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 06:28:04,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:28:04,565 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:28:04,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 06:28:04,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 06:28:04,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:28:04,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 06:28:04,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:28:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 06:28:04,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:28:04,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-08 06:28:04,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 06:28:04,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 06:28:04,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:28:04,669 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2019-09-08 06:28:04,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:28:04,731 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-09-08 06:28:04,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:28:04,731 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-09-08 06:28:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:28:04,733 INFO L225 Difference]: With dead ends: 31 [2019-09-08 06:28:04,733 INFO L226 Difference]: Without dead ends: 27 [2019-09-08 06:28:04,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:28:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-08 06:28:04,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-08 06:28:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 06:28:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-08 06:28:04,740 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2019-09-08 06:28:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:28:04,740 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-08 06:28:04,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 06:28:04,741 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-08 06:28:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-08 06:28:04,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:04,742 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:28:04,743 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:04,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:04,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2019-09-08 06:28:04,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:04,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:04,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:04,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:28:04,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 06:28:04,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:28:04,948 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:28:04,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:28:04,983 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:28:04,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:28:04,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 06:28:04,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:28:05,022 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 06:28:05,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:28:05,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-08 06:28:05,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 06:28:05,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 06:28:05,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:28:05,028 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-09-08 06:28:05,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:28:05,115 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-09-08 06:28:05,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 06:28:05,115 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-09-08 06:28:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:28:05,117 INFO L225 Difference]: With dead ends: 34 [2019-09-08 06:28:05,117 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 06:28:05,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:28:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 06:28:05,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-08 06:28:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 06:28:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-08 06:28:05,125 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2019-09-08 06:28:05,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:28:05,125 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-08 06:28:05,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 06:28:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-08 06:28:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-08 06:28:05,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:05,127 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:28:05,127 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:05,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2019-09-08 06:28:05,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:05,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:05,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:05,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:28:05,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 06:28:05,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:28:05,413 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:28:05,436 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 06:28:05,528 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 06:28:05,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:28:05,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 06:28:05,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:28:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 06:28:05,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:28:05,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-08 06:28:05,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 06:28:05,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 06:28:05,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:28:05,607 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2019-09-08 06:28:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:28:05,709 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-09-08 06:28:05,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 06:28:05,710 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-09-08 06:28:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:28:05,711 INFO L225 Difference]: With dead ends: 37 [2019-09-08 06:28:05,711 INFO L226 Difference]: Without dead ends: 33 [2019-09-08 06:28:05,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:28:05,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-08 06:28:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-08 06:28:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 06:28:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-08 06:28:05,719 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2019-09-08 06:28:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:28:05,719 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-08 06:28:05,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 06:28:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-08 06:28:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 06:28:05,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:05,721 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:28:05,722 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:05,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:05,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2019-09-08 06:28:05,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:05,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:05,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:05,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:28:05,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 06:28:06,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:28:06,030 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) [2019-09-08 06:28:06,056 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:28:06,099 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 06:28:06,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:28:06,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 06:28:06,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:28:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 06:28:06,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:28:06,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-08 06:28:06,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 06:28:06,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 06:28:06,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-09-08 06:28:06,170 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 18 states. [2019-09-08 06:28:06,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:28:06,311 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-09-08 06:28:06,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 06:28:06,312 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2019-09-08 06:28:06,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:28:06,313 INFO L225 Difference]: With dead ends: 40 [2019-09-08 06:28:06,314 INFO L226 Difference]: Without dead ends: 36 [2019-09-08 06:28:06,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-09-08 06:28:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-08 06:28:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-08 06:28:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-08 06:28:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-09-08 06:28:06,327 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2019-09-08 06:28:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:28:06,331 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-09-08 06:28:06,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 06:28:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-09-08 06:28:06,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 06:28:06,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:06,332 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:28:06,333 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:06,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:06,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2019-09-08 06:28:06,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:06,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:06,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:06,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:28:06,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 06:28:06,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:28:06,700 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) [2019-09-08 06:28:06,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:28:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:06,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 06:28:06,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:28:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 06:28:06,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:28:06,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-08 06:28:06,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 06:28:06,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 06:28:06,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:28:06,796 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 20 states. [2019-09-08 06:28:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:28:06,944 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-09-08 06:28:06,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 06:28:06,945 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2019-09-08 06:28:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:28:06,946 INFO L225 Difference]: With dead ends: 43 [2019-09-08 06:28:06,946 INFO L226 Difference]: Without dead ends: 39 [2019-09-08 06:28:06,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:28:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-08 06:28:06,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-08 06:28:06,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 06:28:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-08 06:28:06,953 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2019-09-08 06:28:06,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:28:06,954 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-08 06:28:06,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 06:28:06,954 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-08 06:28:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 06:28:06,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:06,955 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:28:06,956 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:06,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:06,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2019-09-08 06:28:06,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:06,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:06,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:06,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:28:06,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:07,305 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 06:28:07,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:28:07,306 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:28:07,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:28:07,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:28:07,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:28:07,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 06:28:07,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:28:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 06:28:07,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:28:07,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-08 06:28:07,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 06:28:07,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 06:28:07,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2019-09-08 06:28:07,445 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 22 states. [2019-09-08 06:28:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:28:07,625 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-09-08 06:28:07,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 06:28:07,626 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2019-09-08 06:28:07,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:28:07,627 INFO L225 Difference]: With dead ends: 46 [2019-09-08 06:28:07,627 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 06:28:07,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2019-09-08 06:28:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 06:28:07,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-08 06:28:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-08 06:28:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-08 06:28:07,647 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2019-09-08 06:28:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:28:07,647 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-08 06:28:07,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 06:28:07,647 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-08 06:28:07,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 06:28:07,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:07,649 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:28:07,649 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:07,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:07,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2019-09-08 06:28:07,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:07,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:07,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:28:07,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 06:28:08,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:28:08,033 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:28:08,053 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:28:08,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 06:28:08,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:28:08,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-08 06:28:08,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:28:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 06:28:08,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:28:08,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-08 06:28:08,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 06:28:08,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 06:28:08,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2019-09-08 06:28:08,174 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 24 states. [2019-09-08 06:28:08,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:28:08,375 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-09-08 06:28:08,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 06:28:08,375 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-09-08 06:28:08,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:28:08,377 INFO L225 Difference]: With dead ends: 49 [2019-09-08 06:28:08,377 INFO L226 Difference]: Without dead ends: 45 [2019-09-08 06:28:08,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2019-09-08 06:28:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-08 06:28:08,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-08 06:28:08,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-08 06:28:08,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-08 06:28:08,383 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2019-09-08 06:28:08,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:28:08,384 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-08 06:28:08,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 06:28:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-08 06:28:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 06:28:08,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:08,386 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:28:08,386 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:08,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:08,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2019-09-08 06:28:08,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:08,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:08,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:08,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:28:08,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-08 06:28:08,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:28:08,871 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:28:08,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:28:08,922 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:28:08,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:28:08,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-08 06:28:08,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:28:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-08 06:28:08,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:28:08,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-08 06:28:08,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 06:28:08,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 06:28:08,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-09-08 06:28:08,986 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 26 states. [2019-09-08 06:28:09,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:28:09,266 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-09-08 06:28:09,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 06:28:09,266 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2019-09-08 06:28:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:28:09,267 INFO L225 Difference]: With dead ends: 52 [2019-09-08 06:28:09,267 INFO L226 Difference]: Without dead ends: 48 [2019-09-08 06:28:09,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-09-08 06:28:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-08 06:28:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-08 06:28:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-08 06:28:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-08 06:28:09,274 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2019-09-08 06:28:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:28:09,274 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-08 06:28:09,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 06:28:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-08 06:28:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 06:28:09,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:09,276 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:28:09,276 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:09,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:09,277 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2019-09-08 06:28:09,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:09,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:09,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:09,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:28:09,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-08 06:28:09,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:28:09,741 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:28:09,767 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 06:28:30,359 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-08 06:28:30,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:28:30,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-08 06:28:30,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:28:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-08 06:28:30,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:28:30,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-08 06:28:30,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 06:28:30,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 06:28:30,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-09-08 06:28:30,524 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 28 states. [2019-09-08 06:28:30,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:28:30,805 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-09-08 06:28:30,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 06:28:30,805 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2019-09-08 06:28:30,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:28:30,806 INFO L225 Difference]: With dead ends: 55 [2019-09-08 06:28:30,806 INFO L226 Difference]: Without dead ends: 51 [2019-09-08 06:28:30,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-09-08 06:28:30,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-08 06:28:30,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-08 06:28:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-08 06:28:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-09-08 06:28:30,812 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2019-09-08 06:28:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:28:30,813 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-09-08 06:28:30,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 06:28:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-09-08 06:28:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 06:28:30,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:28:30,814 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:28:30,815 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:28:30,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:28:30,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2019-09-08 06:28:30,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:28:30,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:28:30,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:30,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:28:30,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:28:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:28:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-08 06:28:31,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:28:31,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:28:31,329 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 06:29:29,225 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-08 06:29:29,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:29:30,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-08 06:29:30,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-08 06:29:30,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:29:30,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-08 06:29:30,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 06:29:30,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 06:29:30,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2019-09-08 06:29:30,475 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 30 states. [2019-09-08 06:29:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:30,805 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-09-08 06:29:30,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 06:29:30,805 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2019-09-08 06:29:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:30,807 INFO L225 Difference]: With dead ends: 58 [2019-09-08 06:29:30,807 INFO L226 Difference]: Without dead ends: 54 [2019-09-08 06:29:30,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2019-09-08 06:29:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-08 06:29:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-08 06:29:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-08 06:29:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-09-08 06:29:30,818 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2019-09-08 06:29:30,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:30,819 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-09-08 06:29:30,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 06:29:30,819 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-09-08 06:29:30,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 06:29:30,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:30,820 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:30,821 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:30,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:30,821 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2019-09-08 06:29:30,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:30,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:30,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:30,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:29:30,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:31,397 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-08 06:29:31,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:31,398 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:31,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:31,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-08 06:29:31,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-08 06:29:31,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:29:31,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-08 06:29:31,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 06:29:31,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 06:29:31,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2019-09-08 06:29:31,530 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 32 states. [2019-09-08 06:29:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:31,971 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-09-08 06:29:31,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 06:29:31,972 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2019-09-08 06:29:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:31,973 INFO L225 Difference]: With dead ends: 61 [2019-09-08 06:29:31,974 INFO L226 Difference]: Without dead ends: 57 [2019-09-08 06:29:31,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2019-09-08 06:29:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-08 06:29:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-08 06:29:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-08 06:29:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-08 06:29:31,989 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2019-09-08 06:29:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:31,989 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-08 06:29:31,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 06:29:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-08 06:29:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 06:29:31,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:31,991 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:31,991 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:31,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:31,992 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2019-09-08 06:29:31,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:31,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:31,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:31,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:29:31,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-08 06:29:32,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:32,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:32,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:29:32,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:29:32,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:29:32,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-08 06:29:32,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-08 06:29:32,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:29:32,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-08 06:29:32,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 06:29:32,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 06:29:32,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 06:29:32,780 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 34 states. [2019-09-08 06:29:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:33,237 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-09-08 06:29:33,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 06:29:33,237 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 97 [2019-09-08 06:29:33,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:33,239 INFO L225 Difference]: With dead ends: 64 [2019-09-08 06:29:33,239 INFO L226 Difference]: Without dead ends: 60 [2019-09-08 06:29:33,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 06:29:33,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-08 06:29:33,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-08 06:29:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-08 06:29:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-09-08 06:29:33,246 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2019-09-08 06:29:33,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:33,247 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-09-08 06:29:33,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 06:29:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-09-08 06:29:33,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 06:29:33,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:33,248 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:33,249 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:33,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:33,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2019-09-08 06:29:33,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:33,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:33,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:33,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:29:33,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-09-08 06:29:33,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:33,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:29:33,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:36,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-08 06:29:36,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:29:36,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-08 06:29:36,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:29:36,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:29:36,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-08 06:29:36,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 06:29:36,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 06:29:36,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 06:29:36,916 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 36 states. [2019-09-08 06:29:37,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:37,450 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-09-08 06:29:37,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 06:29:37,452 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2019-09-08 06:29:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:37,454 INFO L225 Difference]: With dead ends: 67 [2019-09-08 06:29:37,454 INFO L226 Difference]: Without dead ends: 63 [2019-09-08 06:29:37,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 06:29:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-08 06:29:37,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-09-08 06:29:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-08 06:29:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-09-08 06:29:37,460 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2019-09-08 06:29:37,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:37,461 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-09-08 06:29:37,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 06:29:37,461 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-09-08 06:29:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 06:29:37,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:37,462 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:37,463 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:37,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:37,463 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2019-09-08 06:29:37,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:37,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:37,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:37,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:29:37,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-09-08 06:29:38,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:38,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:38,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:29:38,249 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:29:38,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:29:38,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-08 06:29:38,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:29:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-09-08 06:29:38,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:29:38,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-08 06:29:38,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 06:29:38,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 06:29:38,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 06:29:38,352 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 38 states. [2019-09-08 06:29:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:29:38,946 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-09-08 06:29:38,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 06:29:38,946 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2019-09-08 06:29:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:29:38,948 INFO L225 Difference]: With dead ends: 70 [2019-09-08 06:29:38,948 INFO L226 Difference]: Without dead ends: 66 [2019-09-08 06:29:38,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 06:29:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-08 06:29:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-08 06:29:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-08 06:29:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-09-08 06:29:38,959 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2019-09-08 06:29:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:29:38,959 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-09-08 06:29:38,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 06:29:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-09-08 06:29:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 06:29:38,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:29:38,961 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:29:38,961 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:29:38,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:29:38,962 INFO L82 PathProgramCache]: Analyzing trace with hash -464475409, now seen corresponding path program 17 times [2019-09-08 06:29:38,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:29:38,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:29:38,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:38,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:29:38,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:29:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:29:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-08 06:29:39,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:29:39,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:29:39,840 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 06:31:13,513 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-08 06:31:13,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:31:13,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-08 06:31:13,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:31:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-08 06:31:14,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:31:14,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-08 06:31:14,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 06:31:14,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 06:31:14,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 06:31:14,062 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 40 states. [2019-09-08 06:31:14,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:31:14,742 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-09-08 06:31:14,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 06:31:14,742 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 115 [2019-09-08 06:31:14,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:31:14,744 INFO L225 Difference]: With dead ends: 73 [2019-09-08 06:31:14,744 INFO L226 Difference]: Without dead ends: 69 [2019-09-08 06:31:14,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 06:31:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-08 06:31:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-09-08 06:31:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-08 06:31:14,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-09-08 06:31:14,751 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2019-09-08 06:31:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:31:14,752 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-09-08 06:31:14,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 06:31:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-09-08 06:31:14,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 06:31:14,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:31:14,753 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:31:14,754 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:31:14,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:31:14,754 INFO L82 PathProgramCache]: Analyzing trace with hash 130115453, now seen corresponding path program 18 times [2019-09-08 06:31:14,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:31:14,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:31:14,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:31:14,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:31:14,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:31:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:31:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-08 06:31:15,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:31:15,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:31:15,684 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 06:31:57,132 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-08 06:31:57,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:31:57,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-08 06:31:57,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:31:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-08 06:31:57,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:31:57,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-08 06:31:57,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-08 06:31:57,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-08 06:31:57,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 06:31:57,607 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 42 states. [2019-09-08 06:31:58,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:31:58,377 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2019-09-08 06:31:58,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 06:31:58,378 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2019-09-08 06:31:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:31:58,379 INFO L225 Difference]: With dead ends: 76 [2019-09-08 06:31:58,380 INFO L226 Difference]: Without dead ends: 72 [2019-09-08 06:31:58,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 06:31:58,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-08 06:31:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-08 06:31:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-08 06:31:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-08 06:31:58,391 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2019-09-08 06:31:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:31:58,393 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-08 06:31:58,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-08 06:31:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-08 06:31:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 06:31:58,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:31:58,396 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:31:58,397 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:31:58,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:31:58,398 INFO L82 PathProgramCache]: Analyzing trace with hash -2010955025, now seen corresponding path program 19 times [2019-09-08 06:31:58,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:31:58,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:31:58,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:31:58,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:31:58,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:31:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:31:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-08 06:31:59,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:31:59,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:31:59,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:31:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:31:59,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-08 06:31:59,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:31:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-08 06:31:59,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:31:59,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-08 06:31:59,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-08 06:31:59,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-08 06:31:59,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 06:31:59,686 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 44 states. [2019-09-08 06:32:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:32:00,467 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-09-08 06:32:00,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 06:32:00,468 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 127 [2019-09-08 06:32:00,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:32:00,470 INFO L225 Difference]: With dead ends: 79 [2019-09-08 06:32:00,470 INFO L226 Difference]: Without dead ends: 75 [2019-09-08 06:32:00,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 06:32:00,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-08 06:32:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-08 06:32:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-08 06:32:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-09-08 06:32:00,476 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2019-09-08 06:32:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:32:00,477 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-09-08 06:32:00,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-08 06:32:00,477 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-09-08 06:32:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 06:32:00,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:32:00,479 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:32:00,479 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:32:00,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:32:00,479 INFO L82 PathProgramCache]: Analyzing trace with hash -799288067, now seen corresponding path program 20 times [2019-09-08 06:32:00,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:32:00,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:32:00,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:00,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:32:00,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:32:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 06:32:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 06:32:00,674 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-08 06:32:00,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 06:32:00 BoogieIcfgContainer [2019-09-08 06:32:00,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 06:32:00,750 INFO L168 Benchmark]: Toolchain (without parser) took 238301.13 ms. Allocated memory was 134.2 MB in the beginning and 348.1 MB in the end (delta: 213.9 MB). Free memory was 90.3 MB in the beginning and 125.7 MB in the end (delta: -35.4 MB). Peak memory consumption was 178.5 MB. Max. memory is 7.1 GB. [2019-09-08 06:32:00,753 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-09-08 06:32:00,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.56 ms. Allocated memory is still 134.2 MB. Free memory was 90.1 MB in the beginning and 81.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-08 06:32:00,758 INFO L168 Benchmark]: Boogie Preprocessor took 111.00 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 81.0 MB in the beginning and 178.1 MB in the end (delta: -97.1 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2019-09-08 06:32:00,759 INFO L168 Benchmark]: RCFGBuilder took 216.24 ms. Allocated memory is still 201.3 MB. Free memory was 178.1 MB in the beginning and 167.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-09-08 06:32:00,760 INFO L168 Benchmark]: TraceAbstraction took 237729.32 ms. Allocated memory was 201.3 MB in the beginning and 348.1 MB in the end (delta: 146.8 MB). Free memory was 167.3 MB in the beginning and 125.7 MB in the end (delta: 41.6 MB). Peak memory consumption was 188.4 MB. Max. memory is 7.1 GB. [2019-09-08 06:32:00,769 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.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 239.56 ms. Allocated memory is still 134.2 MB. Free memory was 90.1 MB in the beginning and 81.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.00 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 81.0 MB in the beginning and 178.1 MB in the end (delta: -97.1 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 216.24 ms. Allocated memory is still 201.3 MB. Free memory was 178.1 MB in the beginning and 167.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237729.32 ms. Allocated memory was 201.3 MB in the beginning and 348.1 MB in the end (delta: 146.8 MB). Free memory was 167.3 MB in the beginning and 125.7 MB in the end (delta: 41.6 MB). Peak memory consumption was 188.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=20, input=20] [L11] unsigned int result = id(input); [L12] COND TRUE result == 20 VAL [input=20, result=20] [L13] __VERIFIER_error() VAL [input=20, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 237.6s OverallTime, 21 OverallIterations, 21 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 684 SDtfs, 2 SDslu, 14784 SDs, 0 SdLazy, 8747 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1848 GetRequests, 1370 SyntacticMatches, 19 SemanticMatches, 459 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 217.3s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 2920 NumberOfCodeBlocks, 2920 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 2748 ConstructedInterpolants, 0 QuantifiedInterpolants, 925248 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2850 ConjunctsInSsa, 912 ConjunctsInUnsatCore, 39 InterpolantComputations, 1 PerfectInterpolantSequences, 7600/15200 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...