/usr/bin/java -ea -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/loop-lit/afnp2014.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:29:01,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:29:01,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:29:01,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:29:01,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:29:01,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:29:01,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:29:01,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:29:01,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:29:01,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:29:01,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:29:01,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:29:01,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:29:01,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:29:01,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:29:01,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:29:01,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:29:01,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:29:01,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:29:01,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:29:01,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:29:01,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:29:01,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:29:01,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:29:01,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:29:01,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:29:01,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:29:01,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:29:01,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:29:01,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:29:01,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:29:01,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:29:01,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:29:01,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:29:01,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:29:01,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:29:01,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:29:01,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:29:01,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:29:01,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:29:01,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:29:01,193 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 [2020-07-10 15:29:01,209 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:29:01,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:29:01,210 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:29:01,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:29:01,211 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:29:01,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:29:01,212 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:29:01,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:29:01,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:29:01,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:29:01,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:29:01,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:29:01,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:29:01,213 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:29:01,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:29:01,214 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:29:01,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:29:01,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:29:01,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:29:01,214 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:29:01,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:29:01,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:29:01,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:29:01,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:29:01,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:29:01,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:29:01,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:29:01,216 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:29:01,216 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:29:01,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:29:01,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:29:01,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:29:01,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:29:01,575 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:29:01,576 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:29:01,577 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/afnp2014.i [2020-07-10 15:29:01,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0486e80/487688e2d61744cc8ca09fa55e32a3e5/FLAG0ea2411b1 [2020-07-10 15:29:02,198 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:29:02,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/afnp2014.i [2020-07-10 15:29:02,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0486e80/487688e2d61744cc8ca09fa55e32a3e5/FLAG0ea2411b1 [2020-07-10 15:29:02,515 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0486e80/487688e2d61744cc8ca09fa55e32a3e5 [2020-07-10 15:29:02,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:29:02,532 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:29:02,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:02,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:29:02,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:29:02,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:02" (1/1) ... [2020-07-10 15:29:02,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716a727c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:02, skipping insertion in model container [2020-07-10 15:29:02,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:02" (1/1) ... [2020-07-10 15:29:02,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:29:02,588 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:29:02,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:02,916 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:29:02,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:02,962 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:29:02,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:02 WrapperNode [2020-07-10 15:29:02,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:02,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:29:02,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:29:02,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:29:02,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:02" (1/1) ... [2020-07-10 15:29:02,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:02" (1/1) ... [2020-07-10 15:29:02,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:02" (1/1) ... [2020-07-10 15:29:02,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:02" (1/1) ... [2020-07-10 15:29:02,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:02" (1/1) ... [2020-07-10 15:29:03,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:02" (1/1) ... [2020-07-10 15:29:03,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:02" (1/1) ... [2020-07-10 15:29:03,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:29:03,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:29:03,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:29:03,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:29:03,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:29:03,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:29:03,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:29:03,197 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:29:03,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:29:03,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:29:03,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:29:03,198 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:29:03,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:29:03,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:29:03,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:29:03,199 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:29:03,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:29:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:29:03,517 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:29:03,517 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:29:03,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:03 BoogieIcfgContainer [2020-07-10 15:29:03,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:29:03,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:29:03,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:29:03,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:29:03,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:29:02" (1/3) ... [2020-07-10 15:29:03,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2932154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:03, skipping insertion in model container [2020-07-10 15:29:03,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:02" (2/3) ... [2020-07-10 15:29:03,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2932154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:03, skipping insertion in model container [2020-07-10 15:29:03,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:03" (3/3) ... [2020-07-10 15:29:03,537 INFO L109 eAbstractionObserver]: Analyzing ICFG afnp2014.i [2020-07-10 15:29:03,558 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:29:03,575 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:29:03,605 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:29:03,655 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:29:03,657 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:29:03,658 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:29:03,658 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:29:03,658 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:29:03,658 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:29:03,658 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:29:03,659 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:29:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-10 15:29:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:29:03,699 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:03,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:03,702 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:03,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:03,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1915647303, now seen corresponding path program 1 times [2020-07-10 15:29:03,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:03,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147647734] [2020-07-10 15:29:03,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:03,921 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-10 15:29:03,922 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2020-07-10 15:29:03,925 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-10 15:29:03,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-10 15:29:03,926 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2020-07-10 15:29:03,926 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2020-07-10 15:29:03,927 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} ~x~0 := 1;~y~0 := 0; {23#true} is VALID [2020-07-10 15:29:03,929 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#true} assume !true; {24#false} is VALID [2020-07-10 15:29:03,930 INFO L263 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {24#false} is VALID [2020-07-10 15:29:03,931 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2020-07-10 15:29:03,931 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2020-07-10 15:29:03,931 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-10 15:29:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:03,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147647734] [2020-07-10 15:29:03,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:03,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:29:03,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84748590] [2020-07-10 15:29:03,947 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-10 15:29:03,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:03,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:29:03,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:03,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:29:03,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:04,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:29:04,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:29:04,010 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-10 15:29:04,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:04,103 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-10 15:29:04,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:29:04,103 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-10 15:29:04,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:04,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:29:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2020-07-10 15:29:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:29:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2020-07-10 15:29:04,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2020-07-10 15:29:04,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:04,240 INFO L225 Difference]: With dead ends: 32 [2020-07-10 15:29:04,240 INFO L226 Difference]: Without dead ends: 13 [2020-07-10 15:29:04,246 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:29:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-10 15:29:04,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-10 15:29:04,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:04,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:04,315 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:04,316 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:04,320 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-10 15:29:04,321 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-10 15:29:04,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:04,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:04,322 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:04,322 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:04,327 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-10 15:29:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-10 15:29:04,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:04,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:04,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:04,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:29:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-10 15:29:04,334 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2020-07-10 15:29:04,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:04,335 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-10 15:29:04,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:29:04,336 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-10 15:29:04,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 15:29:04,337 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:04,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:04,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:29:04,338 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:04,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:04,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2084433522, now seen corresponding path program 1 times [2020-07-10 15:29:04,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:04,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897243950] [2020-07-10 15:29:04,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:04,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {116#true} assume true; {116#true} is VALID [2020-07-10 15:29:04,525 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {116#true} {116#true} #47#return; {116#true} is VALID [2020-07-10 15:29:04,525 INFO L263 TraceCheckUtils]: 0: Hoare triple {116#true} call ULTIMATE.init(); {116#true} is VALID [2020-07-10 15:29:04,526 INFO L280 TraceCheckUtils]: 1: Hoare triple {116#true} assume true; {116#true} is VALID [2020-07-10 15:29:04,527 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {116#true} {116#true} #47#return; {116#true} is VALID [2020-07-10 15:29:04,527 INFO L263 TraceCheckUtils]: 3: Hoare triple {116#true} call #t~ret2 := main(); {116#true} is VALID [2020-07-10 15:29:04,529 INFO L280 TraceCheckUtils]: 4: Hoare triple {116#true} ~x~0 := 1;~y~0 := 0; {120#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:04,530 INFO L280 TraceCheckUtils]: 5: Hoare triple {120#(<= main_~y~0 main_~x~0)} #t~short1 := ~y~0 < 1000; {120#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:04,531 INFO L280 TraceCheckUtils]: 6: Hoare triple {120#(<= main_~y~0 main_~x~0)} assume #t~short1;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;#t~short1 := 0 != #t~nondet0; {120#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:04,533 INFO L280 TraceCheckUtils]: 7: Hoare triple {120#(<= main_~y~0 main_~x~0)} assume !#t~short1;havoc #t~nondet0;havoc #t~short1; {120#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:04,535 INFO L263 TraceCheckUtils]: 8: Hoare triple {120#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {121#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:04,539 INFO L280 TraceCheckUtils]: 9: Hoare triple {121#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {122#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:04,541 INFO L280 TraceCheckUtils]: 10: Hoare triple {122#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {117#false} is VALID [2020-07-10 15:29:04,541 INFO L280 TraceCheckUtils]: 11: Hoare triple {117#false} assume !false; {117#false} is VALID [2020-07-10 15:29:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:04,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897243950] [2020-07-10 15:29:04,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:04,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:29:04,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652241022] [2020-07-10 15:29:04,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-10 15:29:04,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:04,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:29:04,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:04,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:29:04,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:04,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:29:04,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:29:04,577 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2020-07-10 15:29:04,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:04,714 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-10 15:29:04,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:29:04,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-10 15:29:04,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:29:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-07-10 15:29:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:29:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-07-10 15:29:04,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2020-07-10 15:29:04,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:04,764 INFO L225 Difference]: With dead ends: 21 [2020-07-10 15:29:04,764 INFO L226 Difference]: Without dead ends: 16 [2020-07-10 15:29:04,766 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:29:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-10 15:29:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-10 15:29:04,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:04,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-10 15:29:04,778 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-10 15:29:04,778 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-10 15:29:04,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:04,781 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-10 15:29:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-10 15:29:04,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:04,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:04,782 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-10 15:29:04,783 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-10 15:29:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:04,785 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-10 15:29:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-10 15:29:04,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:04,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:04,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:04,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:04,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 15:29:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-10 15:29:04,790 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2020-07-10 15:29:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:04,790 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-10 15:29:04,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:29:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-10 15:29:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 15:29:04,792 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:04,792 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:04,793 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:29:04,793 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:04,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:04,794 INFO L82 PathProgramCache]: Analyzing trace with hash 249504553, now seen corresponding path program 1 times [2020-07-10 15:29:04,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:04,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561145231] [2020-07-10 15:29:04,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:04,933 INFO L280 TraceCheckUtils]: 0: Hoare triple {214#true} assume true; {214#true} is VALID [2020-07-10 15:29:04,934 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {214#true} {214#true} #47#return; {214#true} is VALID [2020-07-10 15:29:04,934 INFO L263 TraceCheckUtils]: 0: Hoare triple {214#true} call ULTIMATE.init(); {214#true} is VALID [2020-07-10 15:29:04,935 INFO L280 TraceCheckUtils]: 1: Hoare triple {214#true} assume true; {214#true} is VALID [2020-07-10 15:29:04,935 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {214#true} {214#true} #47#return; {214#true} is VALID [2020-07-10 15:29:04,935 INFO L263 TraceCheckUtils]: 3: Hoare triple {214#true} call #t~ret2 := main(); {214#true} is VALID [2020-07-10 15:29:04,937 INFO L280 TraceCheckUtils]: 4: Hoare triple {214#true} ~x~0 := 1;~y~0 := 0; {218#(<= 1 main_~x~0)} is VALID [2020-07-10 15:29:04,938 INFO L280 TraceCheckUtils]: 5: Hoare triple {218#(<= 1 main_~x~0)} #t~short1 := ~y~0 < 1000; {218#(<= 1 main_~x~0)} is VALID [2020-07-10 15:29:04,939 INFO L280 TraceCheckUtils]: 6: Hoare triple {218#(<= 1 main_~x~0)} assume #t~short1;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;#t~short1 := 0 != #t~nondet0; {218#(<= 1 main_~x~0)} is VALID [2020-07-10 15:29:04,940 INFO L280 TraceCheckUtils]: 7: Hoare triple {218#(<= 1 main_~x~0)} assume !!#t~short1;havoc #t~nondet0;havoc #t~short1;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {219#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:04,942 INFO L280 TraceCheckUtils]: 8: Hoare triple {219#(<= main_~y~0 main_~x~0)} #t~short1 := ~y~0 < 1000; {219#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:04,943 INFO L280 TraceCheckUtils]: 9: Hoare triple {219#(<= main_~y~0 main_~x~0)} assume #t~short1;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;#t~short1 := 0 != #t~nondet0; {219#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:04,944 INFO L280 TraceCheckUtils]: 10: Hoare triple {219#(<= main_~y~0 main_~x~0)} assume !#t~short1;havoc #t~nondet0;havoc #t~short1; {219#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:04,946 INFO L263 TraceCheckUtils]: 11: Hoare triple {219#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {220#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:04,947 INFO L280 TraceCheckUtils]: 12: Hoare triple {220#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {221#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:04,948 INFO L280 TraceCheckUtils]: 13: Hoare triple {221#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {215#false} is VALID [2020-07-10 15:29:04,949 INFO L280 TraceCheckUtils]: 14: Hoare triple {215#false} assume !false; {215#false} is VALID [2020-07-10 15:29:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:04,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561145231] [2020-07-10 15:29:04,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280866985] [2020-07-10 15:29:04,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:04,995 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:29:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:05,011 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:05,127 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:05,178 INFO L263 TraceCheckUtils]: 0: Hoare triple {214#true} call ULTIMATE.init(); {214#true} is VALID [2020-07-10 15:29:05,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {214#true} assume true; {214#true} is VALID [2020-07-10 15:29:05,179 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {214#true} {214#true} #47#return; {214#true} is VALID [2020-07-10 15:29:05,180 INFO L263 TraceCheckUtils]: 3: Hoare triple {214#true} call #t~ret2 := main(); {214#true} is VALID [2020-07-10 15:29:05,181 INFO L280 TraceCheckUtils]: 4: Hoare triple {214#true} ~x~0 := 1;~y~0 := 0; {218#(<= 1 main_~x~0)} is VALID [2020-07-10 15:29:05,182 INFO L280 TraceCheckUtils]: 5: Hoare triple {218#(<= 1 main_~x~0)} #t~short1 := ~y~0 < 1000; {218#(<= 1 main_~x~0)} is VALID [2020-07-10 15:29:05,184 INFO L280 TraceCheckUtils]: 6: Hoare triple {218#(<= 1 main_~x~0)} assume #t~short1;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;#t~short1 := 0 != #t~nondet0; {218#(<= 1 main_~x~0)} is VALID [2020-07-10 15:29:05,185 INFO L280 TraceCheckUtils]: 7: Hoare triple {218#(<= 1 main_~x~0)} assume !!#t~short1;havoc #t~nondet0;havoc #t~short1;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {219#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:05,186 INFO L280 TraceCheckUtils]: 8: Hoare triple {219#(<= main_~y~0 main_~x~0)} #t~short1 := ~y~0 < 1000; {219#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:05,187 INFO L280 TraceCheckUtils]: 9: Hoare triple {219#(<= main_~y~0 main_~x~0)} assume #t~short1;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;#t~short1 := 0 != #t~nondet0; {219#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:05,188 INFO L280 TraceCheckUtils]: 10: Hoare triple {219#(<= main_~y~0 main_~x~0)} assume !#t~short1;havoc #t~nondet0;havoc #t~short1; {219#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:05,191 INFO L263 TraceCheckUtils]: 11: Hoare triple {219#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {258#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:29:05,192 INFO L280 TraceCheckUtils]: 12: Hoare triple {258#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:05,193 INFO L280 TraceCheckUtils]: 13: Hoare triple {262#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {215#false} is VALID [2020-07-10 15:29:05,193 INFO L280 TraceCheckUtils]: 14: Hoare triple {215#false} assume !false; {215#false} is VALID [2020-07-10 15:29:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:05,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:05,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-10 15:29:05,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633999978] [2020-07-10 15:29:05,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-10 15:29:05,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:05,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:29:05,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:05,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:29:05,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:05,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:29:05,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:29:05,227 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2020-07-10 15:29:05,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:05,406 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-07-10 15:29:05,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:29:05,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-10 15:29:05,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:29:05,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-07-10 15:29:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:29:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-07-10 15:29:05,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2020-07-10 15:29:05,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:05,476 INFO L225 Difference]: With dead ends: 24 [2020-07-10 15:29:05,477 INFO L226 Difference]: Without dead ends: 19 [2020-07-10 15:29:05,478 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:29:05,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-10 15:29:05,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-10 15:29:05,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:05,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-10 15:29:05,494 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 15:29:05,495 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 15:29:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:05,497 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2020-07-10 15:29:05,497 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-07-10 15:29:05,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:05,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:05,499 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 15:29:05,499 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 15:29:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:05,502 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2020-07-10 15:29:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-07-10 15:29:05,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:05,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:05,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:05,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:29:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2020-07-10 15:29:05,506 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 15 [2020-07-10 15:29:05,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:05,507 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-07-10 15:29:05,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:29:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-07-10 15:29:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:29:05,508 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:05,509 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:05,723 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:29:05,723 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:05,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:05,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2070634734, now seen corresponding path program 2 times [2020-07-10 15:29:05,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:05,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083021787] [2020-07-10 15:29:05,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:05,895 INFO L280 TraceCheckUtils]: 0: Hoare triple {373#true} assume true; {373#true} is VALID [2020-07-10 15:29:05,895 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {373#true} {373#true} #47#return; {373#true} is VALID [2020-07-10 15:29:05,896 INFO L263 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2020-07-10 15:29:05,896 INFO L280 TraceCheckUtils]: 1: Hoare triple {373#true} assume true; {373#true} is VALID [2020-07-10 15:29:05,896 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {373#true} {373#true} #47#return; {373#true} is VALID [2020-07-10 15:29:05,897 INFO L263 TraceCheckUtils]: 3: Hoare triple {373#true} call #t~ret2 := main(); {373#true} is VALID [2020-07-10 15:29:05,898 INFO L280 TraceCheckUtils]: 4: Hoare triple {373#true} ~x~0 := 1;~y~0 := 0; {377#(<= 1 (+ main_~x~0 main_~y~0))} is VALID [2020-07-10 15:29:05,898 INFO L280 TraceCheckUtils]: 5: Hoare triple {377#(<= 1 (+ main_~x~0 main_~y~0))} #t~short1 := ~y~0 < 1000; {377#(<= 1 (+ main_~x~0 main_~y~0))} is VALID [2020-07-10 15:29:05,899 INFO L280 TraceCheckUtils]: 6: Hoare triple {377#(<= 1 (+ main_~x~0 main_~y~0))} assume #t~short1;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;#t~short1 := 0 != #t~nondet0; {377#(<= 1 (+ main_~x~0 main_~y~0))} is VALID [2020-07-10 15:29:05,900 INFO L280 TraceCheckUtils]: 7: Hoare triple {377#(<= 1 (+ main_~x~0 main_~y~0))} assume !!#t~short1;havoc #t~nondet0;havoc #t~short1;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {378#(<= 1 main_~x~0)} is VALID [2020-07-10 15:29:05,901 INFO L280 TraceCheckUtils]: 8: Hoare triple {378#(<= 1 main_~x~0)} #t~short1 := ~y~0 < 1000; {378#(<= 1 main_~x~0)} is VALID [2020-07-10 15:29:05,902 INFO L280 TraceCheckUtils]: 9: Hoare triple {378#(<= 1 main_~x~0)} assume #t~short1;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;#t~short1 := 0 != #t~nondet0; {378#(<= 1 main_~x~0)} is VALID [2020-07-10 15:29:05,903 INFO L280 TraceCheckUtils]: 10: Hoare triple {378#(<= 1 main_~x~0)} assume !!#t~short1;havoc #t~nondet0;havoc #t~short1;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {379#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:05,904 INFO L280 TraceCheckUtils]: 11: Hoare triple {379#(<= main_~y~0 main_~x~0)} #t~short1 := ~y~0 < 1000; {379#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:05,905 INFO L280 TraceCheckUtils]: 12: Hoare triple {379#(<= main_~y~0 main_~x~0)} assume #t~short1;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;#t~short1 := 0 != #t~nondet0; {379#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:05,906 INFO L280 TraceCheckUtils]: 13: Hoare triple {379#(<= main_~y~0 main_~x~0)} assume !#t~short1;havoc #t~nondet0;havoc #t~short1; {379#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:05,907 INFO L263 TraceCheckUtils]: 14: Hoare triple {379#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {380#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:05,908 INFO L280 TraceCheckUtils]: 15: Hoare triple {380#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {381#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:05,909 INFO L280 TraceCheckUtils]: 16: Hoare triple {381#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {374#false} is VALID [2020-07-10 15:29:05,909 INFO L280 TraceCheckUtils]: 17: Hoare triple {374#false} assume !false; {374#false} is VALID [2020-07-10 15:29:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:05,910 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083021787] [2020-07-10 15:29:05,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031736881] [2020-07-10 15:29:05,911 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:05,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:29:05,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:29:05,938 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:29:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:05,946 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:06,032 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:06,090 INFO L263 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2020-07-10 15:29:06,091 INFO L280 TraceCheckUtils]: 1: Hoare triple {373#true} assume true; {373#true} is VALID [2020-07-10 15:29:06,091 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {373#true} {373#true} #47#return; {373#true} is VALID [2020-07-10 15:29:06,091 INFO L263 TraceCheckUtils]: 3: Hoare triple {373#true} call #t~ret2 := main(); {373#true} is VALID [2020-07-10 15:29:06,094 INFO L280 TraceCheckUtils]: 4: Hoare triple {373#true} ~x~0 := 1;~y~0 := 0; {397#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2020-07-10 15:29:06,096 INFO L280 TraceCheckUtils]: 5: Hoare triple {397#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short1 := ~y~0 < 1000; {397#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2020-07-10 15:29:06,097 INFO L280 TraceCheckUtils]: 6: Hoare triple {397#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short1;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;#t~short1 := 0 != #t~nondet0; {397#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2020-07-10 15:29:06,098 INFO L280 TraceCheckUtils]: 7: Hoare triple {397#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short1;havoc #t~nondet0;havoc #t~short1;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {378#(<= 1 main_~x~0)} is VALID [2020-07-10 15:29:06,099 INFO L280 TraceCheckUtils]: 8: Hoare triple {378#(<= 1 main_~x~0)} #t~short1 := ~y~0 < 1000; {378#(<= 1 main_~x~0)} is VALID [2020-07-10 15:29:06,100 INFO L280 TraceCheckUtils]: 9: Hoare triple {378#(<= 1 main_~x~0)} assume #t~short1;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;#t~short1 := 0 != #t~nondet0; {378#(<= 1 main_~x~0)} is VALID [2020-07-10 15:29:06,101 INFO L280 TraceCheckUtils]: 10: Hoare triple {378#(<= 1 main_~x~0)} assume !!#t~short1;havoc #t~nondet0;havoc #t~short1;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {379#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:06,102 INFO L280 TraceCheckUtils]: 11: Hoare triple {379#(<= main_~y~0 main_~x~0)} #t~short1 := ~y~0 < 1000; {379#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:06,103 INFO L280 TraceCheckUtils]: 12: Hoare triple {379#(<= main_~y~0 main_~x~0)} assume #t~short1;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;#t~short1 := 0 != #t~nondet0; {379#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:06,104 INFO L280 TraceCheckUtils]: 13: Hoare triple {379#(<= main_~y~0 main_~x~0)} assume !#t~short1;havoc #t~nondet0;havoc #t~short1; {379#(<= main_~y~0 main_~x~0)} is VALID [2020-07-10 15:29:06,106 INFO L263 TraceCheckUtils]: 14: Hoare triple {379#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {428#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:29:06,106 INFO L280 TraceCheckUtils]: 15: Hoare triple {428#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {432#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:06,107 INFO L280 TraceCheckUtils]: 16: Hoare triple {432#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {374#false} is VALID [2020-07-10 15:29:06,108 INFO L280 TraceCheckUtils]: 17: Hoare triple {374#false} assume !false; {374#false} is VALID [2020-07-10 15:29:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:06,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:06,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-10 15:29:06,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896468767] [2020-07-10 15:29:06,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-10 15:29:06,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:06,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:29:06,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:06,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:29:06,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:06,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:29:06,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:29:06,149 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 10 states. [2020-07-10 15:29:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:06,293 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2020-07-10 15:29:06,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:29:06,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-10 15:29:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:29:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2020-07-10 15:29:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:29:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2020-07-10 15:29:06,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 14 transitions. [2020-07-10 15:29:06,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:06,323 INFO L225 Difference]: With dead ends: 19 [2020-07-10 15:29:06,323 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:29:06,324 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:29:06,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:29:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:29:06,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:06,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:06,327 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:06,327 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:06,328 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:06,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:06,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:06,332 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:06,333 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:06,334 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:06,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:06,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:06,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:06,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:29:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:29:06,335 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2020-07-10 15:29:06,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:06,335 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:29:06,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:29:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:06,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:06,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:06,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:29:06,580 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:29:06,580 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:06,580 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:06,580 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:29:06,581 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:29:06,581 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:29:06,581 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:06,581 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 15:29:06,581 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:06,581 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:06,581 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 22) the Hoare annotation is: true [2020-07-10 15:29:06,581 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 22) no Hoare annotation was computed. [2020-07-10 15:29:06,582 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-10 15:29:06,582 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-10 15:29:06,582 INFO L268 CegarLoopResult]: For program point L16-3(lines 16 19) no Hoare annotation was computed. [2020-07-10 15:29:06,582 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 22) no Hoare annotation was computed. [2020-07-10 15:29:06,582 INFO L264 CegarLoopResult]: At program point L16-5(lines 16 19) the Hoare annotation is: (and (<= main_~y~0 main_~x~0) (<= 0 main_~y~0) (<= 1 main_~x~0)) [2020-07-10 15:29:06,582 INFO L264 CegarLoopResult]: At program point L16-6(lines 16 19) the Hoare annotation is: (<= main_~y~0 main_~x~0) [2020-07-10 15:29:06,582 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 15:29:06,583 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:06,583 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-10 15:29:06,583 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:29:06,583 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:06,583 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-10 15:29:06,587 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:06,588 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:29:06,589 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:06,589 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:06,589 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:06,589 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:06,589 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:06,590 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-10 15:29:06,590 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:06,590 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:06,590 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:06,590 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:29:06,590 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 15:29:06,591 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-10 15:29:06,591 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-10 15:29:06,591 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:06,591 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:06,591 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-10 15:29:06,591 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 15:29:06,591 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2020-07-10 15:29:06,591 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2020-07-10 15:29:06,592 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:06,592 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:06,592 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:29:06,592 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:29:06,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:29:06 BoogieIcfgContainer [2020-07-10 15:29:06,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:29:06,609 INFO L168 Benchmark]: Toolchain (without parser) took 4077.30 ms. Allocated memory was 137.9 MB in the beginning and 246.9 MB in the end (delta: 109.1 MB). Free memory was 102.7 MB in the beginning and 201.7 MB in the end (delta: -99.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:06,610 INFO L168 Benchmark]: CDTParser took 1.02 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:29:06,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.20 ms. Allocated memory is still 137.9 MB. Free memory was 102.5 MB in the beginning and 92.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:06,612 INFO L168 Benchmark]: Boogie Preprocessor took 41.08 ms. Allocated memory is still 137.9 MB. Free memory was 92.9 MB in the beginning and 91.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:06,613 INFO L168 Benchmark]: RCFGBuilder took 520.04 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 91.3 MB in the beginning and 165.6 MB in the end (delta: -74.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:06,614 INFO L168 Benchmark]: TraceAbstraction took 3079.53 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 165.6 MB in the beginning and 201.7 MB in the end (delta: -36.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:06,618 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 427.20 ms. Allocated memory is still 137.9 MB. Free memory was 102.5 MB in the beginning and 92.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.08 ms. Allocated memory is still 137.9 MB. Free memory was 92.9 MB in the beginning and 91.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 520.04 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 91.3 MB in the beginning and 165.6 MB in the end (delta: -74.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3079.53 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 165.6 MB in the beginning and 201.7 MB in the end (delta: -36.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: (y <= x && 0 <= y) && 1 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 52 SDtfs, 15 SDslu, 131 SDs, 0 SdLazy, 51 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 12 NumberOfFragments, 18 HoareAnnotationTreeSize, 10 FomulaSimplifications, 11 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 3014 SizeOfPredicates, 4 NumberOfNonLiveVariables, 88 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...