/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/loops-crafted-1/loopv3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:13:38,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:13:38,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:13:38,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:13:38,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:13:38,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:13:38,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:13:38,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:13:38,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:13:38,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:13:38,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:13:38,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:13:38,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:13:38,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:13:38,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:13:38,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:13:38,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:13:38,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:13:38,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:13:38,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:13:38,699 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:13:38,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:13:38,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:13:38,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:13:38,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:13:38,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:13:38,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:13:38,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:13:38,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:13:38,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:13:38,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:13:38,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:13:38,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:13:38,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:13:38,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:13:38,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:13:38,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:13:38,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:13:38,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:13:38,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:13:38,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:13:38,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:13:38,709 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:13:38,721 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:13:38,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:13:38,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:13:38,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:13:38,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:13:38,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:13:38,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:13:38,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:13:38,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:13:38,724 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:13:38,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:13:38,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:13:38,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:13:38,725 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:13:38,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:13:38,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:13:38,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:13:38,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:13:38,725 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:13:38,725 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:13:38,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:13:38,726 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:13:38,726 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-28 10:13:38,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:13:38,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:13:38,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:13:38,921 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:13:38,922 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:13:38,922 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/loopv3.c [2022-04-28 10:13:38,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ef2d69e/f8eeb01e89b0409ea9de7dc623baabe2/FLAGd535dda9e [2022-04-28 10:13:39,302 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:13:39,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv3.c [2022-04-28 10:13:39,306 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ef2d69e/f8eeb01e89b0409ea9de7dc623baabe2/FLAGd535dda9e [2022-04-28 10:13:39,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ef2d69e/f8eeb01e89b0409ea9de7dc623baabe2 [2022-04-28 10:13:39,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:13:39,753 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:13:39,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:13:39,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:13:39,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:13:39,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:13:39" (1/1) ... [2022-04-28 10:13:39,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1a7507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:13:39, skipping insertion in model container [2022-04-28 10:13:39,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:13:39" (1/1) ... [2022-04-28 10:13:39,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:13:39,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:13:39,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv3.c[456,469] [2022-04-28 10:13:39,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:13:39,882 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:13:39,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv3.c[456,469] [2022-04-28 10:13:39,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:13:39,907 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:13:39,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:13:39 WrapperNode [2022-04-28 10:13:39,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:13:39,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:13:39,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:13:39,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:13:39,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:13:39" (1/1) ... [2022-04-28 10:13:39,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:13:39" (1/1) ... [2022-04-28 10:13:39,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:13:39" (1/1) ... [2022-04-28 10:13:39,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:13:39" (1/1) ... [2022-04-28 10:13:39,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:13:39" (1/1) ... [2022-04-28 10:13:39,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:13:39" (1/1) ... [2022-04-28 10:13:39,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:13:39" (1/1) ... [2022-04-28 10:13:39,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:13:39,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:13:39,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:13:39,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:13:39,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:13:39" (1/1) ... [2022-04-28 10:13:39,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:13:39,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:39,976 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-28 10:13:40,016 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-28 10:13:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:13:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:13:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:13:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:13:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:13:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:13:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:13:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:13:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:13:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:13:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:13:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:13:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:13:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:13:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:13:40,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:13:40,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:13:40,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:13:40,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:13:40,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:13:40,074 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:13:40,075 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:13:40,187 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:13:40,192 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:13:40,192 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:13:40,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:13:40 BoogieIcfgContainer [2022-04-28 10:13:40,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:13:40,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:13:40,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:13:40,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:13:40,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:13:39" (1/3) ... [2022-04-28 10:13:40,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e077945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:13:40, skipping insertion in model container [2022-04-28 10:13:40,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:13:39" (2/3) ... [2022-04-28 10:13:40,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e077945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:13:40, skipping insertion in model container [2022-04-28 10:13:40,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:13:40" (3/3) ... [2022-04-28 10:13:40,198 INFO L111 eAbstractionObserver]: Analyzing ICFG loopv3.c [2022-04-28 10:13:40,208 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:13:40,208 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:13:40,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:13:40,238 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70c821a9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@482d9835 [2022-04-28 10:13:40,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:13:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-28 10:13:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:13:40,262 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:40,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:40,263 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:40,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:40,266 INFO L85 PathProgramCache]: Analyzing trace with hash -380103047, now seen corresponding path program 1 times [2022-04-28 10:13:40,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:40,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2119376966] [2022-04-28 10:13:40,278 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:13:40,278 INFO L85 PathProgramCache]: Analyzing trace with hash -380103047, now seen corresponding path program 2 times [2022-04-28 10:13:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:40,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255712640] [2022-04-28 10:13:40,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:40,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:40,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:40,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:40,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(<= 50000001 ~SIZE~0)} assume true; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:40,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#(<= 50000001 ~SIZE~0)} {24#true} #52#return; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:40,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:40,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:40,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#(<= 50000001 ~SIZE~0)} assume true; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:40,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#(<= 50000001 ~SIZE~0)} {24#true} #52#return; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:40,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:40,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {30#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-28 10:13:40,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {25#false} is VALID [2022-04-28 10:13:40,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {25#false} is VALID [2022-04-28 10:13:40,484 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {25#false} is VALID [2022-04-28 10:13:40,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 10:13:40,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 10:13:40,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 10:13:40,485 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-28 10:13:40,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:40,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255712640] [2022-04-28 10:13:40,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255712640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:40,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:40,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:13:40,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:40,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2119376966] [2022-04-28 10:13:40,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2119376966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:40,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:40,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:13:40,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699649732] [2022-04-28 10:13:40,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:40,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 12 [2022-04-28 10:13:40,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:40,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-28 10:13:40,515 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-28 10:13:40,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:13:40,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:40,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:13:40,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:13:40,540 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-28 10:13:40,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:40,734 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-28 10:13:40,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:13:40,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 12 [2022-04-28 10:13:40,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-28 10:13:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-28 10:13:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-28 10:13:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-28 10:13:40,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-28 10:13:40,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:40,807 INFO L225 Difference]: With dead ends: 36 [2022-04-28 10:13:40,808 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 10:13:40,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:13:40,814 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:40,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 22 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:13:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 10:13:40,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-28 10:13:40,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:40,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-28 10:13:40,851 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-28 10:13:40,851 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-28 10:13:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:40,852 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 10:13:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 10:13:40,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:40,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:40,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 16 states. [2022-04-28 10:13:40,853 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 16 states. [2022-04-28 10:13:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:40,855 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 10:13:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 10:13:40,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:40,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:40,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:40,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-28 10:13:40,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 10:13:40,858 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-28 10:13:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:40,858 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 10:13:40,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-28 10:13:40,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 10:13:40,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 10:13:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:13:40,874 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:40,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:40,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:13:40,875 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:40,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:40,875 INFO L85 PathProgramCache]: Analyzing trace with hash 437044508, now seen corresponding path program 1 times [2022-04-28 10:13:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:40,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1820459734] [2022-04-28 10:13:40,891 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:40,891 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:40,891 INFO L85 PathProgramCache]: Analyzing trace with hash 437044508, now seen corresponding path program 2 times [2022-04-28 10:13:40,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:40,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66095413] [2022-04-28 10:13:40,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:40,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:40,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:40,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {180#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:40,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#(<= 50000001 ~SIZE~0)} assume true; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:40,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {177#(<= 50000001 ~SIZE~0)} {172#true} #52#return; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:40,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} call ULTIMATE.init(); {180#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:40,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:40,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#(<= 50000001 ~SIZE~0)} assume true; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:40,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177#(<= 50000001 ~SIZE~0)} {172#true} #52#return; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:40,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {177#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:40,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {178#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-28 10:13:40,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {178#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-28 10:13:40,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {179#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-28 10:13:40,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {179#(<= (+ main_~i~0 49999993) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {173#false} is VALID [2022-04-28 10:13:40,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {173#false} is VALID [2022-04-28 10:13:40,997 INFO L272 TraceCheckUtils]: 10: Hoare triple {173#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {173#false} is VALID [2022-04-28 10:13:40,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {173#false} ~cond := #in~cond; {173#false} is VALID [2022-04-28 10:13:40,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {173#false} assume 0 == ~cond; {173#false} is VALID [2022-04-28 10:13:40,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-04-28 10:13:40,998 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-28 10:13:40,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:40,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66095413] [2022-04-28 10:13:40,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66095413] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:40,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636540617] [2022-04-28 10:13:40,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:13:41,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:41,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:41,023 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-28 10:13:41,024 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-28 10:13:41,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:13:41,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:41,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 10:13:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:41,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:41,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} call ULTIMATE.init(); {172#true} is VALID [2022-04-28 10:13:41,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:41,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#(<= 50000001 ~SIZE~0)} assume true; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:41,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177#(<= 50000001 ~SIZE~0)} {172#true} #52#return; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:41,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {177#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:41,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {199#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-28 10:13:41,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {199#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {199#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-28 10:13:41,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {206#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-28 10:13:41,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {206#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {173#false} is VALID [2022-04-28 10:13:41,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {173#false} is VALID [2022-04-28 10:13:41,221 INFO L272 TraceCheckUtils]: 10: Hoare triple {173#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {173#false} is VALID [2022-04-28 10:13:41,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {173#false} ~cond := #in~cond; {173#false} is VALID [2022-04-28 10:13:41,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {173#false} assume 0 == ~cond; {173#false} is VALID [2022-04-28 10:13:41,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-04-28 10:13:41,222 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-28 10:13:41,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:41,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-04-28 10:13:41,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {173#false} assume 0 == ~cond; {173#false} is VALID [2022-04-28 10:13:41,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {173#false} ~cond := #in~cond; {173#false} is VALID [2022-04-28 10:13:41,325 INFO L272 TraceCheckUtils]: 10: Hoare triple {173#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {173#false} is VALID [2022-04-28 10:13:41,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {173#false} is VALID [2022-04-28 10:13:41,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {173#false} is VALID [2022-04-28 10:13:41,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#(< (+ main_~i~0 8) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {240#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-28 10:13:41,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {244#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:13:41,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#(< 8 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {244#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-28 10:13:41,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#(< 8 ~SIZE~0)} call #t~ret5 := main(); {251#(< 8 ~SIZE~0)} is VALID [2022-04-28 10:13:41,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#(< 8 ~SIZE~0)} {172#true} #52#return; {251#(< 8 ~SIZE~0)} is VALID [2022-04-28 10:13:41,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#(< 8 ~SIZE~0)} assume true; {251#(< 8 ~SIZE~0)} is VALID [2022-04-28 10:13:41,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {251#(< 8 ~SIZE~0)} is VALID [2022-04-28 10:13:41,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} call ULTIMATE.init(); {172#true} is VALID [2022-04-28 10:13:41,332 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-28 10:13:41,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636540617] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:41,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:41,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-28 10:13:41,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:41,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1820459734] [2022-04-28 10:13:41,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1820459734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:41,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:41,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:13:41,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631017988] [2022-04-28 10:13:41,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:41,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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) Word has length 14 [2022-04-28 10:13:41,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:41,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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-28 10:13:41,345 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-28 10:13:41,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:13:41,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:41,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:13:41,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:13:41,346 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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-28 10:13:41,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:41,449 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 10:13:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:13:41,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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) Word has length 14 [2022-04-28 10:13:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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-28 10:13:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-28 10:13:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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-28 10:13:41,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-28 10:13:41,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-28 10:13:41,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:41,481 INFO L225 Difference]: With dead ends: 24 [2022-04-28 10:13:41,481 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 10:13:41,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:13:41,482 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:41,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 15 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:13:41,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 10:13:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-28 10:13:41,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:41,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-28 10:13:41,496 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-28 10:13:41,496 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-28 10:13:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:41,497 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-28 10:13:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 10:13:41,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:41,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:41,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 18 states. [2022-04-28 10:13:41,498 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 18 states. [2022-04-28 10:13:41,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:41,498 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-28 10:13:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 10:13:41,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:41,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:41,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:41,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:41,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-28 10:13:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 10:13:41,500 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2022-04-28 10:13:41,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:41,500 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 10:13:41,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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-28 10:13:41,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 10:13:41,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:13:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:13:41,516 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:41,516 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:41,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 10:13:41,733 WARN L477 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-28 10:13:41,733 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:41,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:41,734 INFO L85 PathProgramCache]: Analyzing trace with hash -263170305, now seen corresponding path program 3 times [2022-04-28 10:13:41,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:41,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128908825] [2022-04-28 10:13:41,742 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:41,742 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash -263170305, now seen corresponding path program 4 times [2022-04-28 10:13:41,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:41,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115562960] [2022-04-28 10:13:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:41,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:41,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:41,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {398#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:41,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#(<= 50000001 ~SIZE~0)} assume true; {398#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:41,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {398#(<= 50000001 ~SIZE~0)} {393#true} #52#return; {398#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:41,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} call ULTIMATE.init(); {402#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:41,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {402#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {398#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:41,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#(<= 50000001 ~SIZE~0)} assume true; {398#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:41,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#(<= 50000001 ~SIZE~0)} {393#true} #52#return; {398#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:41,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {398#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {398#(<= 50000001 ~SIZE~0)} is VALID [2022-04-28 10:13:41,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {398#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {399#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-28 10:13:41,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {399#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {399#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-28 10:13:41,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {399#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {400#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-28 10:13:41,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {400#(<= (+ main_~i~0 49999993) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {400#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-28 10:13:41,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(<= (+ main_~i~0 49999993) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {401#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-28 10:13:41,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {401#(<= (+ main_~i~0 49999985) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {394#false} is VALID [2022-04-28 10:13:41,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {394#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {394#false} is VALID [2022-04-28 10:13:41,833 INFO L272 TraceCheckUtils]: 12: Hoare triple {394#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {394#false} is VALID [2022-04-28 10:13:41,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {394#false} ~cond := #in~cond; {394#false} is VALID [2022-04-28 10:13:41,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {394#false} assume 0 == ~cond; {394#false} is VALID [2022-04-28 10:13:41,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-28 10:13:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:41,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:41,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115562960] [2022-04-28 10:13:41,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115562960] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:41,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246608690] [2022-04-28 10:13:41,834 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:41,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:41,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:41,835 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-28 10:13:41,836 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-28 10:13:41,863 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:41,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:41,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:13:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:41,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:41,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} call ULTIMATE.init(); {393#true} is VALID [2022-04-28 10:13:41,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {393#true} is VALID [2022-04-28 10:13:41,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-28 10:13:41,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} #52#return; {393#true} is VALID [2022-04-28 10:13:41,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} call #t~ret5 := main(); {393#true} is VALID [2022-04-28 10:13:41,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {421#(= main_~i~0 0)} is VALID [2022-04-28 10:13:41,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#(= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {421#(= main_~i~0 0)} is VALID [2022-04-28 10:13:41,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(= main_~i~0 0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {428#(= main_~i~0 8)} is VALID [2022-04-28 10:13:41,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {428#(= main_~i~0 8)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {428#(= main_~i~0 8)} is VALID [2022-04-28 10:13:41,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {428#(= main_~i~0 8)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {435#(= (+ main_~i~0 (- 8)) 8)} is VALID [2022-04-28 10:13:41,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {435#(= (+ main_~i~0 (- 8)) 8)} assume !(~i~0 < ~SIZE~0); {435#(= (+ main_~i~0 (- 8)) 8)} is VALID [2022-04-28 10:13:41,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {435#(= (+ main_~i~0 (- 8)) 8)} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {442#(and (= (+ main_~i~0 (- 8)) 8) (= main_~j~0 (div main_~i~0 4)))} is VALID [2022-04-28 10:13:41,962 INFO L272 TraceCheckUtils]: 12: Hoare triple {442#(and (= (+ main_~i~0 (- 8)) 8) (= main_~j~0 (div main_~i~0 4)))} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {446#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:13:41,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {446#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {450#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:13:41,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {450#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {394#false} is VALID [2022-04-28 10:13:41,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-28 10:13:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:41,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:42,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-28 10:13:42,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {450#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {394#false} is VALID [2022-04-28 10:13:42,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {446#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {450#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:13:42,174 INFO L272 TraceCheckUtils]: 12: Hoare triple {466#(= main_~i~0 (* main_~j~0 4))} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {446#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:13:42,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {470#(= main_~i~0 (* (div main_~i~0 4) 4))} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {466#(= main_~i~0 (* main_~j~0 4))} is VALID [2022-04-28 10:13:42,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {470#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !(~i~0 < ~SIZE~0); {470#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-28 10:13:42,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {470#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {470#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-28 10:13:42,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {470#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {470#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-28 10:13:42,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {470#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {470#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-28 10:13:42,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {470#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {470#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-28 10:13:42,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {470#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-28 10:13:42,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} call #t~ret5 := main(); {393#true} is VALID [2022-04-28 10:13:42,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} #52#return; {393#true} is VALID [2022-04-28 10:13:42,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-28 10:13:42,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {393#true} is VALID [2022-04-28 10:13:42,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} call ULTIMATE.init(); {393#true} is VALID [2022-04-28 10:13:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:13:42,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246608690] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:42,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:13:42,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 8] total 15 [2022-04-28 10:13:42,180 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:42,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128908825] [2022-04-28 10:13:42,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128908825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:42,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:42,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:13:42,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463684600] [2022-04-28 10:13:42,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:42,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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 16 [2022-04-28 10:13:42,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:42,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-28 10:13:42,192 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-28 10:13:42,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:13:42,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:42,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:13:42,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:13:42,193 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-28 10:13:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:42,259 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 10:13:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:13:42,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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 16 [2022-04-28 10:13:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-28 10:13:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-28 10:13:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-28 10:13:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-28 10:13:42,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-28 10:13:42,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:42,282 INFO L225 Difference]: With dead ends: 17 [2022-04-28 10:13:42,282 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:13:42,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:13:42,283 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:42,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 29 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:13:42,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:13:42,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:13:42,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:42,284 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-28 10:13:42,284 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-28 10:13:42,284 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-28 10:13:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:42,285 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:13:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:13:42,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:42,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:42,285 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-28 10:13:42,285 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-28 10:13:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:42,285 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:13:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:13:42,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:42,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:42,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:42,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:42,286 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-28 10:13:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:13:42,286 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-28 10:13:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:42,286 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:13:42,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-28 10:13:42,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:13:42,286 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-28 10:13:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:13:42,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:42,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:13:42,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 10:13:42,492 WARN L477 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-28 10:13:42,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:13:42,603 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 7) no Hoare annotation was computed. [2022-04-28 10:13:42,603 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 7) no Hoare annotation was computed. [2022-04-28 10:13:42,603 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 7) no Hoare annotation was computed. [2022-04-28 10:13:42,603 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 9 11) no Hoare annotation was computed. [2022-04-28 10:13:42,603 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-28 10:13:42,603 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2022-04-28 10:13:42,603 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2022-04-28 10:13:42,604 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (= main_~i~0 (* main_~j~0 4))) [2022-04-28 10:13:42,604 INFO L902 garLoopResultBuilder]: At program point L32-1(line 32) the Hoare annotation is: true [2022-04-28 10:13:42,604 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 34) the Hoare annotation is: true [2022-04-28 10:13:42,604 INFO L895 garLoopResultBuilder]: At program point L25(lines 25 28) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (= main_~i~0 (* (div main_~i~0 4) 4))) [2022-04-28 10:13:42,604 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 20 34) the Hoare annotation is: true [2022-04-28 10:13:42,604 INFO L895 garLoopResultBuilder]: At program point L25-2(lines 23 30) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (= main_~i~0 (* (div main_~i~0 4) 4))) [2022-04-28 10:13:42,604 INFO L895 garLoopResultBuilder]: At program point L23-2(lines 23 30) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (= main_~i~0 (* (div main_~i~0 4) 4))) [2022-04-28 10:13:42,604 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 20 34) the Hoare annotation is: true [2022-04-28 10:13:42,604 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= 50000001 ~SIZE~0) [2022-04-28 10:13:42,604 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 10:13:42,604 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= 50000001 ~SIZE~0) [2022-04-28 10:13:42,604 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: (<= 50000001 ~SIZE~0) [2022-04-28 10:13:42,605 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= 50000001 ~SIZE~0) [2022-04-28 10:13:42,605 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:13:42,605 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: (<= 50000001 ~SIZE~0) [2022-04-28 10:13:42,605 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 17) the Hoare annotation is: true [2022-04-28 10:13:42,605 INFO L895 garLoopResultBuilder]: At program point L14(line 14) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 10:13:42,605 INFO L895 garLoopResultBuilder]: At program point L13(lines 13 15) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 10:13:42,605 INFO L902 garLoopResultBuilder]: At program point L13-2(lines 12 17) the Hoare annotation is: true [2022-04-28 10:13:42,605 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 12 17) the Hoare annotation is: true [2022-04-28 10:13:42,605 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 10:13:42,607 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2] [2022-04-28 10:13:42,608 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:13:42,610 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:13:42,611 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 10:13:42,612 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:13:42,613 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-28 10:13:42,613 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-28 10:13:42,616 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-28 10:13:42,620 INFO L163 areAnnotationChecker]: CFG has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:13:42,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:13:42 BoogieIcfgContainer [2022-04-28 10:13:42,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:13:42,626 INFO L158 Benchmark]: Toolchain (without parser) took 2872.66ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 176.7MB in the beginning and 102.8MB in the end (delta: 73.8MB). Peak memory consumption was 113.6MB. Max. memory is 8.0GB. [2022-04-28 10:13:42,626 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 162.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:13:42,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.63ms. Allocated memory is still 200.3MB. Free memory was 176.6MB in the beginning and 174.5MB in the end (delta: 2.2MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-28 10:13:42,626 INFO L158 Benchmark]: Boogie Preprocessor took 34.24ms. Allocated memory is still 200.3MB. Free memory was 174.5MB in the beginning and 172.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 10:13:42,627 INFO L158 Benchmark]: RCFGBuilder took 250.13ms. Allocated memory is still 200.3MB. Free memory was 172.8MB in the beginning and 162.7MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 10:13:42,627 INFO L158 Benchmark]: TraceAbstraction took 2430.63ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 162.0MB in the beginning and 102.8MB in the end (delta: 59.1MB). Peak memory consumption was 99.6MB. Max. memory is 8.0GB. [2022-04-28 10:13:42,628 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.10ms. Allocated memory is still 200.3MB. Free memory is still 162.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 153.63ms. Allocated memory is still 200.3MB. Free memory was 176.6MB in the beginning and 174.5MB in the end (delta: 2.2MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.24ms. Allocated memory is still 200.3MB. Free memory was 174.5MB in the beginning and 172.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 250.13ms. Allocated memory is still 200.3MB. Free memory was 172.8MB in the beginning and 162.7MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2430.63ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 162.0MB in the beginning and 102.8MB in the end (delta: 59.1MB). Peak memory consumption was 99.6MB. 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: 14]: 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 34 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 19, 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, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 33 PreInvPairs, 47 NumberOfFragments, 109 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 122 FormulaSimplificationTreeSizeReductionInter, 0.1s 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: 23]: Loop Invariant Derived loop invariant: !(50000001 <= SIZE) || i == i / 4 * 4 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 12]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 10:13:42,637 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...