/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:33:28,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:33:28,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:33:28,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:33:28,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:33:28,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:33:28,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:33:28,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:33:28,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:33:28,658 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:33:28,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:33:28,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:33:28,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:33:28,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:33:28,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:33:28,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:33:28,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:33:28,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:33:28,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:33:28,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:33:28,671 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:33:28,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:33:28,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:33:28,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:33:28,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:33:28,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:33:28,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:33:28,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:33:28,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:33:28,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:33:28,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:33:28,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:33:28,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:33:28,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:33:28,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:33:28,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:33:28,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:33:28,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:33:28,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:33:28,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:33:28,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:33:28,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:33:28,685 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:33:28,692 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:33:28,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:33:28,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:33:28,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:33:28,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:33:28,693 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:33:28,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:33:28,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:33:28,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:33:28,694 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:33:28,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:33:28,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:33:28,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:33:28,695 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:33:28,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:33:28,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:33:28,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:33:28,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:33:28,695 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:33:28,695 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:33:28,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:33:28,695 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:33:28,695 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:33:28,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:33:28,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:33:28,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:33:28,890 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:33:28,896 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:33:28,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005_variant.i [2022-04-08 09:33:28,961 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02a33c61/a3e74680f94a45aabac077c99a164ce4/FLAG185a06647 [2022-04-08 09:33:29,293 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:33:29,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005_variant.i [2022-04-08 09:33:29,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02a33c61/a3e74680f94a45aabac077c99a164ce4/FLAG185a06647 [2022-04-08 09:33:29,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02a33c61/a3e74680f94a45aabac077c99a164ce4 [2022-04-08 09:33:29,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:33:29,311 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:33:29,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:33:29,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:33:29,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:33:29,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:33:29" (1/1) ... [2022-04-08 09:33:29,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2023cf19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:29, skipping insertion in model container [2022-04-08 09:33:29,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:33:29" (1/1) ... [2022-04-08 09:33:29,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:33:29,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:33:29,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005_variant.i[895,908] [2022-04-08 09:33:29,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:33:29,478 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:33:29,486 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005_variant.i[895,908] [2022-04-08 09:33:29,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:33:29,495 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:33:29,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:29 WrapperNode [2022-04-08 09:33:29,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:33:29,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:33:29,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:33:29,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:33:29,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:29" (1/1) ... [2022-04-08 09:33:29,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:29" (1/1) ... [2022-04-08 09:33:29,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:29" (1/1) ... [2022-04-08 09:33:29,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:29" (1/1) ... [2022-04-08 09:33:29,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:29" (1/1) ... [2022-04-08 09:33:29,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:29" (1/1) ... [2022-04-08 09:33:29,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:29" (1/1) ... [2022-04-08 09:33:29,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:33:29,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:33:29,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:33:29,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:33:29,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:29" (1/1) ... [2022-04-08 09:33:29,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:33:29,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:33:29,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:33:29,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:33:29,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:33:29,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:33:29,600 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:33:29,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:33:29,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:33:29,600 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:33:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:33:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:33:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:33:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:33:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:33:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:33:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:33:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:33:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:33:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:33:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:33:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:33:29,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:33:29,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:33:29,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:33:29,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:33:29,642 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:33:29,643 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:33:29,743 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:33:29,748 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:33:29,748 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:33:29,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:33:29 BoogieIcfgContainer [2022-04-08 09:33:29,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:33:29,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:33:29,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:33:29,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:33:29,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:33:29" (1/3) ... [2022-04-08 09:33:29,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4cbeda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:33:29, skipping insertion in model container [2022-04-08 09:33:29,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:33:29" (2/3) ... [2022-04-08 09:33:29,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4cbeda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:33:29, skipping insertion in model container [2022-04-08 09:33:29,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:33:29" (3/3) ... [2022-04-08 09:33:29,759 INFO L111 eAbstractionObserver]: Analyzing ICFG cggmp2005_variant.i [2022-04-08 09:33:29,778 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:33:29,778 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:33:29,833 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:33:29,841 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:33:29,841 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:33:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:33:29,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 09:33:29,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:33:29,870 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:33:29,870 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:33:29,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:33:29,879 INFO L85 PathProgramCache]: Analyzing trace with hash 253912119, now seen corresponding path program 1 times [2022-04-08 09:33:29,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:29,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1696869176] [2022-04-08 09:33:29,893 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:33:29,894 INFO L85 PathProgramCache]: Analyzing trace with hash 253912119, now seen corresponding path program 2 times [2022-04-08 09:33:29,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:33:29,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079036721] [2022-04-08 09:33:29,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:33:29,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:33:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:30,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:33:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:30,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23#true} is VALID [2022-04-08 09:33:30,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:33:30,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-08 09:33:30,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:33:30,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {23#true} is VALID [2022-04-08 09:33:30,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:33:30,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-08 09:33:30,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2022-04-08 09:33:30,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {23#true} is VALID [2022-04-08 09:33:30,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {28#(not (<= main_~mid~0 0))} is VALID [2022-04-08 09:33:30,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(not (<= main_~mid~0 0))} assume !(~mid~0 > 0); {24#false} is VALID [2022-04-08 09:33:30,082 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {24#false} is VALID [2022-04-08 09:33:30,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-08 09:33:30,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-08 09:33:30,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-08 09:33:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:30,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:33:30,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079036721] [2022-04-08 09:33:30,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079036721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:33:30,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:33:30,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:33:30,088 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:33:30,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1696869176] [2022-04-08 09:33:30,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1696869176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:33:30,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:33:30,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:33:30,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943700837] [2022-04-08 09:33:30,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:33:30,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:33:30,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:33:30,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:30,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:30,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:33:30,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:30,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:33:30,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:33:30,135 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:30,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:30,263 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-08 09:33:30,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:33:30,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 09:33:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:33:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-08 09:33:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-08 09:33:30,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2022-04-08 09:33:30,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:30,324 INFO L225 Difference]: With dead ends: 33 [2022-04-08 09:33:30,324 INFO L226 Difference]: Without dead ends: 14 [2022-04-08 09:33:30,326 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:33:30,328 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:33:30,330 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:33:30,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-08 09:33:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-08 09:33:30,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:33:30,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:30,356 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:30,356 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:30,358 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-08 09:33:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 09:33:30,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:30,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:30,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-08 09:33:30,360 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-08 09:33:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:30,364 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-08 09:33:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 09:33:30,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:30,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:30,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:33:30,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:33:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-08 09:33:30,368 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-08 09:33:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:33:30,369 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-08 09:33:30,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:30,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-08 09:33:30,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-08 09:33:30,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 09:33:30,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:33:30,391 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:33:30,392 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:33:30,392 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:33:30,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:33:30,393 INFO L85 PathProgramCache]: Analyzing trace with hash -684163825, now seen corresponding path program 1 times [2022-04-08 09:33:30,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:30,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [206583942] [2022-04-08 09:33:30,410 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:33:30,410 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:33:30,410 INFO L85 PathProgramCache]: Analyzing trace with hash -684163825, now seen corresponding path program 2 times [2022-04-08 09:33:30,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:33:30,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112536146] [2022-04-08 09:33:30,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:33:30,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:33:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:30,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:33:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:30,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {156#true} is VALID [2022-04-08 09:33:30,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-08 09:33:30,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #54#return; {156#true} is VALID [2022-04-08 09:33:30,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:33:30,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {156#true} is VALID [2022-04-08 09:33:30,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-08 09:33:30,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #54#return; {156#true} is VALID [2022-04-08 09:33:30,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret2 := main(); {156#true} is VALID [2022-04-08 09:33:30,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {161#(= main_~lo~0 0)} is VALID [2022-04-08 09:33:30,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#(= main_~lo~0 0)} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {162#(and (= main_~lo~0 0) (<= 2 main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} is VALID [2022-04-08 09:33:30,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {162#(and (= main_~lo~0 0) (<= 2 main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {163#(and (or (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (< main_~hi~0 (+ main_~lo~0 1))) (<= main_~lo~0 main_~hi~0))} is VALID [2022-04-08 09:33:30,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#(and (or (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (< main_~hi~0 (+ main_~lo~0 1))) (<= main_~lo~0 main_~hi~0))} assume !(~mid~0 > 0); {164#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} is VALID [2022-04-08 09:33:30,602 INFO L272 TraceCheckUtils]: 9: Hoare triple {164#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {165#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:33:30,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {165#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {166#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:33:30,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {157#false} is VALID [2022-04-08 09:33:30,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-08 09:33:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:30,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:33:30,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112536146] [2022-04-08 09:33:30,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112536146] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:33:30,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032421764] [2022-04-08 09:33:30,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:33:30,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:33:30,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:33:30,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:33:30,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 09:33:30,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:33:30,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:33:30,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 09:33:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:30,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:33:31,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {156#true} is VALID [2022-04-08 09:33:31,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {156#true} is VALID [2022-04-08 09:33:31,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-08 09:33:31,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #54#return; {156#true} is VALID [2022-04-08 09:33:31,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret2 := main(); {156#true} is VALID [2022-04-08 09:33:31,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {161#(= main_~lo~0 0)} is VALID [2022-04-08 09:33:31,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#(= main_~lo~0 0)} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {189#(and (= main_~lo~0 0) (< 0 main_~mid~0) (= main_~hi~0 (* main_~mid~0 2)))} is VALID [2022-04-08 09:33:31,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {189#(and (= main_~lo~0 0) (< 0 main_~mid~0) (= main_~hi~0 (* main_~mid~0 2)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {193#(and (< 0 (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2))) (= (mod (+ main_~hi~0 1) 2) 0) (= (+ (- 1) main_~lo~0) 0) (<= (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2)) (+ main_~mid~0 1)))} is VALID [2022-04-08 09:33:31,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#(and (< 0 (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2))) (= (mod (+ main_~hi~0 1) 2) 0) (= (+ (- 1) main_~lo~0) 0) (<= (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2)) (+ main_~mid~0 1)))} assume !(~mid~0 > 0); {197#(and (< 0 (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2))) (= (mod (+ main_~hi~0 1) 2) 0) (<= (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2)) 1) (= (+ (- 1) main_~lo~0) 0))} is VALID [2022-04-08 09:33:31,415 INFO L272 TraceCheckUtils]: 9: Hoare triple {197#(and (< 0 (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2))) (= (mod (+ main_~hi~0 1) 2) 0) (<= (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2)) 1) (= (+ (- 1) main_~lo~0) 0))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:33:31,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:33:31,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {157#false} is VALID [2022-04-08 09:33:31,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-08 09:33:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:31,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:33:31,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-08 09:33:31,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {157#false} is VALID [2022-04-08 09:33:31,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:33:31,628 INFO L272 TraceCheckUtils]: 9: Hoare triple {164#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:33:31,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#(or (< 0 main_~mid~0) (and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1))))} assume !(~mid~0 > 0); {164#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} is VALID [2022-04-08 09:33:31,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {228#(or (< 1 main_~mid~0) (and (< main_~hi~0 (+ 3 main_~lo~0)) (<= (+ 2 main_~lo~0) main_~hi~0)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {224#(or (< 0 main_~mid~0) (and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1))))} is VALID [2022-04-08 09:33:31,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#(= main_~lo~0 0)} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {228#(or (< 1 main_~mid~0) (and (< main_~hi~0 (+ 3 main_~lo~0)) (<= (+ 2 main_~lo~0) main_~hi~0)))} is VALID [2022-04-08 09:33:31,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {161#(= main_~lo~0 0)} is VALID [2022-04-08 09:33:31,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret2 := main(); {156#true} is VALID [2022-04-08 09:33:31,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #54#return; {156#true} is VALID [2022-04-08 09:33:31,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-08 09:33:31,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {156#true} is VALID [2022-04-08 09:33:31,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {156#true} is VALID [2022-04-08 09:33:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:31,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032421764] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:33:31,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:33:31,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-08 09:33:31,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:33:31,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [206583942] [2022-04-08 09:33:31,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [206583942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:33:31,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:33:31,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:33:31,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107874384] [2022-04-08 09:33:31,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:33:31,637 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:33:31,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:33:31,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:31,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:31,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:33:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:31,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:33:31,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:33:31,648 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:31,814 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 09:33:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:33:31,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:33:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:33:31,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-08 09:33:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-08 09:33:31,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 20 transitions. [2022-04-08 09:33:31,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:31,833 INFO L225 Difference]: With dead ends: 20 [2022-04-08 09:33:31,833 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 09:33:31,833 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:33:31,834 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:33:31,834 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:33:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 09:33:31,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 09:33:31,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:33:31,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:31,841 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:31,841 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:31,842 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:33:31,842 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:33:31,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:31,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:31,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 09:33:31,843 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 09:33:31,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:31,844 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:33:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:33:31,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:31,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:31,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:33:31,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:33:31,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-08 09:33:31,845 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-08 09:33:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:33:31,845 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-08 09:33:31,845 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:31,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-08 09:33:31,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 09:33:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:33:31,860 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:33:31,860 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:33:31,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 09:33:32,081 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:33:32,081 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:33:32,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:33:32,082 INFO L85 PathProgramCache]: Analyzing trace with hash 300252983, now seen corresponding path program 3 times [2022-04-08 09:33:32,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:32,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [748525647] [2022-04-08 09:33:32,086 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:33:32,086 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:33:32,086 INFO L85 PathProgramCache]: Analyzing trace with hash 300252983, now seen corresponding path program 4 times [2022-04-08 09:33:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:33:32,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083825021] [2022-04-08 09:33:32,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:33:32,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:33:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:32,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:33:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:32,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {364#true} is VALID [2022-04-08 09:33:32,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {364#true} assume true; {364#true} is VALID [2022-04-08 09:33:32,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {364#true} {364#true} #54#return; {364#true} is VALID [2022-04-08 09:33:32,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {364#true} call ULTIMATE.init(); {376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:33:32,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {364#true} is VALID [2022-04-08 09:33:32,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {364#true} assume true; {364#true} is VALID [2022-04-08 09:33:32,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {364#true} {364#true} #54#return; {364#true} is VALID [2022-04-08 09:33:32,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {364#true} call #t~ret2 := main(); {364#true} is VALID [2022-04-08 09:33:32,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {364#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {369#(= main_~lo~0 0)} is VALID [2022-04-08 09:33:32,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {369#(= main_~lo~0 0)} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {370#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} is VALID [2022-04-08 09:33:32,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {370#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {371#(and (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (<= (+ main_~lo~0 (* main_~mid~0 2)) main_~hi~0))} is VALID [2022-04-08 09:33:32,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#(and (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (<= (+ main_~lo~0 (* main_~mid~0 2)) main_~hi~0))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {372#(and (or (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (< main_~hi~0 (+ main_~lo~0 1))) (<= main_~lo~0 main_~hi~0))} is VALID [2022-04-08 09:33:32,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {372#(and (or (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (< main_~hi~0 (+ main_~lo~0 1))) (<= main_~lo~0 main_~hi~0))} assume !(~mid~0 > 0); {373#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} is VALID [2022-04-08 09:33:32,246 INFO L272 TraceCheckUtils]: 10: Hoare triple {373#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {374#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:33:32,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {374#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {375#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:33:32,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {375#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {365#false} is VALID [2022-04-08 09:33:32,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#false} assume !false; {365#false} is VALID [2022-04-08 09:33:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:32,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:33:32,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083825021] [2022-04-08 09:33:32,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083825021] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:33:32,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405899040] [2022-04-08 09:33:32,248 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:33:32,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:33:32,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:33:32,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:33:32,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 09:33:32,295 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:33:32,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:33:32,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 09:33:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:33:32,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:33:32,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {364#true} call ULTIMATE.init(); {364#true} is VALID [2022-04-08 09:33:32,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {364#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {364#true} is VALID [2022-04-08 09:33:32,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {364#true} assume true; {364#true} is VALID [2022-04-08 09:33:32,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {364#true} {364#true} #54#return; {364#true} is VALID [2022-04-08 09:33:32,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {364#true} call #t~ret2 := main(); {364#true} is VALID [2022-04-08 09:33:32,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {364#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {369#(= main_~lo~0 0)} is VALID [2022-04-08 09:33:32,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {369#(= main_~lo~0 0)} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {370#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} is VALID [2022-04-08 09:33:32,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {370#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {401#(and (= (+ (- 1) main_~lo~0) 0) (<= (+ (* main_~mid~0 2) 1) main_~hi~0) (<= main_~hi~0 (+ (* main_~mid~0 2) 1)))} is VALID [2022-04-08 09:33:32,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {401#(and (= (+ (- 1) main_~lo~0) 0) (<= (+ (* main_~mid~0 2) 1) main_~hi~0) (<= main_~hi~0 (+ (* main_~mid~0 2) 1)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {405#(and (< 0 (div main_~hi~0 2)) (<= (div (* (- 1) main_~hi~0) (- 2)) (+ main_~mid~0 1)) (= 2 main_~lo~0) (<= (div (* (- 1) main_~hi~0) (- 2)) (div main_~hi~0 2)))} is VALID [2022-04-08 09:33:32,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {405#(and (< 0 (div main_~hi~0 2)) (<= (div (* (- 1) main_~hi~0) (- 2)) (+ main_~mid~0 1)) (= 2 main_~lo~0) (<= (div (* (- 1) main_~hi~0) (- 2)) (div main_~hi~0 2)))} assume !(~mid~0 > 0); {409#(and (< 0 (div main_~hi~0 2)) (= 2 main_~lo~0) (<= (div (* (- 1) main_~hi~0) (- 2)) 1))} is VALID [2022-04-08 09:33:32,949 INFO L272 TraceCheckUtils]: 10: Hoare triple {409#(and (< 0 (div main_~hi~0 2)) (= 2 main_~lo~0) (<= (div (* (- 1) main_~hi~0) (- 2)) 1))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {413#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:33:32,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {413#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {417#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:33:32,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {417#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {365#false} is VALID [2022-04-08 09:33:32,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#false} assume !false; {365#false} is VALID [2022-04-08 09:33:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:32,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:33:33,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#false} assume !false; {365#false} is VALID [2022-04-08 09:33:33,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {417#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {365#false} is VALID [2022-04-08 09:33:33,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {413#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {417#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:33:33,166 INFO L272 TraceCheckUtils]: 10: Hoare triple {373#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {413#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:33:33,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#(or (< 0 main_~mid~0) (and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1))))} assume !(~mid~0 > 0); {373#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} is VALID [2022-04-08 09:33:33,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {440#(or (< 1 main_~mid~0) (and (< main_~hi~0 (+ 3 main_~lo~0)) (<= (+ 2 main_~lo~0) main_~hi~0)) (not (< 0 main_~mid~0)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {436#(or (< 0 main_~mid~0) (and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1))))} is VALID [2022-04-08 09:33:33,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {444#(or (not (< 1 main_~mid~0)) (< 2 main_~mid~0) (and (< main_~hi~0 (+ 5 main_~lo~0)) (<= (+ main_~lo~0 4) main_~hi~0)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {440#(or (< 1 main_~mid~0) (and (< main_~hi~0 (+ 3 main_~lo~0)) (<= (+ 2 main_~lo~0) main_~hi~0)) (not (< 0 main_~mid~0)))} is VALID [2022-04-08 09:33:33,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {369#(= main_~lo~0 0)} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {444#(or (not (< 1 main_~mid~0)) (< 2 main_~mid~0) (and (< main_~hi~0 (+ 5 main_~lo~0)) (<= (+ main_~lo~0 4) main_~hi~0)))} is VALID [2022-04-08 09:33:33,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {364#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~mid~0 := #t~nondet1;havoc #t~nondet1; {369#(= main_~lo~0 0)} is VALID [2022-04-08 09:33:33,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {364#true} call #t~ret2 := main(); {364#true} is VALID [2022-04-08 09:33:33,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {364#true} {364#true} #54#return; {364#true} is VALID [2022-04-08 09:33:33,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {364#true} assume true; {364#true} is VALID [2022-04-08 09:33:33,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {364#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {364#true} is VALID [2022-04-08 09:33:33,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {364#true} call ULTIMATE.init(); {364#true} is VALID [2022-04-08 09:33:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:33:33,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405899040] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:33:33,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:33:33,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-08 09:33:33,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:33:33,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [748525647] [2022-04-08 09:33:33,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [748525647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:33:33,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:33:33,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:33:33,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526892492] [2022-04-08 09:33:33,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:33:33,171 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:33:33,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:33:33,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:33,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:33,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:33:33,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:33:33,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:33:33,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:33:33,182 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:33,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:33,345 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 09:33:33,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:33:33,345 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:33:33,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:33:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2022-04-08 09:33:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:33,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2022-04-08 09:33:33,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 14 transitions. [2022-04-08 09:33:33,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:33,358 INFO L225 Difference]: With dead ends: 15 [2022-04-08 09:33:33,359 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:33:33,359 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2022-04-08 09:33:33,360 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:33:33,360 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 35 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:33:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:33:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:33:33,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:33:33,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:33:33,361 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:33:33,361 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:33:33,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:33,361 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:33:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:33:33,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:33,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:33,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:33:33,361 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:33:33,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:33:33,361 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:33:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:33:33,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:33,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:33:33,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:33:33,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:33:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:33:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:33:33,362 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-08 09:33:33,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:33:33,362 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:33:33,362 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:33:33,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:33:33,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:33:33,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:33:33,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:33:33,364 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:33:33,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 09:33:33,580 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 09:33:33,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:33:33,641 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 09:33:33,641 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 09:33:33,641 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 09:33:33,641 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 09:33:33,641 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:33:33,641 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:33:33,641 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:33:33,641 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 37) the Hoare annotation is: true [2022-04-08 09:33:33,641 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (= main_~lo~0 0) [2022-04-08 09:33:33,641 INFO L878 garLoopResultBuilder]: At program point L30-2(lines 30 34) the Hoare annotation is: (let ((.cse0 (+ main_~lo~0 (* main_~mid~0 2)))) (and (<= main_~hi~0 .cse0) (<= main_~lo~0 main_~hi~0) (<= .cse0 main_~hi~0))) [2022-04-08 09:33:33,642 INFO L878 garLoopResultBuilder]: At program point L30-3(lines 30 34) the Hoare annotation is: (and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1))) [2022-04-08 09:33:33,642 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 37) the Hoare annotation is: true [2022-04-08 09:33:33,642 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 37) the Hoare annotation is: true [2022-04-08 09:33:33,642 INFO L885 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-04-08 09:33:33,642 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:33:33,642 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 09:33:33,642 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:33:33,642 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:33:33,642 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:33:33,642 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:33:33,642 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:33:33,642 INFO L885 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-08 09:33:33,643 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 09:33:33,643 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-08 09:33:33,643 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:33:33,643 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:33:33,643 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:33:33,645 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2] [2022-04-08 09:33:33,646 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:33:33,648 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:33:33,649 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:33:33,649 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 09:33:33,650 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:33:33,650 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:33:33,650 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:33:33,651 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 09:33:33,654 INFO L163 areAnnotationChecker]: CFG has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:33:33,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:33:33 BoogieIcfgContainer [2022-04-08 09:33:33,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:33:33,661 INFO L158 Benchmark]: Toolchain (without parser) took 4350.18ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 158.6MB in the beginning and 209.8MB in the end (delta: -51.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:33:33,661 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory is still 175.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:33:33,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.25ms. Allocated memory is still 209.7MB. Free memory was 158.5MB in the beginning and 185.8MB in the end (delta: -27.3MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. [2022-04-08 09:33:33,662 INFO L158 Benchmark]: Boogie Preprocessor took 18.85ms. Allocated memory is still 209.7MB. Free memory was 185.8MB in the beginning and 184.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 09:33:33,662 INFO L158 Benchmark]: RCFGBuilder took 233.44ms. Allocated memory is still 209.7MB. Free memory was 184.4MB in the beginning and 173.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 09:33:33,662 INFO L158 Benchmark]: TraceAbstraction took 3909.33ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 173.2MB in the beginning and 209.8MB in the end (delta: -36.5MB). Peak memory consumption was 4.7MB. Max. memory is 8.0GB. [2022-04-08 09:33:33,663 INFO L339 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.11ms. Allocated memory is still 209.7MB. Free memory is still 175.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.25ms. Allocated memory is still 209.7MB. Free memory was 158.5MB in the beginning and 185.8MB in the end (delta: -27.3MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.85ms. Allocated memory is still 209.7MB. Free memory was 185.8MB in the beginning and 184.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 233.44ms. Allocated memory is still 209.7MB. Free memory was 184.4MB in the beginning and 173.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3909.33ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 173.2MB in the beginning and 209.8MB in the end (delta: -36.5MB). Peak memory consumption was 4.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 37 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 20 LocationsWithAnnotation, 32 PreInvPairs, 45 NumberOfFragments, 64 HoareAnnotationTreeSize, 32 FomulaSimplifications, 37 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 54 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (hi <= lo + mid * 2 && lo <= hi) && lo + mid * 2 <= hi - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 09:33:33,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...