/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/hhk2008.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:47:31,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:47:31,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:47:31,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:47:31,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:47:31,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:47:31,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:47:31,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:47:31,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:47:31,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:47:31,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:47:31,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:47:31,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:47:31,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:47:31,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:47:31,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:47:31,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:47:31,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:47:31,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:47:31,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:47:31,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:47:31,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:47:31,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:47:31,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:47:31,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:47:31,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:47:31,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:47:31,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:47:31,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:47:31,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:47:31,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:47:31,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:47:31,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:47:31,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:47:31,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:47:31,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:47:31,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:47:31,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:47:31,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:47:31,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:47:31,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:47:31,290 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-08 12:47:31,306 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:47:31,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:47:31,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:47:31,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:47:31,308 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:47:31,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:47:31,308 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:47:31,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:47:31,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:47:31,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:47:31,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:47:31,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:47:31,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:47:31,309 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:47:31,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:47:31,310 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:47:31,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:47:31,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:47:31,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:47:31,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:47:31,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:47:31,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:47:31,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:47:31,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:47:31,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:47:31,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:47:31,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:47:31,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:47:31,312 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:47:31,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:47:31,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:47:31,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:47:31,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:47:31,625 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:47:31,626 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:47:31,626 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/hhk2008.i [2020-07-08 12:47:31,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d66cf293/6ae406ae0e274e94aae4117b8ce5f649/FLAG00f4304f6 [2020-07-08 12:47:32,250 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:47:32,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hhk2008.i [2020-07-08 12:47:32,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d66cf293/6ae406ae0e274e94aae4117b8ce5f649/FLAG00f4304f6 [2020-07-08 12:47:32,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d66cf293/6ae406ae0e274e94aae4117b8ce5f649 [2020-07-08 12:47:32,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:47:32,577 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:47:32,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:47:32,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:47:32,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:47:32,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:47:32" (1/1) ... [2020-07-08 12:47:32,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c00295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:32, skipping insertion in model container [2020-07-08 12:47:32,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:47:32" (1/1) ... [2020-07-08 12:47:32,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:47:32,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:47:32,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:47:32,820 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:47:32,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:47:32,863 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:47:32,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:32 WrapperNode [2020-07-08 12:47:32,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:47:32,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:47:32,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:47:32,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:47:32,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:32" (1/1) ... [2020-07-08 12:47:32,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:32" (1/1) ... [2020-07-08 12:47:32,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:32" (1/1) ... [2020-07-08 12:47:32,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:32" (1/1) ... [2020-07-08 12:47:32,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:32" (1/1) ... [2020-07-08 12:47:32,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:32" (1/1) ... [2020-07-08 12:47:32,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:32" (1/1) ... [2020-07-08 12:47:32,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:47:32,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:47:32,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:47:32,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:47:32,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:32" (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-08 12:47:33,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:47:33,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:47:33,063 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:47:33,063 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:47:33,063 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:47:33,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:47:33,063 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:47:33,063 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:47:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:47:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:47:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:47:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:47:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:47:33,485 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:47:33,485 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 12:47:33,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:47:33 BoogieIcfgContainer [2020-07-08 12:47:33,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:47:33,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:47:33,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:47:33,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:47:33,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:47:32" (1/3) ... [2020-07-08 12:47:33,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372a195d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:47:33, skipping insertion in model container [2020-07-08 12:47:33,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:32" (2/3) ... [2020-07-08 12:47:33,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372a195d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:47:33, skipping insertion in model container [2020-07-08 12:47:33,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:47:33" (3/3) ... [2020-07-08 12:47:33,499 INFO L109 eAbstractionObserver]: Analyzing ICFG hhk2008.i [2020-07-08 12:47:33,512 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:47:33,521 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:47:33,535 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:47:33,559 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:47:33,559 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:47:33,559 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:47:33,559 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:47:33,559 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:47:33,560 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:47:33,560 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:47:33,560 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:47:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-08 12:47:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-08 12:47:33,588 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:33,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:33,589 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:33,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:33,595 INFO L82 PathProgramCache]: Analyzing trace with hash -677001103, now seen corresponding path program 1 times [2020-07-08 12:47:33,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:33,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537726456] [2020-07-08 12:47:33,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:34,108 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-08 12:47:34,109 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #48#return; {23#true} is VALID [2020-07-08 12:47:34,113 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-08 12:47:34,114 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-08 12:47:34,116 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #48#return; {23#true} is VALID [2020-07-08 12:47:34,117 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2020-07-08 12:47:34,118 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~a~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~b~0 := #t~nondet1;havoc #t~nondet1;havoc ~res~0;havoc ~cnt~0; {23#true} is VALID [2020-07-08 12:47:34,118 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#true} assume !!(~a~0 <= 1000000); {23#true} is VALID [2020-07-08 12:47:34,122 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {27#(and (<= main_~res~0 (+ main_~a~0 main_~b~0)) (= main_~cnt~0 main_~b~0) (or (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~a~0 main_~res~0)))} is VALID [2020-07-08 12:47:34,126 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#(and (<= main_~res~0 (+ main_~a~0 main_~b~0)) (= main_~cnt~0 main_~b~0) (or (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~a~0 main_~res~0)))} assume !(~cnt~0 > 0); {28#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-08 12:47:34,130 INFO L263 TraceCheckUtils]: 8: Hoare triple {28#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {29#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:34,133 INFO L280 TraceCheckUtils]: 9: Hoare triple {29#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {30#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:34,135 INFO L280 TraceCheckUtils]: 10: Hoare triple {30#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {24#false} is VALID [2020-07-08 12:47:34,136 INFO L280 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-08 12:47:34,138 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-08 12:47:34,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537726456] [2020-07-08 12:47:34,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:34,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:47:34,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761606296] [2020-07-08 12:47:34,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-08 12:47:34,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:34,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:47:34,202 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-08 12:47:34,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:47:34,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:34,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:47:34,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:47:34,222 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 6 states. [2020-07-08 12:47:34,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:34,694 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2020-07-08 12:47:34,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:47:34,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-08 12:47:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:47:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2020-07-08 12:47:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:47:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2020-07-08 12:47:34,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2020-07-08 12:47:34,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:34,858 INFO L225 Difference]: With dead ends: 41 [2020-07-08 12:47:34,859 INFO L226 Difference]: Without dead ends: 14 [2020-07-08 12:47:34,863 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:47:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-08 12:47:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-08 12:47:34,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:34,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-08 12:47:34,920 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-08 12:47:34,920 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-08 12:47:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:34,923 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-08 12:47:34,924 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-08 12:47:34,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:34,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:34,924 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-08 12:47:34,925 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-08 12:47:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:34,927 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-08 12:47:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-08 12:47:34,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:34,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:34,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:34,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:47:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-07-08 12:47:34,932 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2020-07-08 12:47:34,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:34,932 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-07-08 12:47:34,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:47:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-08 12:47:34,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 12:47:34,933 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:34,934 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:34,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:47:34,934 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:34,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:34,935 INFO L82 PathProgramCache]: Analyzing trace with hash 523340046, now seen corresponding path program 1 times [2020-07-08 12:47:34,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:34,935 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473143934] [2020-07-08 12:47:34,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:35,137 INFO L280 TraceCheckUtils]: 0: Hoare triple {140#true} assume true; {140#true} is VALID [2020-07-08 12:47:35,138 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {140#true} {140#true} #48#return; {140#true} is VALID [2020-07-08 12:47:35,138 INFO L263 TraceCheckUtils]: 0: Hoare triple {140#true} call ULTIMATE.init(); {140#true} is VALID [2020-07-08 12:47:35,138 INFO L280 TraceCheckUtils]: 1: Hoare triple {140#true} assume true; {140#true} is VALID [2020-07-08 12:47:35,139 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {140#true} {140#true} #48#return; {140#true} is VALID [2020-07-08 12:47:35,139 INFO L263 TraceCheckUtils]: 3: Hoare triple {140#true} call #t~ret2 := main(); {140#true} is VALID [2020-07-08 12:47:35,139 INFO L280 TraceCheckUtils]: 4: Hoare triple {140#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~a~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~b~0 := #t~nondet1;havoc #t~nondet1;havoc ~res~0;havoc ~cnt~0; {140#true} is VALID [2020-07-08 12:47:35,140 INFO L280 TraceCheckUtils]: 5: Hoare triple {140#true} assume !!(~a~0 <= 1000000); {140#true} is VALID [2020-07-08 12:47:35,141 INFO L280 TraceCheckUtils]: 6: Hoare triple {140#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {144#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} is VALID [2020-07-08 12:47:35,143 INFO L280 TraceCheckUtils]: 7: Hoare triple {144#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {145#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-08 12:47:35,145 INFO L280 TraceCheckUtils]: 8: Hoare triple {145#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} assume !(~cnt~0 > 0); {146#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-08 12:47:35,147 INFO L263 TraceCheckUtils]: 9: Hoare triple {146#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {147#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:35,148 INFO L280 TraceCheckUtils]: 10: Hoare triple {147#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {148#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:35,149 INFO L280 TraceCheckUtils]: 11: Hoare triple {148#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {141#false} is VALID [2020-07-08 12:47:35,149 INFO L280 TraceCheckUtils]: 12: Hoare triple {141#false} assume !false; {141#false} is VALID [2020-07-08 12:47:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:35,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473143934] [2020-07-08 12:47:35,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200671350] [2020-07-08 12:47:35,152 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-08 12:47:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:35,193 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-08 12:47:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:35,215 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:35,511 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:47:35,560 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:47:35,587 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:47:35,654 INFO L263 TraceCheckUtils]: 0: Hoare triple {140#true} call ULTIMATE.init(); {140#true} is VALID [2020-07-08 12:47:35,655 INFO L280 TraceCheckUtils]: 1: Hoare triple {140#true} assume true; {140#true} is VALID [2020-07-08 12:47:35,655 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {140#true} {140#true} #48#return; {140#true} is VALID [2020-07-08 12:47:35,656 INFO L263 TraceCheckUtils]: 3: Hoare triple {140#true} call #t~ret2 := main(); {140#true} is VALID [2020-07-08 12:47:35,656 INFO L280 TraceCheckUtils]: 4: Hoare triple {140#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~a~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~b~0 := #t~nondet1;havoc #t~nondet1;havoc ~res~0;havoc ~cnt~0; {140#true} is VALID [2020-07-08 12:47:35,656 INFO L280 TraceCheckUtils]: 5: Hoare triple {140#true} assume !!(~a~0 <= 1000000); {140#true} is VALID [2020-07-08 12:47:35,657 INFO L280 TraceCheckUtils]: 6: Hoare triple {140#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {144#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} is VALID [2020-07-08 12:47:35,659 INFO L280 TraceCheckUtils]: 7: Hoare triple {144#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {173#(and (<= (+ main_~a~0 1) main_~res~0) (<= main_~b~0 (+ main_~cnt~0 1)) (<= main_~res~0 (+ main_~a~0 1)) (< 0 main_~b~0))} is VALID [2020-07-08 12:47:35,661 INFO L280 TraceCheckUtils]: 8: Hoare triple {173#(and (<= (+ main_~a~0 1) main_~res~0) (<= main_~b~0 (+ main_~cnt~0 1)) (<= main_~res~0 (+ main_~a~0 1)) (< 0 main_~b~0))} assume !(~cnt~0 > 0); {177#(and (<= (+ main_~a~0 1) main_~res~0) (<= main_~b~0 1) (<= main_~res~0 (+ main_~a~0 1)) (< 0 main_~b~0))} is VALID [2020-07-08 12:47:35,665 INFO L263 TraceCheckUtils]: 9: Hoare triple {177#(and (<= (+ main_~a~0 1) main_~res~0) (<= main_~b~0 1) (<= main_~res~0 (+ main_~a~0 1)) (< 0 main_~b~0))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {181#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:47:35,666 INFO L280 TraceCheckUtils]: 10: Hoare triple {181#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {185#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:47:35,667 INFO L280 TraceCheckUtils]: 11: Hoare triple {185#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {141#false} is VALID [2020-07-08 12:47:35,667 INFO L280 TraceCheckUtils]: 12: Hoare triple {141#false} assume !false; {141#false} is VALID [2020-07-08 12:47:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:35,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:35,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-07-08 12:47:35,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281938028] [2020-07-08 12:47:35,673 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2020-07-08 12:47:35,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:35,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:47:35,705 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-08 12:47:35,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:47:35,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:35,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:47:35,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:47:35,707 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2020-07-08 12:47:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:35,960 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-08 12:47:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:47:35,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2020-07-08 12:47:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:47:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2020-07-08 12:47:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:47:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2020-07-08 12:47:35,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 20 transitions. [2020-07-08 12:47:35,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:36,000 INFO L225 Difference]: With dead ends: 20 [2020-07-08 12:47:36,000 INFO L226 Difference]: Without dead ends: 15 [2020-07-08 12:47:36,002 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:47:36,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-08 12:47:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-08 12:47:36,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:36,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-08 12:47:36,016 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-08 12:47:36,016 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-08 12:47:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:36,018 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-08 12:47:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-08 12:47:36,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:36,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:36,019 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-08 12:47:36,020 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-08 12:47:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:36,022 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-08 12:47:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-08 12:47:36,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:36,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:36,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:36,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 12:47:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2020-07-08 12:47:36,025 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2020-07-08 12:47:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:36,026 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-07-08 12:47:36,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:47:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-08 12:47:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:47:36,027 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:36,027 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:36,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-08 12:47:36,243 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:36,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:36,245 INFO L82 PathProgramCache]: Analyzing trace with hash -920789999, now seen corresponding path program 2 times [2020-07-08 12:47:36,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:36,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530224996] [2020-07-08 12:47:36,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:36,507 INFO L280 TraceCheckUtils]: 0: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-08 12:47:36,507 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {282#true} {282#true} #48#return; {282#true} is VALID [2020-07-08 12:47:36,508 INFO L263 TraceCheckUtils]: 0: Hoare triple {282#true} call ULTIMATE.init(); {282#true} is VALID [2020-07-08 12:47:36,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-08 12:47:36,509 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {282#true} #48#return; {282#true} is VALID [2020-07-08 12:47:36,509 INFO L263 TraceCheckUtils]: 3: Hoare triple {282#true} call #t~ret2 := main(); {282#true} is VALID [2020-07-08 12:47:36,509 INFO L280 TraceCheckUtils]: 4: Hoare triple {282#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~a~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~b~0 := #t~nondet1;havoc #t~nondet1;havoc ~res~0;havoc ~cnt~0; {282#true} is VALID [2020-07-08 12:47:36,510 INFO L280 TraceCheckUtils]: 5: Hoare triple {282#true} assume !!(~a~0 <= 1000000); {282#true} is VALID [2020-07-08 12:47:36,511 INFO L280 TraceCheckUtils]: 6: Hoare triple {282#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {286#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} is VALID [2020-07-08 12:47:36,512 INFO L280 TraceCheckUtils]: 7: Hoare triple {286#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {287#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-08 12:47:36,515 INFO L280 TraceCheckUtils]: 8: Hoare triple {287#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {288#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-08 12:47:36,517 INFO L280 TraceCheckUtils]: 9: Hoare triple {288#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} assume !(~cnt~0 > 0); {289#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-08 12:47:36,519 INFO L263 TraceCheckUtils]: 10: Hoare triple {289#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {290#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:36,520 INFO L280 TraceCheckUtils]: 11: Hoare triple {290#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {291#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:36,520 INFO L280 TraceCheckUtils]: 12: Hoare triple {291#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {283#false} is VALID [2020-07-08 12:47:36,521 INFO L280 TraceCheckUtils]: 13: Hoare triple {283#false} assume !false; {283#false} is VALID [2020-07-08 12:47:36,522 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-08 12:47:36,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530224996] [2020-07-08 12:47:36,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727342765] [2020-07-08 12:47:36,522 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-08 12:47:36,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:47:36,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:47:36,564 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-08 12:47:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:36,579 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:36,816 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:47:36,863 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:47:36,903 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:47:36,964 INFO L263 TraceCheckUtils]: 0: Hoare triple {282#true} call ULTIMATE.init(); {282#true} is VALID [2020-07-08 12:47:36,964 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-08 12:47:36,964 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {282#true} #48#return; {282#true} is VALID [2020-07-08 12:47:36,965 INFO L263 TraceCheckUtils]: 3: Hoare triple {282#true} call #t~ret2 := main(); {282#true} is VALID [2020-07-08 12:47:36,965 INFO L280 TraceCheckUtils]: 4: Hoare triple {282#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~a~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~b~0 := #t~nondet1;havoc #t~nondet1;havoc ~res~0;havoc ~cnt~0; {282#true} is VALID [2020-07-08 12:47:36,965 INFO L280 TraceCheckUtils]: 5: Hoare triple {282#true} assume !!(~a~0 <= 1000000); {282#true} is VALID [2020-07-08 12:47:36,967 INFO L280 TraceCheckUtils]: 6: Hoare triple {282#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {286#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} is VALID [2020-07-08 12:47:36,969 INFO L280 TraceCheckUtils]: 7: Hoare triple {286#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {316#(and (<= (+ main_~a~0 1) main_~res~0) (= (+ main_~cnt~0 1) main_~b~0) (<= main_~res~0 (+ main_~a~0 1)))} is VALID [2020-07-08 12:47:36,972 INFO L280 TraceCheckUtils]: 8: Hoare triple {316#(and (<= (+ main_~a~0 1) main_~res~0) (= (+ main_~cnt~0 1) main_~b~0) (<= main_~res~0 (+ main_~a~0 1)))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {320#(and (<= main_~b~0 (+ main_~cnt~0 2)) (< 1 main_~b~0) (<= (+ main_~a~0 2) main_~res~0) (<= main_~res~0 (+ main_~a~0 2)))} is VALID [2020-07-08 12:47:36,974 INFO L280 TraceCheckUtils]: 9: Hoare triple {320#(and (<= main_~b~0 (+ main_~cnt~0 2)) (< 1 main_~b~0) (<= (+ main_~a~0 2) main_~res~0) (<= main_~res~0 (+ main_~a~0 2)))} assume !(~cnt~0 > 0); {324#(and (< 1 main_~b~0) (<= (+ main_~a~0 2) main_~res~0) (<= main_~res~0 (+ main_~a~0 2)) (<= main_~b~0 2))} is VALID [2020-07-08 12:47:36,979 INFO L263 TraceCheckUtils]: 10: Hoare triple {324#(and (< 1 main_~b~0) (<= (+ main_~a~0 2) main_~res~0) (<= main_~res~0 (+ main_~a~0 2)) (<= main_~b~0 2))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {328#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:47:36,980 INFO L280 TraceCheckUtils]: 11: Hoare triple {328#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {332#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:47:36,981 INFO L280 TraceCheckUtils]: 12: Hoare triple {332#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {283#false} is VALID [2020-07-08 12:47:36,981 INFO L280 TraceCheckUtils]: 13: Hoare triple {283#false} assume !false; {283#false} is VALID [2020-07-08 12:47:36,982 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-08 12:47:36,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:36,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-08 12:47:36,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790616136] [2020-07-08 12:47:36,983 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2020-07-08 12:47:36,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:36,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 12:47:37,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:37,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 12:47:37,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:37,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 12:47:37,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:47:37,011 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2020-07-08 12:47:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:37,457 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-08 12:47:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:47:37,457 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2020-07-08 12:47:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 12:47:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2020-07-08 12:47:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 12:47:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2020-07-08 12:47:37,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 18 transitions. [2020-07-08 12:47:37,489 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-08 12:47:37,490 INFO L225 Difference]: With dead ends: 17 [2020-07-08 12:47:37,490 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:47:37,491 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2020-07-08 12:47:37,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:47:37,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:47:37,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:37,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:37,492 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:37,492 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:37,492 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:47:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:47:37,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:37,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:37,493 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:37,493 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:37,494 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:47:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:47:37,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:37,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:37,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:37,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:47:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:47:37,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2020-07-08 12:47:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:37,495 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:47:37,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 12:47:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:47:37,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:37,706 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:37,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:47:37,881 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:47:37,881 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:47:37,881 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:47:37,882 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:47:37,882 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:47:37,882 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:47:37,882 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:47:37,882 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 12:47:37,882 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:47:37,882 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:47:37,883 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 27) the Hoare annotation is: true [2020-07-08 12:47:37,883 INFO L268 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2020-07-08 12:47:37,883 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 27) no Hoare annotation was computed. [2020-07-08 12:47:37,883 INFO L264 CegarLoopResult]: At program point L21-2(lines 21 24) the Hoare annotation is: (let ((.cse1 (+ main_~res~0 main_~cnt~0)) (.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (<= main_~res~0 .cse0) (<= .cse1 .cse0))) [2020-07-08 12:47:37,883 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-08 12:47:37,884 INFO L264 CegarLoopResult]: At program point L21-3(lines 21 24) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0))) (let ((.cse3 (<= .cse1 main_~res~0)) (.cse4 (<= main_~res~0 .cse1))) (or (let ((.cse0 (+ main_~a~0 1))) (and (<= .cse0 main_~res~0) (<= main_~b~0 1) (<= main_~b~0 (+ main_~cnt~0 1)) (<= main_~res~0 .cse0) (< 0 main_~b~0))) (let ((.cse2 (+ main_~res~0 main_~cnt~0))) (and (<= .cse1 .cse2) .cse3 .cse4 (<= .cse2 .cse1))) (and .cse3 .cse4 (= main_~cnt~0 main_~b~0))))) [2020-07-08 12:47:37,884 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-08 12:47:37,884 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 27) no Hoare annotation was computed. [2020-07-08 12:47:37,884 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 12:47:37,884 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-08 12:47:37,884 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-08 12:47:37,885 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-08 12:47:37,885 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-08 12:47:37,885 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-08 12:47:37,890 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:47:37,890 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:47:37,891 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 12:47:37,891 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:47:37,891 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:47:37,891 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:47:37,891 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:47:37,891 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:47:37,891 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 12:47:37,892 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 12:47:37,892 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:47:37,892 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:47:37,892 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:47:37,892 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 12:47:37,892 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:47:37,893 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 12:47:37,893 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 12:47:37,893 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:47:37,893 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:47:37,893 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-08 12:47:37,894 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:47:37,897 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:47:37,897 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-08 12:47:37,897 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-08 12:47:37,898 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:47:37,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:47:37 BoogieIcfgContainer [2020-07-08 12:47:37,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:47:37,913 INFO L168 Benchmark]: Toolchain (without parser) took 5335.50 ms. Allocated memory was 137.9 MB in the beginning and 249.6 MB in the end (delta: 111.7 MB). Free memory was 103.0 MB in the beginning and 183.0 MB in the end (delta: -80.0 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:37,914 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:47:37,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.40 ms. Allocated memory is still 137.9 MB. Free memory was 102.8 MB in the beginning and 92.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:37,916 INFO L168 Benchmark]: Boogie Preprocessor took 126.95 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 92.9 MB in the beginning and 181.0 MB in the end (delta: -88.1 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:37,917 INFO L168 Benchmark]: RCFGBuilder took 498.79 ms. Allocated memory is still 201.9 MB. Free memory was 181.0 MB in the beginning and 164.6 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:37,918 INFO L168 Benchmark]: TraceAbstraction took 4417.86 ms. Allocated memory was 201.9 MB in the beginning and 249.6 MB in the end (delta: 47.7 MB). Free memory was 163.9 MB in the beginning and 183.0 MB in the end (delta: -19.1 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:37,929 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 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 285.40 ms. Allocated memory is still 137.9 MB. Free memory was 102.8 MB in the beginning and 92.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.95 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 92.9 MB in the beginning and 181.0 MB in the end (delta: -88.1 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 498.79 ms. Allocated memory is still 201.9 MB. Free memory was 181.0 MB in the beginning and 164.6 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4417.86 ms. Allocated memory was 201.9 MB in the beginning and 249.6 MB in the end (delta: 47.7 MB). Free memory was 163.9 MB in the beginning and 183.0 MB in the end (delta: -19.1 MB). Peak memory consumption was 28.6 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: 21]: Loop Invariant Derived loop invariant: (a + b <= res + cnt && res <= a + b) && res + cnt <= a + b - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.1s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 38 SDtfs, 22 SDslu, 134 SDs, 0 SdLazy, 103 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.0s 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 18 NumberOfFragments, 87 HoareAnnotationTreeSize, 11 FomulaSimplifications, 9 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 90 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 3737 SizeOfPredicates, 6 NumberOfNonLiveVariables, 85 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/8 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...