java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum03-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:20:41,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:20:41,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:20:41,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:20:41,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:20:41,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:20:41,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:20:41,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:20:41,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:20:41,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:20:41,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:20:41,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:20:41,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:20:41,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:20:41,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:20:41,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:20:41,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:20:41,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:20:41,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:20:41,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:20:41,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:20:41,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:20:41,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:20:41,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:20:41,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:20:41,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:20:41,789 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:20:41,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:20:41,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:20:41,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:20:41,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:20:41,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:20:41,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:20:41,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:20:41,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:20:41,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:20:41,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:20:41,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:20:41,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:20:41,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:20:41,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:20:41,802 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:20:41,837 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:20:41,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:20:41,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:20:41,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:20:41,839 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:20:41,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:20:41,840 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:20:41,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:20:41,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:20:41,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:20:41,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:20:41,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:20:41,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:20:41,841 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:20:41,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:20:41,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:20:41,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:20:41,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:20:41,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:20:41,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:20:41,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:20:41,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:20:41,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:20:41,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:20:41,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:20:41,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:20:41,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:20:41,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:20:41,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:20:41,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:20:41,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:20:41,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:20:41,889 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:20:41,889 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:20:41,890 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-1.i [2019-09-03 19:20:41,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a074e35/3718d33b6ddc4bb88bc3a45a3a10a877/FLAG13efbc7ae [2019-09-03 19:20:42,362 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:20:42,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i [2019-09-03 19:20:42,369 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a074e35/3718d33b6ddc4bb88bc3a45a3a10a877/FLAG13efbc7ae [2019-09-03 19:20:42,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a074e35/3718d33b6ddc4bb88bc3a45a3a10a877 [2019-09-03 19:20:42,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:20:42,781 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:20:42,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:20:42,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:20:42,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:20:42,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:20:42" (1/1) ... [2019-09-03 19:20:42,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7472fefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:42, skipping insertion in model container [2019-09-03 19:20:42,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:20:42" (1/1) ... [2019-09-03 19:20:42,799 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:20:42,818 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:20:43,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:20:43,039 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:20:43,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:20:43,077 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:20:43,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:43 WrapperNode [2019-09-03 19:20:43,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:20:43,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:20:43,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:20:43,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:20:43,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:43" (1/1) ... [2019-09-03 19:20:43,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:43" (1/1) ... [2019-09-03 19:20:43,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:43" (1/1) ... [2019-09-03 19:20:43,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:43" (1/1) ... [2019-09-03 19:20:43,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:43" (1/1) ... [2019-09-03 19:20:43,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:43" (1/1) ... [2019-09-03 19:20:43,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:43" (1/1) ... [2019-09-03 19:20:43,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:20:43,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:20:43,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:20:43,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:20:43,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:20:43,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:20:43,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:20:43,279 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:20:43,279 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:20:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:20:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:20:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 19:20:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:20:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:20:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:20:43,428 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:20:43,428 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 19:20:43,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:20:43 BoogieIcfgContainer [2019-09-03 19:20:43,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:20:43,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:20:43,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:20:43,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:20:43,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:20:42" (1/3) ... [2019-09-03 19:20:43,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5119d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:20:43, skipping insertion in model container [2019-09-03 19:20:43,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:20:43" (2/3) ... [2019-09-03 19:20:43,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5119d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:20:43, skipping insertion in model container [2019-09-03 19:20:43,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:20:43" (3/3) ... [2019-09-03 19:20:43,437 INFO L109 eAbstractionObserver]: Analyzing ICFG sum03-1.i [2019-09-03 19:20:43,452 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:20:43,467 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:20:43,511 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:20:43,559 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:20:43,560 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:20:43,560 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:20:43,560 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:20:43,560 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:20:43,560 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:20:43,561 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:20:43,561 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:20:43,561 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:20:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-03 19:20:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:20:43,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:43,588 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:43,592 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:43,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:43,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1345568573, now seen corresponding path program 1 times [2019-09-03 19:20:43,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:43,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:43,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:43,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:43,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:43,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:20:43,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:20:43,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:20:43,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:20:43,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:20:43,902 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 6 states. [2019-09-03 19:20:44,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:44,020 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2019-09-03 19:20:44,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:20:44,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-03 19:20:44,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:44,029 INFO L225 Difference]: With dead ends: 38 [2019-09-03 19:20:44,029 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 19:20:44,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:20:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 19:20:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-03 19:20:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 19:20:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-03 19:20:44,070 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 12 [2019-09-03 19:20:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:44,070 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-03 19:20:44,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:20:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-03 19:20:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:20:44,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:44,072 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:44,072 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1402826875, now seen corresponding path program 1 times [2019-09-03 19:20:44,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:44,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:44,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:44,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:44,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:44,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:20:44,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:20:44,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:20:44,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:20:44,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:20:44,133 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2019-09-03 19:20:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:44,169 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-03 19:20:44,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:20:44,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 19:20:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:44,173 INFO L225 Difference]: With dead ends: 35 [2019-09-03 19:20:44,173 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 19:20:44,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:20:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 19:20:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 19:20:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:20:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-03 19:20:44,184 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 12 [2019-09-03 19:20:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:44,185 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-03 19:20:44,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:20:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-03 19:20:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:20:44,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:44,187 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:44,187 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:44,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:44,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1436486517, now seen corresponding path program 1 times [2019-09-03 19:20:44,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:44,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:44,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:44,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:44,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:44,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:44,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:44,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:20:44,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:44,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:44,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-03 19:20:44,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:20:44,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:20:44,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:20:44,393 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2019-09-03 19:20:44,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:44,453 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-09-03 19:20:44,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:20:44,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-03 19:20:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:44,456 INFO L225 Difference]: With dead ends: 48 [2019-09-03 19:20:44,456 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 19:20:44,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:20:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 19:20:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-03 19:20:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:20:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-03 19:20:44,483 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2019-09-03 19:20:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:44,484 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-03 19:20:44,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:20:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-03 19:20:44,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:20:44,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:44,487 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:44,488 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:44,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:44,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1136980881, now seen corresponding path program 2 times [2019-09-03 19:20:44,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:44,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:44,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:44,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:44,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:20:44,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:44,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:20:44,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:44,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:20:44,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:44,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:20:44,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:20:44,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:44,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-03 19:20:44,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:20:44,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:20:44,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:20:44,690 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2019-09-03 19:20:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:44,746 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-09-03 19:20:44,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:20:44,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-03 19:20:44,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:44,748 INFO L225 Difference]: With dead ends: 44 [2019-09-03 19:20:44,749 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 19:20:44,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:20:44,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 19:20:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-03 19:20:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:20:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-03 19:20:44,758 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2019-09-03 19:20:44,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:44,758 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-03 19:20:44,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:20:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-03 19:20:44,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:20:44,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:44,760 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:44,761 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:44,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:44,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1851034775, now seen corresponding path program 3 times [2019-09-03 19:20:44,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:44,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:44,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:44,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:44,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:20:44,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:44,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:20:44,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:21:09,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:21:09,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:09,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:21:09,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:21:09,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:09,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-03 19:21:09,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:21:09,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:21:09,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:21:09,647 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-09-03 19:21:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:09,723 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-09-03 19:21:09,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:21:09,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-09-03 19:21:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:09,724 INFO L225 Difference]: With dead ends: 48 [2019-09-03 19:21:09,724 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 19:21:09,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:21:09,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 19:21:09,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-03 19:21:09,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:21:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-09-03 19:21:09,732 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2019-09-03 19:21:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:09,733 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-09-03 19:21:09,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:21:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-09-03 19:21:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:21:09,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:09,734 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:21:09,735 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:09,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:09,735 INFO L82 PathProgramCache]: Analyzing trace with hash 103432291, now seen corresponding path program 4 times [2019-09-03 19:21:09,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:09,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:09,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:09,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:21:09,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:21:09,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:09,859 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:21:09,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:21:09,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:21:09,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:09,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:21:09,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:21:09,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:09,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 19:21:09,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:21:09,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:21:09,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:21:09,934 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 8 states. [2019-09-03 19:21:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:10,036 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-09-03 19:21:10,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:21:10,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-09-03 19:21:10,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:10,038 INFO L225 Difference]: With dead ends: 52 [2019-09-03 19:21:10,038 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 19:21:10,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:21:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 19:21:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-03 19:21:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 19:21:10,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-09-03 19:21:10,046 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 44 [2019-09-03 19:21:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:10,047 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-09-03 19:21:10,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:21:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-09-03 19:21:10,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:21:10,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:10,048 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:21:10,049 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:10,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:10,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1878094685, now seen corresponding path program 5 times [2019-09-03 19:21:10,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:10,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:10,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:10,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:21:10,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:21:10,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:10,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:21:10,253 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:22:03,546 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:22:03,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:04,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:22:04,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:22:04,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:04,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-03 19:22:04,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:22:04,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:22:04,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:22:04,665 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 9 states. [2019-09-03 19:22:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:04,797 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-09-03 19:22:04,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:22:04,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-09-03 19:22:04,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:04,802 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:22:04,803 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 19:22:04,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:22:04,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 19:22:04,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-03 19:22:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 19:22:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-09-03 19:22:04,813 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 52 [2019-09-03 19:22:04,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:04,813 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-09-03 19:22:04,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:22:04,814 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-09-03 19:22:04,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 19:22:04,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:04,815 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:04,816 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:04,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:04,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1262160983, now seen corresponding path program 6 times [2019-09-03 19:22:04,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:04,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:04,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:04,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:04,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:05,001 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:22:05,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:05,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:22:05,021 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:55,509 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:22:55,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:55,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:22:55,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:55,631 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:22:55,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:55,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-03 19:22:55,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:22:55,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:22:55,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:22:55,641 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 10 states. [2019-09-03 19:22:55,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:55,795 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-09-03 19:22:55,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:22:55,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-09-03 19:22:55,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:55,797 INFO L225 Difference]: With dead ends: 60 [2019-09-03 19:22:55,797 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 19:22:55,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:22:55,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 19:22:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-03 19:22:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 19:22:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-09-03 19:22:55,807 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 60 [2019-09-03 19:22:55,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:55,809 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-09-03 19:22:55,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:22:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-09-03 19:22:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 19:22:55,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:55,813 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:55,813 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:55,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:55,814 INFO L82 PathProgramCache]: Analyzing trace with hash 977341265, now seen corresponding path program 7 times [2019-09-03 19:22:55,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:55,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:55,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:55,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:55,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:55,988 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:22:55,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:55,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:56,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:56,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 19:22:56,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:56,090 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:22:56,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:56,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-03 19:22:56,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:22:56,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:22:56,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:22:56,098 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 11 states. [2019-09-03 19:22:56,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:56,304 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2019-09-03 19:22:56,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:22:56,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-09-03 19:22:56,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:56,306 INFO L225 Difference]: With dead ends: 64 [2019-09-03 19:22:56,306 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 19:22:56,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:22:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 19:22:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-03 19:22:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 19:22:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-09-03 19:22:56,315 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 68 [2019-09-03 19:22:56,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:56,315 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-09-03 19:22:56,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:22:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-09-03 19:22:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 19:22:56,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:56,317 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:56,317 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:56,318 INFO L82 PathProgramCache]: Analyzing trace with hash 87912523, now seen corresponding path program 8 times [2019-09-03 19:22:56,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:56,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:56,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:56,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:56,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:22:56,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:56,519 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:56,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:22:56,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:22:56,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:56,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 19:22:56,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:22:56,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:56,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-03 19:22:56,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:22:56,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:22:56,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:22:56,657 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 12 states. [2019-09-03 19:22:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:56,932 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2019-09-03 19:22:56,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:22:56,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2019-09-03 19:22:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:56,935 INFO L225 Difference]: With dead ends: 68 [2019-09-03 19:22:56,935 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 19:22:56,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:22:56,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 19:22:56,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-03 19:22:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 19:22:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2019-09-03 19:22:56,952 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 76 [2019-09-03 19:22:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:56,953 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2019-09-03 19:22:56,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:22:56,953 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2019-09-03 19:22:56,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 19:22:56,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:56,955 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:56,955 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:56,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:56,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1704314043, now seen corresponding path program 9 times [2019-09-03 19:22:56,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:56,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:56,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:56,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:56,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 19:22:57,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:57,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:57,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:24:36,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 19:24:36,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:24:36,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:24:36,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:24:37,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:37,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-03 19:24:37,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:24:37,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:24:37,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:24:37,031 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 13 states. [2019-09-03 19:24:37,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:37,409 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2019-09-03 19:24:37,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:24:37,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 84 [2019-09-03 19:24:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:37,411 INFO L225 Difference]: With dead ends: 72 [2019-09-03 19:24:37,411 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 19:24:37,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:24:37,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 19:24:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-03 19:24:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-03 19:24:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-09-03 19:24:37,420 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 84 [2019-09-03 19:24:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:37,420 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-09-03 19:24:37,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:24:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-09-03 19:24:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 19:24:37,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:37,422 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:37,422 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:37,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:37,423 INFO L82 PathProgramCache]: Analyzing trace with hash 234974271, now seen corresponding path program 10 times [2019-09-03 19:24:37,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:37,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:37,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:37,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:24:37,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 19:24:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 19:24:37,540 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-03 19:24:37,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:24:37 BoogieIcfgContainer [2019-09-03 19:24:37,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:24:37,600 INFO L168 Benchmark]: Toolchain (without parser) took 234816.87 ms. Allocated memory was 130.0 MB in the beginning and 274.2 MB in the end (delta: 144.2 MB). Free memory was 86.6 MB in the beginning and 107.4 MB in the end (delta: -20.8 MB). Peak memory consumption was 123.4 MB. Max. memory is 7.1 GB. [2019-09-03 19:24:37,602 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 130.0 MB. Free memory was 104.3 MB in the beginning and 104.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:24:37,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.54 ms. Allocated memory is still 130.0 MB. Free memory was 86.2 MB in the beginning and 77.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-03 19:24:37,607 INFO L168 Benchmark]: Boogie Preprocessor took 132.92 ms. Allocated memory was 130.0 MB in the beginning and 198.2 MB in the end (delta: 68.2 MB). Free memory was 77.1 MB in the beginning and 174.9 MB in the end (delta: -97.8 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-09-03 19:24:37,608 INFO L168 Benchmark]: RCFGBuilder took 217.12 ms. Allocated memory is still 198.2 MB. Free memory was 174.9 MB in the beginning and 162.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2019-09-03 19:24:37,609 INFO L168 Benchmark]: TraceAbstraction took 234165.90 ms. Allocated memory was 198.2 MB in the beginning and 274.2 MB in the end (delta: 76.0 MB). Free memory was 162.2 MB in the beginning and 107.4 MB in the end (delta: 54.8 MB). Peak memory consumption was 130.8 MB. Max. memory is 7.1 GB. [2019-09-03 19:24:37,616 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 130.0 MB. Free memory was 104.3 MB in the beginning and 104.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 296.54 ms. Allocated memory is still 130.0 MB. Free memory was 86.2 MB in the beginning and 77.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.92 ms. Allocated memory was 130.0 MB in the beginning and 198.2 MB in the end (delta: 68.2 MB). Free memory was 77.1 MB in the beginning and 174.9 MB in the end (delta: -97.8 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 217.12 ms. Allocated memory is still 198.2 MB. Free memory was 174.9 MB in the beginning and 162.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 234165.90 ms. Allocated memory was 198.2 MB in the beginning and 274.2 MB in the end (delta: 76.0 MB). Free memory was 162.2 MB in the beginning and 107.4 MB in the end (delta: 54.8 MB). Peak memory consumption was 130.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int sn=0; [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L12] unsigned int x=0; VAL [loop1=2, n1=3, sn=0, x=0] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=0, x=0] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=2, x=0] [L17] x++ VAL [loop1=2, n1=3, sn=2, x=1] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=2, x=1] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=2, x=1] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=4, x=1] [L17] x++ VAL [loop1=2, n1=3, sn=4, x=2] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=4, x=2] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=4, x=2] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=6, x=2] [L17] x++ VAL [loop1=2, n1=3, sn=6, x=3] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=6, x=3] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=6, x=3] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=8, x=3] [L17] x++ VAL [loop1=2, n1=3, sn=8, x=4] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=8, x=4] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=8, x=4] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=10, x=4] [L17] x++ VAL [loop1=2, n1=3, sn=10, x=5] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=10, x=5] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=10, x=5] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=12, x=5] [L17] x++ VAL [loop1=2, n1=3, sn=12, x=6] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=12, x=6] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=12, x=6] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=14, x=6] [L17] x++ VAL [loop1=2, n1=3, sn=14, x=7] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=14, x=7] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=14, x=7] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=16, x=7] [L17] x++ VAL [loop1=2, n1=3, sn=16, x=8] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=16, x=8] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=16, x=8] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=18, x=8] [L17] x++ VAL [loop1=2, n1=3, sn=18, x=9] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=18, x=9] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=18, x=9] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=20, x=9] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=10] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=20, x=10] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=20, x=10] [L14] COND FALSE !(x<10) VAL [loop1=2, n1=3, sn=20, x=10] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=11] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 234.0s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 281 SDtfs, 69 SDslu, 1349 SDs, 0 SdLazy, 1227 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 461 SyntacticMatches, 21 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 228.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1052 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 940 ConstructedInterpolants, 0 QuantifiedInterpolants, 205168 SizeOfPredicates, 9 NumberOfNonLiveVariables, 954 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 1320/2460 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...