java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label05_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 03:13:41,716 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 03:13:41,718 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 03:13:41,731 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 03:13:41,732 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 03:13:41,733 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 03:13:41,735 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 03:13:41,737 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 03:13:41,738 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 03:13:41,739 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 03:13:41,740 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 03:13:41,741 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 03:13:41,742 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 03:13:41,743 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 03:13:41,744 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 03:13:41,745 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 03:13:41,745 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 03:13:41,747 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 03:13:41,749 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 03:13:41,751 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 03:13:41,752 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 03:13:41,753 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 03:13:41,755 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 03:13:41,756 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 03:13:41,756 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 03:13:41,757 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 03:13:41,758 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 03:13:41,759 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 03:13:41,759 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 03:13:41,760 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 03:13:41,761 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 03:13:41,761 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 03:13:41,762 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 03:13:41,762 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 03:13:41,763 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 03:13:41,764 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 03:13:41,764 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-24 03:13:41,779 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 03:13:41,779 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 03:13:41,780 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 03:13:41,780 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 03:13:41,781 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 03:13:41,781 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 03:13:41,781 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 03:13:41,781 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 03:13:41,782 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 03:13:41,782 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 03:13:41,782 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 03:13:41,782 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 03:13:41,782 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 03:13:41,783 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 03:13:41,783 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 03:13:41,783 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 03:13:41,783 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 03:13:41,784 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 03:13:41,784 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 03:13:41,784 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 03:13:41,784 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 03:13:41,784 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 03:13:41,785 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 03:13:41,785 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 03:13:41,785 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 03:13:41,785 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 03:13:41,785 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 03:13:41,786 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 03:13:41,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 03:13:41,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 03:13:41,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 03:13:41,849 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 03:13:41,850 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 03:13:41,850 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label05_true-unreach-call.c [2018-07-24 03:13:42,208 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51e70ad7/c0898ae2f6aa4a04be80bb1411615b8f/FLAG53d52a36e [2018-07-24 03:13:42,617 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 03:13:42,618 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label05_true-unreach-call.c [2018-07-24 03:13:42,645 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51e70ad7/c0898ae2f6aa4a04be80bb1411615b8f/FLAG53d52a36e [2018-07-24 03:13:42,662 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51e70ad7/c0898ae2f6aa4a04be80bb1411615b8f [2018-07-24 03:13:42,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 03:13:42,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 03:13:42,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 03:13:42,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 03:13:42,687 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 03:13:42,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 03:13:42" (1/1) ... [2018-07-24 03:13:42,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d9fee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:13:42, skipping insertion in model container [2018-07-24 03:13:42,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 03:13:42" (1/1) ... [2018-07-24 03:13:42,997 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 03:13:43,808 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 03:13:43,828 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 03:13:44,285 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 03:13:44,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:13:44 WrapperNode [2018-07-24 03:13:44,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 03:13:44,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 03:13:44,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 03:13:44,508 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 03:13:44,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:13:44" (1/1) ... [2018-07-24 03:13:44,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:13:44" (1/1) ... [2018-07-24 03:13:44,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 03:13:44,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 03:13:44,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 03:13:44,882 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 03:13:45,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:13:44" (1/1) ... [2018-07-24 03:13:45,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:13:44" (1/1) ... [2018-07-24 03:13:45,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:13:44" (1/1) ... [2018-07-24 03:13:45,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:13:44" (1/1) ... [2018-07-24 03:13:45,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:13:44" (1/1) ... [2018-07-24 03:13:45,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:13:44" (1/1) ... [2018-07-24 03:13:45,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:13:44" (1/1) ... [2018-07-24 03:13:45,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 03:13:45,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 03:13:45,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 03:13:45,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 03:13:45,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:13:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 03:13:45,902 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 03:13:45,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 03:13:45,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 03:13:58,868 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 03:13:58,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 03:13:58 BoogieIcfgContainer [2018-07-24 03:13:58,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 03:13:58,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 03:13:58,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 03:13:58,874 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 03:13:58,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 03:13:42" (1/3) ... [2018-07-24 03:13:58,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728ee5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 03:13:58, skipping insertion in model container [2018-07-24 03:13:58,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 03:13:44" (2/3) ... [2018-07-24 03:13:58,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728ee5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 03:13:58, skipping insertion in model container [2018-07-24 03:13:58,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 03:13:58" (3/3) ... [2018-07-24 03:13:58,881 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label05_true-unreach-call.c [2018-07-24 03:13:58,892 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 03:13:58,902 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 03:13:58,962 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 03:13:58,963 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 03:13:58,964 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 03:13:58,964 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 03:13:58,964 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 03:13:58,964 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 03:13:58,964 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 03:13:58,965 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 03:13:58,965 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 03:13:59,000 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states. [2018-07-24 03:13:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-24 03:13:59,011 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:13:59,012 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:13:59,013 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:13:59,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1515441142, now seen corresponding path program 1 times [2018-07-24 03:13:59,021 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:13:59,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:13:59,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:13:59,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:13:59,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:13:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:13:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:13:59,642 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:13:59,643 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:13:59,649 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 03:13:59,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 03:13:59,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 03:13:59,669 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 4 states. [2018-07-24 03:14:09,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:14:09,557 INFO L93 Difference]: Finished difference Result 2097 states and 3909 transitions. [2018-07-24 03:14:09,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 03:14:09,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-07-24 03:14:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:14:09,590 INFO L225 Difference]: With dead ends: 2097 [2018-07-24 03:14:09,590 INFO L226 Difference]: Without dead ends: 1499 [2018-07-24 03:14:09,598 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 03:14:09,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2018-07-24 03:14:09,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1485. [2018-07-24 03:14:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2018-07-24 03:14:09,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2304 transitions. [2018-07-24 03:14:09,726 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2304 transitions. Word has length 62 [2018-07-24 03:14:09,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:14:09,727 INFO L471 AbstractCegarLoop]: Abstraction has 1485 states and 2304 transitions. [2018-07-24 03:14:09,727 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 03:14:09,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2304 transitions. [2018-07-24 03:14:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-24 03:14:09,740 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:14:09,740 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:14:09,741 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:14:09,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1966093022, now seen corresponding path program 1 times [2018-07-24 03:14:09,741 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:14:09,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:14:09,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:14:09,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:14:09,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:14:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:14:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:14:10,043 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:14:10,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:14:10,045 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 03:14:10,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 03:14:10,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 03:14:10,046 INFO L87 Difference]: Start difference. First operand 1485 states and 2304 transitions. Second operand 4 states. [2018-07-24 03:14:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:14:22,434 INFO L93 Difference]: Finished difference Result 5573 states and 8764 transitions. [2018-07-24 03:14:22,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 03:14:22,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-07-24 03:14:22,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:14:22,457 INFO L225 Difference]: With dead ends: 5573 [2018-07-24 03:14:22,457 INFO L226 Difference]: Without dead ends: 4090 [2018-07-24 03:14:22,463 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 03:14:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2018-07-24 03:14:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 4088. [2018-07-24 03:14:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4088 states. [2018-07-24 03:14:22,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 5618 transitions. [2018-07-24 03:14:22,548 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 5618 transitions. Word has length 130 [2018-07-24 03:14:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:14:22,549 INFO L471 AbstractCegarLoop]: Abstraction has 4088 states and 5618 transitions. [2018-07-24 03:14:22,549 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 03:14:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 5618 transitions. [2018-07-24 03:14:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-24 03:14:22,554 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:14:22,554 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:14:22,554 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:14:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash 588510743, now seen corresponding path program 1 times [2018-07-24 03:14:22,555 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:14:22,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:14:22,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:14:22,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:14:22,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:14:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:14:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:14:22,851 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:14:22,852 INFO L221 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 [2018-07-24 03:14:22,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:14:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:14:22,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:14:23,324 WARN L169 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 14 [2018-07-24 03:14:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:14:23,591 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 03:14:23,591 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-07-24 03:14:23,592 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 03:14:23,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 03:14:23,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-24 03:14:23,593 INFO L87 Difference]: Start difference. First operand 4088 states and 5618 transitions. Second operand 7 states. [2018-07-24 03:14:41,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:14:41,160 INFO L93 Difference]: Finished difference Result 15155 states and 21989 transitions. [2018-07-24 03:14:41,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 03:14:41,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 133 [2018-07-24 03:14:41,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:14:41,211 INFO L225 Difference]: With dead ends: 15155 [2018-07-24 03:14:41,211 INFO L226 Difference]: Without dead ends: 11069 [2018-07-24 03:14:41,219 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-24 03:14:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11069 states. [2018-07-24 03:14:41,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11069 to 8383. [2018-07-24 03:14:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8383 states. [2018-07-24 03:14:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8383 states to 8383 states and 11462 transitions. [2018-07-24 03:14:41,404 INFO L78 Accepts]: Start accepts. Automaton has 8383 states and 11462 transitions. Word has length 133 [2018-07-24 03:14:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:14:41,405 INFO L471 AbstractCegarLoop]: Abstraction has 8383 states and 11462 transitions. [2018-07-24 03:14:41,405 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 03:14:41,405 INFO L276 IsEmpty]: Start isEmpty. Operand 8383 states and 11462 transitions. [2018-07-24 03:14:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-24 03:14:41,411 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:14:41,411 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:14:41,411 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:14:41,412 INFO L82 PathProgramCache]: Analyzing trace with hash 640898902, now seen corresponding path program 1 times [2018-07-24 03:14:41,412 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:14:41,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:14:41,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:14:41,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:14:41,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:14:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:14:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 119 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 03:14:41,860 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:14:41,861 INFO L221 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 [2018-07-24 03:14:41,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:14:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:14:41,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:14:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-07-24 03:14:42,232 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 03:14:42,232 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2018-07-24 03:14:42,233 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 03:14:42,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 03:14:42,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 03:14:42,234 INFO L87 Difference]: Start difference. First operand 8383 states and 11462 transitions. Second operand 5 states. [2018-07-24 03:14:52,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:14:52,477 INFO L93 Difference]: Finished difference Result 29976 states and 41913 transitions. [2018-07-24 03:14:52,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 03:14:52,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2018-07-24 03:14:52,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:14:52,538 INFO L225 Difference]: With dead ends: 29976 [2018-07-24 03:14:52,538 INFO L226 Difference]: Without dead ends: 20711 [2018-07-24 03:14:52,555 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 03:14:52,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20711 states. [2018-07-24 03:14:52,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20711 to 20711. [2018-07-24 03:14:52,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20711 states. [2018-07-24 03:14:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20711 states to 20711 states and 24537 transitions. [2018-07-24 03:14:52,865 INFO L78 Accepts]: Start accepts. Automaton has 20711 states and 24537 transitions. Word has length 222 [2018-07-24 03:14:52,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:14:52,866 INFO L471 AbstractCegarLoop]: Abstraction has 20711 states and 24537 transitions. [2018-07-24 03:14:52,866 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 03:14:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 20711 states and 24537 transitions. [2018-07-24 03:14:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-07-24 03:14:52,872 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:14:52,873 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:14:52,873 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:14:52,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1293321723, now seen corresponding path program 1 times [2018-07-24 03:14:52,873 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:14:52,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:14:52,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:14:52,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:14:52,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:14:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:14:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-07-24 03:14:53,128 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:14:53,128 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 03:14:53,129 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 03:14:53,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 03:14:53,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:14:53,130 INFO L87 Difference]: Start difference. First operand 20711 states and 24537 transitions. Second operand 3 states. [2018-07-24 03:15:00,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:15:00,862 INFO L93 Difference]: Finished difference Result 61266 states and 72738 transitions. [2018-07-24 03:15:00,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 03:15:00,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2018-07-24 03:15:00,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:15:00,942 INFO L225 Difference]: With dead ends: 61266 [2018-07-24 03:15:00,943 INFO L226 Difference]: Without dead ends: 40984 [2018-07-24 03:15:00,974 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:15:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40984 states. [2018-07-24 03:15:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40984 to 40982. [2018-07-24 03:15:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40982 states. [2018-07-24 03:15:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40982 states to 40982 states and 48618 transitions. [2018-07-24 03:15:01,534 INFO L78 Accepts]: Start accepts. Automaton has 40982 states and 48618 transitions. Word has length 278 [2018-07-24 03:15:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:15:01,535 INFO L471 AbstractCegarLoop]: Abstraction has 40982 states and 48618 transitions. [2018-07-24 03:15:01,535 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 03:15:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 40982 states and 48618 transitions. [2018-07-24 03:15:01,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-07-24 03:15:01,548 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:15:01,548 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:15:01,548 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:15:01,549 INFO L82 PathProgramCache]: Analyzing trace with hash 875923488, now seen corresponding path program 1 times [2018-07-24 03:15:01,549 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:15:01,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:15:01,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:15:01,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:15:01,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:15:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:15:02,237 WARN L169 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-07-24 03:15:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 55 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 03:15:02,543 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:15:02,543 INFO L221 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 [2018-07-24 03:15:02,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:15:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:15:02,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:15:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-07-24 03:15:02,795 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 03:15:02,795 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-07-24 03:15:02,796 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-24 03:15:02,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-24 03:15:02,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-07-24 03:15:02,797 INFO L87 Difference]: Start difference. First operand 40982 states and 48618 transitions. Second operand 8 states. [2018-07-24 03:15:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:15:24,039 INFO L93 Difference]: Finished difference Result 152727 states and 180529 transitions. [2018-07-24 03:15:24,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-24 03:15:24,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 308 [2018-07-24 03:15:24,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:15:24,233 INFO L225 Difference]: With dead ends: 152727 [2018-07-24 03:15:24,233 INFO L226 Difference]: Without dead ends: 112174 [2018-07-24 03:15:24,280 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2018-07-24 03:15:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112174 states. [2018-07-24 03:15:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112174 to 35191. [2018-07-24 03:15:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35191 states. [2018-07-24 03:15:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35191 states to 35191 states and 39937 transitions. [2018-07-24 03:15:25,098 INFO L78 Accepts]: Start accepts. Automaton has 35191 states and 39937 transitions. Word has length 308 [2018-07-24 03:15:25,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:15:25,099 INFO L471 AbstractCegarLoop]: Abstraction has 35191 states and 39937 transitions. [2018-07-24 03:15:25,099 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-24 03:15:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 35191 states and 39937 transitions. [2018-07-24 03:15:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-07-24 03:15:25,110 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:15:25,110 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:15:25,111 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:15:25,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1305517648, now seen corresponding path program 1 times [2018-07-24 03:15:25,112 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:15:25,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:15:25,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:15:25,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:15:25,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:15:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:15:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 264 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-07-24 03:15:25,721 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:15:25,721 INFO L221 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 [2018-07-24 03:15:25,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:15:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:15:25,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:15:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 264 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-07-24 03:15:26,507 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:15:26,507 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2018-07-24 03:15:26,508 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-24 03:15:26,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-24 03:15:26,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-07-24 03:15:26,508 INFO L87 Difference]: Start difference. First operand 35191 states and 39937 transitions. Second operand 10 states. [2018-07-24 03:15:37,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:15:37,581 INFO L93 Difference]: Finished difference Result 80105 states and 90330 transitions. [2018-07-24 03:15:37,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 03:15:37,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 325 [2018-07-24 03:15:37,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:15:37,639 INFO L225 Difference]: With dead ends: 80105 [2018-07-24 03:15:37,639 INFO L226 Difference]: Without dead ends: 44916 [2018-07-24 03:15:37,668 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-07-24 03:15:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44916 states. [2018-07-24 03:15:38,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44916 to 43728. [2018-07-24 03:15:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43728 states. [2018-07-24 03:15:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43728 states to 43728 states and 48753 transitions. [2018-07-24 03:15:38,445 INFO L78 Accepts]: Start accepts. Automaton has 43728 states and 48753 transitions. Word has length 325 [2018-07-24 03:15:38,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:15:38,445 INFO L471 AbstractCegarLoop]: Abstraction has 43728 states and 48753 transitions. [2018-07-24 03:15:38,445 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-24 03:15:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 43728 states and 48753 transitions. [2018-07-24 03:15:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-07-24 03:15:38,465 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:15:38,465 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:15:38,466 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:15:38,466 INFO L82 PathProgramCache]: Analyzing trace with hash -75165392, now seen corresponding path program 1 times [2018-07-24 03:15:38,466 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:15:38,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:15:38,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:15:38,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:15:38,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:15:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:15:38,987 WARN L169 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-07-24 03:15:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 453 proven. 83 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-07-24 03:15:39,626 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:15:39,626 INFO L221 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 [2018-07-24 03:15:39,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:15:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:15:39,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:15:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 397 proven. 272 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-07-24 03:15:41,096 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 03:15:41,096 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2018-07-24 03:15:41,101 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-24 03:15:41,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-24 03:15:41,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-07-24 03:15:41,102 INFO L87 Difference]: Start difference. First operand 43728 states and 48753 transitions. Second operand 13 states. [2018-07-24 03:16:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:16:08,275 INFO L93 Difference]: Finished difference Result 91873 states and 102238 transitions. [2018-07-24 03:16:08,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-24 03:16:08,277 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 451 [2018-07-24 03:16:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:16:08,330 INFO L225 Difference]: With dead ends: 91873 [2018-07-24 03:16:08,331 INFO L226 Difference]: Without dead ends: 48573 [2018-07-24 03:16:08,362 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 447 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-07-24 03:16:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48573 states. [2018-07-24 03:16:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48573 to 47142. [2018-07-24 03:16:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47142 states. [2018-07-24 03:16:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47142 states to 47142 states and 52335 transitions. [2018-07-24 03:16:09,095 INFO L78 Accepts]: Start accepts. Automaton has 47142 states and 52335 transitions. Word has length 451 [2018-07-24 03:16:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:16:09,095 INFO L471 AbstractCegarLoop]: Abstraction has 47142 states and 52335 transitions. [2018-07-24 03:16:09,095 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-24 03:16:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 47142 states and 52335 transitions. [2018-07-24 03:16:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-07-24 03:16:09,110 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:16:09,110 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:16:09,111 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:16:09,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1182336225, now seen corresponding path program 1 times [2018-07-24 03:16:09,111 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:16:09,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:16:09,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:16:09,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:16:09,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:16:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:16:09,539 WARN L169 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 03:16:09,840 WARN L169 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-07-24 03:16:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 530 proven. 60 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-07-24 03:16:10,071 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 03:16:10,072 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 03:16:10,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:16:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:16:10,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 03:16:12,322 WARN L1032 $PredicateComparison]: unable to prove that (let ((.cse5 (exists ((v_prenex_29 Int)) (let ((.cse26 (* 9 v_prenex_29))) (and (<= 0 .cse26) (< 0 (+ v_prenex_29 84)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse26 10)))))) (.cse1 (exists ((v_prenex_32 Int)) (let ((.cse25 (* 9 v_prenex_32))) (and (< 0 (+ v_prenex_32 84)) (not (= 0 (mod .cse25 10))) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594906) (div .cse25 10)) (< .cse25 0))))) (.cse10 (exists ((v_prenex_37 Int)) (let ((.cse24 (* 9 v_prenex_37))) (and (not (= 0 (mod .cse24 10))) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594906) (div .cse24 10)) (< .cse24 0) (< 0 (+ v_prenex_37 84)))))) (.cse6 (exists ((v_prenex_40 Int)) (let ((.cse23 (* 9 v_prenex_40))) (and (< 0 (+ v_prenex_40 114)) (< .cse23 0) (<= (+ v_prenex_40 84) 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594906) (div .cse23 10)) (not (= 0 (mod .cse23 10))))))) (.cse2 (exists ((v_prenex_15 Int)) (let ((.cse22 (* 9 v_prenex_15))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse22 10)) (= 0 (mod .cse22 10)) (< 0 (+ v_prenex_15 84)))))) (.cse3 (exists ((v_prenex_20 Int)) (let ((.cse21 (* 9 v_prenex_20))) (and (= 0 (mod .cse21 10)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse21 10)) (<= (+ v_prenex_20 84) 0) (< 0 (+ v_prenex_20 114)))))) (.cse16 (exists ((v_prenex_9 Int)) (let ((.cse20 (* 9 v_prenex_9))) (and (<= 0 .cse20) (<= (+ v_prenex_9 84) 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse20 10)) (< 0 (+ v_prenex_9 114)))))) (.cse0 (exists ((v_prenex_11 Int)) (let ((.cse19 (* 9 v_prenex_11))) (and (< 0 (+ v_prenex_11 84)) (= 0 (mod .cse19 10)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse19 10)))))) (.cse4 (exists ((v_prenex_43 Int)) (let ((.cse18 (* 9 v_prenex_43))) (and (< 0 (+ v_prenex_43 84)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse18 10)) (<= 0 .cse18)))))) (or (and .cse0 (exists ((v_prenex_6 Int)) (and (<= v_prenex_6 37) (= 0 (mod v_prenex_6 5)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_6 5))))) (and .cse1 (exists ((v_prenex_34 Int)) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_34 5)) (<= 0 v_prenex_34) (<= v_prenex_34 37)))) (and (exists ((v_prenex_7 Int)) (and (<= 0 v_prenex_7) (<= v_prenex_7 134) (< 37 v_prenex_7) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_7 5)))) .cse2) (and (exists ((v_prenex_21 Int)) (and (= 0 (mod v_prenex_21 5)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_21 5)) (< 300 v_prenex_21))) .cse3) (and .cse4 (exists ((v_prenex_45 Int)) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_45 5)) (<= 0 v_prenex_45) (<= v_prenex_45 37)))) (and .cse5 (exists ((v_prenex_30 Int)) (and (< 37 v_prenex_30) (<= 0 v_prenex_30) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_30 5)) (<= v_prenex_30 134)))) (and .cse5 (exists ((v_prenex_31 Int)) (and (<= v_prenex_31 134) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_31 5)) (= 0 (mod v_prenex_31 5)) (< 37 v_prenex_31)))) (and (exists ((v_prenex_33 Int)) (and (= 0 (mod v_prenex_33 5)) (<= v_prenex_33 37) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_33 5)))) .cse1) (and (exists ((v_prenex_41 Int)) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_41 5)) (< 300 v_prenex_41) (= 0 (mod v_prenex_41 5)))) .cse6) (and (exists ((v_prenex_16 Int)) (let ((.cse7 (* 9 v_prenex_16))) (and (= 0 (mod .cse7 10)) (< 0 (+ v_prenex_16 84)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse7 10))))) (exists ((v_prenex_17 Int)) (and (< v_prenex_17 0) (<= v_prenex_17 37) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_17 5)) (not (= 0 (mod v_prenex_17 5)))))) (and (exists ((v_prenex_47 Int)) (and (<= v_prenex_47 134) (not (= 0 (mod v_prenex_47 5))) (< 37 v_prenex_47) (< v_prenex_47 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_47 5)))) (exists ((v_prenex_46 Int)) (let ((.cse8 (* 9 v_prenex_46))) (and (<= 0 .cse8) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse8 10)) (< 0 (+ v_prenex_46 84)))))) (and (exists ((v_prenex_13 Int)) (let ((.cse9 (* 9 v_prenex_13))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse9 10)) (< 0 (+ v_prenex_13 114)) (<= (+ v_prenex_13 84) 0) (<= 0 .cse9)))) (exists ((v_prenex_12 Int)) (and (< 300 v_prenex_12) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_12 5)) (not (= 0 (mod v_prenex_12 5))) (< v_prenex_12 0)))) (and .cse10 (exists ((v_prenex_39 Int)) (and (= 0 (mod v_prenex_39 5)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_39 5)) (<= v_prenex_39 134) (< 37 v_prenex_39)))) (and (exists ((v_prenex_25 Int)) (let ((.cse11 (* 9 v_prenex_25))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594906) (div .cse11 10)) (< 0 (+ v_prenex_25 114)) (<= (+ v_prenex_25 84) 0) (not (= 0 (mod .cse11 10))) (< .cse11 0)))) (exists ((v_prenex_26 Int)) (and (< v_prenex_26 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_26 5)) (< 300 v_prenex_26) (not (= 0 (mod v_prenex_26 5)))))) (and (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0_1304 Int)) (and (<= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0_1304 37) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0_1304 5)) (not (= 0 (mod v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0_1304 5))) (< v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0_1304 0))) (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0_1228 Int)) (let ((.cse12 (* 9 v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0_1228))) (and (< 0 (+ v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0_1228 84)) (not (= 0 (mod .cse12 10))) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594906) (div .cse12 10)) (< .cse12 0))))) (and (exists ((v_prenex_27 Int)) (let ((.cse13 (* 9 v_prenex_27))) (and (= 0 (mod .cse13 10)) (< 0 (+ v_prenex_27 84)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse13 10))))) (exists ((v_prenex_28 Int)) (and (<= v_prenex_28 134) (not (= 0 (mod v_prenex_28 5))) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_28 5)) (< 37 v_prenex_28) (< v_prenex_28 0)))) (and .cse10 (exists ((v_prenex_38 Int)) (and (< 37 v_prenex_38) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_38 5)) (<= 0 v_prenex_38) (<= v_prenex_38 134)))) (and (exists ((v_prenex_42 Int)) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_42 5)) (<= 0 v_prenex_42) (< 300 v_prenex_42))) .cse6) (and (exists ((v_prenex_24 Int)) (and (not (= 0 (mod v_prenex_24 5))) (< v_prenex_24 0) (<= v_prenex_24 134) (< 37 v_prenex_24) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_24 5)))) (exists ((v_prenex_23 Int)) (let ((.cse14 (* 9 v_prenex_23))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594906) (div .cse14 10)) (< .cse14 0) (not (= 0 (mod .cse14 10))) (< 0 (+ v_prenex_23 84)))))) (and (exists ((v_prenex_14 Int)) (and (<= v_prenex_14 134) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_14 5)) (= 0 (mod v_prenex_14 5)) (< 37 v_prenex_14))) .cse2) (and (exists ((v_prenex_19 Int)) (and (< 300 v_prenex_19) (not (= 0 (mod v_prenex_19 5))) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_19 5)) (< v_prenex_19 0))) (exists ((v_prenex_18 Int)) (let ((.cse15 (* 9 v_prenex_18))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse15 10)) (< 0 (+ v_prenex_18 114)) (<= (+ v_prenex_18 84) 0) (= 0 (mod .cse15 10)))))) (and (exists ((v_prenex_22 Int)) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_22 5)) (<= 0 v_prenex_22) (< 300 v_prenex_22))) .cse3) (and (exists ((v_prenex_8 Int)) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_8 5)) (< 300 v_prenex_8) (<= 0 v_prenex_8))) .cse16) (and (exists ((v_prenex_5 Int)) (and (< 300 v_prenex_5) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_5 5)) (= 0 (mod v_prenex_5 5)))) .cse16) (and (exists ((v_prenex_10 Int)) (and (<= 0 v_prenex_10) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_10 5)) (<= v_prenex_10 37))) .cse0) (and (exists ((v_prenex_44 Int)) (and (= 0 (mod v_prenex_44 5)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_44 5)) (<= v_prenex_44 37))) .cse4) (and (exists ((v_prenex_36 Int)) (and (<= v_prenex_36 37) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_36 5)) (< v_prenex_36 0) (not (= 0 (mod v_prenex_36 5))))) (exists ((v_prenex_35 Int)) (let ((.cse17 (* 9 v_prenex_35))) (and (< 0 (+ v_prenex_35 84)) (<= 0 .cse17) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse17 10)))))))) is different from true [2018-07-24 03:16:14,394 WARN L1032 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_11 Int)) (let ((.cse0 (* 9 v_prenex_11))) (and (< 0 (+ v_prenex_11 84)) (= 0 (mod .cse0 10)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse0 10))))) (exists ((v_prenex_6 Int)) (and (<= v_prenex_6 37) (= 0 (mod v_prenex_6 5)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_6 5))))) (and (exists ((v_prenex_32 Int)) (let ((.cse1 (* 9 v_prenex_32))) (and (< 0 (+ v_prenex_32 84)) (not (= 0 (mod .cse1 10))) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594906) (div .cse1 10)) (< .cse1 0)))) (exists ((v_prenex_34 Int)) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_34 5)) (<= 0 v_prenex_34) (<= v_prenex_34 37)))) (and (exists ((v_prenex_7 Int)) (and (<= 0 v_prenex_7) (<= v_prenex_7 134) (< 37 v_prenex_7) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_7 5)))) (exists ((v_prenex_15 Int)) (let ((.cse2 (* 9 v_prenex_15))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse2 10)) (= 0 (mod .cse2 10)) (< 0 (+ v_prenex_15 84)))))) (and (exists ((v_prenex_21 Int)) (and (= 0 (mod v_prenex_21 5)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_21 5)) (< 300 v_prenex_21))) (exists ((v_prenex_20 Int)) (let ((.cse3 (* 9 v_prenex_20))) (and (= 0 (mod .cse3 10)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse3 10)) (<= (+ v_prenex_20 84) 0) (< 0 (+ v_prenex_20 114)))))) (and (exists ((v_prenex_43 Int)) (let ((.cse4 (* 9 v_prenex_43))) (and (< 0 (+ v_prenex_43 84)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse4 10)) (<= 0 .cse4)))) (exists ((v_prenex_45 Int)) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_45 5)) (<= 0 v_prenex_45) (<= v_prenex_45 37)))) (and (exists ((v_prenex_50 Int)) (let ((.cse5 (* 9 v_prenex_50))) (and (< 0 (+ v_prenex_50 84)) (< .cse5 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594906) (div .cse5 10)) (not (= 0 (mod .cse5 10)))))) (exists ((v_prenex_38 Int)) (and (< 37 v_prenex_38) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_38 5)) (<= 0 v_prenex_38) (<= v_prenex_38 134)))) (and (exists ((v_prenex_29 Int)) (let ((.cse6 (* 9 v_prenex_29))) (and (<= 0 .cse6) (< 0 (+ v_prenex_29 84)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse6 10))))) (exists ((v_prenex_30 Int)) (and (< 37 v_prenex_30) (<= 0 v_prenex_30) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_30 5)) (<= v_prenex_30 134)))) (and (exists ((v_prenex_41 Int)) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_41 5)) (< 300 v_prenex_41) (= 0 (mod v_prenex_41 5)))) (exists ((v_prenex_40 Int)) (let ((.cse7 (* 9 v_prenex_40))) (and (< 0 (+ v_prenex_40 114)) (< .cse7 0) (<= (+ v_prenex_40 84) 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594906) (div .cse7 10)) (not (= 0 (mod .cse7 10))))))) (and (exists ((v_prenex_16 Int)) (let ((.cse8 (* 9 v_prenex_16))) (and (= 0 (mod .cse8 10)) (< 0 (+ v_prenex_16 84)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse8 10))))) (exists ((v_prenex_17 Int)) (and (< v_prenex_17 0) (<= v_prenex_17 37) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_17 5)) (not (= 0 (mod v_prenex_17 5)))))) (and (exists ((v_prenex_48 Int)) (let ((.cse9 (* 9 v_prenex_48))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse9 10)) (<= 0 .cse9) (< 0 (+ v_prenex_48 84))))) (exists ((v_prenex_31 Int)) (and (<= v_prenex_31 134) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_31 5)) (= 0 (mod v_prenex_31 5)) (< 37 v_prenex_31)))) (and (exists ((v_prenex_47 Int)) (and (<= v_prenex_47 134) (not (= 0 (mod v_prenex_47 5))) (< 37 v_prenex_47) (< v_prenex_47 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_47 5)))) (exists ((v_prenex_46 Int)) (let ((.cse10 (* 9 v_prenex_46))) (and (<= 0 .cse10) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse10 10)) (< 0 (+ v_prenex_46 84)))))) (and (exists ((v_prenex_13 Int)) (let ((.cse11 (* 9 v_prenex_13))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse11 10)) (< 0 (+ v_prenex_13 114)) (<= (+ v_prenex_13 84) 0) (<= 0 .cse11)))) (exists ((v_prenex_12 Int)) (and (< 300 v_prenex_12) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_12 5)) (not (= 0 (mod v_prenex_12 5))) (< v_prenex_12 0)))) (and (exists ((v_prenex_10 Int)) (and (<= 0 v_prenex_10) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_10 5)) (<= v_prenex_10 37))) (exists ((v_prenex_55 Int)) (let ((.cse12 (* 9 v_prenex_55))) (and (= 0 (mod .cse12 10)) (< 0 (+ v_prenex_55 84)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse12 10)))))) (and (exists ((v_prenex_37 Int)) (let ((.cse13 (* 9 v_prenex_37))) (and (not (= 0 (mod .cse13 10))) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594906) (div .cse13 10)) (< .cse13 0) (< 0 (+ v_prenex_37 84))))) (exists ((v_prenex_39 Int)) (and (= 0 (mod v_prenex_39 5)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_39 5)) (<= v_prenex_39 134) (< 37 v_prenex_39)))) (and (exists ((v_prenex_25 Int)) (let ((.cse14 (* 9 v_prenex_25))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594906) (div .cse14 10)) (< 0 (+ v_prenex_25 114)) (<= (+ v_prenex_25 84) 0) (not (= 0 (mod .cse14 10))) (< .cse14 0)))) (exists ((v_prenex_26 Int)) (and (< v_prenex_26 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_26 5)) (< 300 v_prenex_26) (not (= 0 (mod v_prenex_26 5)))))) (and (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0_1304 Int)) (and (<= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0_1304 37) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0_1304 5)) (not (= 0 (mod v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0_1304 5))) (< v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0_1304 0))) (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0_1228 Int)) (let ((.cse15 (* 9 v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0_1228))) (and (< 0 (+ v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0_1228 84)) (not (= 0 (mod .cse15 10))) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594906) (div .cse15 10)) (< .cse15 0))))) (and (exists ((v_prenex_27 Int)) (let ((.cse16 (* 9 v_prenex_27))) (and (= 0 (mod .cse16 10)) (< 0 (+ v_prenex_27 84)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse16 10))))) (exists ((v_prenex_28 Int)) (and (<= v_prenex_28 134) (not (= 0 (mod v_prenex_28 5))) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_28 5)) (< 37 v_prenex_28) (< v_prenex_28 0)))) (and (exists ((v_prenex_54 Int)) (let ((.cse17 (* 9 v_prenex_54))) (and (<= 0 .cse17) (<= (+ v_prenex_54 84) 0) (< 0 (+ v_prenex_54 114)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse17 10))))) (exists ((v_prenex_5 Int)) (and (< 300 v_prenex_5) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_5 5)) (= 0 (mod v_prenex_5 5))))) (and (exists ((v_prenex_33 Int)) (and (= 0 (mod v_prenex_33 5)) (<= v_prenex_33 37) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_33 5)))) (exists ((v_prenex_49 Int)) (let ((.cse18 (* 9 v_prenex_49))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594906) (div .cse18 10)) (not (= 0 (mod .cse18 10))) (< 0 (+ v_prenex_49 84)) (< .cse18 0))))) (and (exists ((v_prenex_51 Int)) (let ((.cse19 (* 9 v_prenex_51))) (and (<= (+ v_prenex_51 84) 0) (not (= 0 (mod .cse19 10))) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594906) (div .cse19 10)) (< 0 (+ v_prenex_51 114)) (< .cse19 0)))) (exists ((v_prenex_42 Int)) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_42 5)) (<= 0 v_prenex_42) (< 300 v_prenex_42)))) (and (exists ((v_prenex_24 Int)) (and (not (= 0 (mod v_prenex_24 5))) (< v_prenex_24 0) (<= v_prenex_24 134) (< 37 v_prenex_24) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_24 5)))) (exists ((v_prenex_23 Int)) (let ((.cse20 (* 9 v_prenex_23))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594906) (div .cse20 10)) (< .cse20 0) (not (= 0 (mod .cse20 10))) (< 0 (+ v_prenex_23 84)))))) (and (exists ((v_prenex_19 Int)) (and (< 300 v_prenex_19) (not (= 0 (mod v_prenex_19 5))) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_19 5)) (< v_prenex_19 0))) (exists ((v_prenex_18 Int)) (let ((.cse21 (* 9 v_prenex_18))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse21 10)) (< 0 (+ v_prenex_18 114)) (<= (+ v_prenex_18 84) 0) (= 0 (mod .cse21 10)))))) (and (exists ((v_prenex_53 Int)) (let ((.cse22 (* 9 v_prenex_53))) (and (= 0 (mod .cse22 10)) (< 0 (+ v_prenex_53 114)) (<= (+ v_prenex_53 84) 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse22 10))))) (exists ((v_prenex_22 Int)) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_22 5)) (<= 0 v_prenex_22) (< 300 v_prenex_22)))) (and (exists ((v_prenex_14 Int)) (and (<= v_prenex_14 134) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_14 5)) (= 0 (mod v_prenex_14 5)) (< 37 v_prenex_14))) (exists ((v_prenex_52 Int)) (let ((.cse23 (* 9 v_prenex_52))) (and (= 0 (mod .cse23 10)) (< 0 (+ v_prenex_52 84)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse23 10)))))) (and (exists ((v_prenex_8 Int)) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_8 5)) (< 300 v_prenex_8) (<= 0 v_prenex_8))) (exists ((v_prenex_9 Int)) (let ((.cse24 (* 9 v_prenex_9))) (and (<= 0 .cse24) (<= (+ v_prenex_9 84) 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse24 10)) (< 0 (+ v_prenex_9 114)))))) (and (exists ((v_prenex_44 Int)) (and (= 0 (mod v_prenex_44 5)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200042) (div v_prenex_44 5)) (<= v_prenex_44 37))) (exists ((v_prenex_56 Int)) (let ((.cse25 (* 9 v_prenex_56))) (and (<= 0 .cse25) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse25 10)) (< 0 (+ v_prenex_56 84)))))) (and (exists ((v_prenex_36 Int)) (and (<= v_prenex_36 37) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a28~0 200041) (div v_prenex_36 5)) (< v_prenex_36 0) (not (= 0 (mod v_prenex_36 5))))) (exists ((v_prenex_35 Int)) (let ((.cse26 (* 9 v_prenex_35))) (and (< 0 (+ v_prenex_35 84)) (<= 0 .cse26) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__a14~0 594907) (div .cse26 10))))))) is different from true [2018-07-24 03:16:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2018-07-24 03:16:24,119 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 03:16:24,119 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-07-24 03:16:24,120 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 03:16:24,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 03:16:24,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2018-07-24 03:16:24,121 INFO L87 Difference]: Start difference. First operand 47142 states and 52335 transitions. Second operand 7 states. [2018-07-24 03:17:12,044 WARN L169 SmtUtils]: Spent 42.21 s on a formula simplification. DAG size of input: 483 DAG size of output: 163 [2018-07-24 03:17:22,622 WARN L169 SmtUtils]: Spent 8.48 s on a formula simplification. DAG size of input: 582 DAG size of output: 139 [2018-07-24 03:17:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 03:17:42,598 INFO L93 Difference]: Finished difference Result 150697 states and 166126 transitions. [2018-07-24 03:17:42,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-24 03:17:42,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 507 [2018-07-24 03:17:42,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 03:17:42,693 INFO L225 Difference]: With dead ends: 150697 [2018-07-24 03:17:42,694 INFO L226 Difference]: Without dead ends: 92858 [2018-07-24 03:17:42,730 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 59.5s TimeCoverageRelationStatistics Valid=25, Invalid=35, Unknown=4, NotChecked=26, Total=90 [2018-07-24 03:17:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92858 states. [2018-07-24 03:17:43,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92858 to 85117. [2018-07-24 03:17:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2018-07-24 03:17:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 92466 transitions. [2018-07-24 03:17:43,583 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 92466 transitions. Word has length 507 [2018-07-24 03:17:43,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 03:17:43,584 INFO L471 AbstractCegarLoop]: Abstraction has 85117 states and 92466 transitions. [2018-07-24 03:17:43,584 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 03:17:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 92466 transitions. [2018-07-24 03:17:43,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-07-24 03:17:43,602 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 03:17:43,603 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 03:17:43,603 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 03:17:43,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1160234219, now seen corresponding path program 1 times [2018-07-24 03:17:43,603 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 03:17:43,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 03:17:43,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:17:43,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 03:17:43,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 03:17:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 03:17:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2018-07-24 03:17:44,375 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 03:17:44,376 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 03:17:44,376 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 03:17:44,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 03:17:44,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 03:17:44,377 INFO L87 Difference]: Start difference. First operand 85117 states and 92466 transitions. Second operand 3 states. Received shutdown request... [2018-07-24 03:17:48,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 03:17:48,417 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-24 03:17:48,422 WARN L202 ceAbstractionStarter]: Timeout [2018-07-24 03:17:48,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 03:17:48 BoogieIcfgContainer [2018-07-24 03:17:48,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 03:17:48,424 INFO L168 Benchmark]: Toolchain (without parser) took 245749.02 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 918.0 MB. Max. memory is 7.1 GB. [2018-07-24 03:17:48,425 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 03:17:48,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1827.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-07-24 03:17:48,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 373.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-07-24 03:17:48,427 INFO L168 Benchmark]: Boogie Preprocessor took 947.14 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 987.8 MB). Free memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 145.3 MB. Max. memory is 7.1 GB. [2018-07-24 03:17:48,428 INFO L168 Benchmark]: RCFGBuilder took 13039.89 ms. Allocated memory is still 2.5 GB. Free memory was 2.4 GB in the beginning and 1.9 GB in the end (delta: 504.2 MB). Peak memory consumption was 504.2 MB. Max. memory is 7.1 GB. [2018-07-24 03:17:48,429 INFO L168 Benchmark]: TraceAbstraction took 229552.52 ms. Allocated memory was 2.5 GB in the beginning and 4.1 GB in the end (delta: 1.6 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 390.0 MB. Max. memory is 7.1 GB. [2018-07-24 03:17:48,434 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1827.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 373.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 947.14 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 987.8 MB). Free memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 145.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 13039.89 ms. Allocated memory is still 2.5 GB. Free memory was 2.4 GB in the beginning and 1.9 GB in the end (delta: 504.2 MB). Peak memory consumption was 504.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 229552.52 ms. Allocated memory was 2.5 GB in the beginning and 4.1 GB in the end (delta: 1.6 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 390.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 191]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 191). Cancelled while BasicCegarLoop was constructing difference of abstraction (85117states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (75756 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 591 locations, 1 error locations. TIMEOUT Result, 229.4s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 200.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4170 SDtfs, 26298 SDslu, 3506 SDs, 0 SdLazy, 45923 SolverSat, 8142 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 129.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2019 GetRequests, 1952 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 63.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85117occurred in iteration=9, 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: 4.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 90047 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 4951 NumberOfCodeBlocks, 4951 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4935 ConstructedInterpolants, 226 QuantifiedInterpolants, 46374828 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2605 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 5890/6742 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem17_label05_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_03-17-48-448.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem17_label05_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_03-17-48-448.csv Completed graceful shutdown