/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/mono-crafted_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:02:04,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:02:04,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:02:04,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:02:04,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:02:04,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:02:04,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:02:04,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:02:04,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:02:04,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:02:04,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:02:04,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:02:04,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:02:04,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:02:04,880 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:02:04,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:02:04,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:02:04,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:02:04,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:02:04,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:02:04,893 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:02:04,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:02:04,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:02:04,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:02:04,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:02:04,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:02:04,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:02:04,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:02:04,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:02:04,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:02:04,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:02:04,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:02:04,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:02:04,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:02:04,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:02:04,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:02:04,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:02:04,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:02:04,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:02:04,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:02:04,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:02:04,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:02:04,913 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:02:04,924 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:02:04,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:02:04,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:02:04,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:02:04,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:02:04,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:02:04,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:02:04,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:02:04,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:02:04,927 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:02:04,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:02:04,928 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:02:04,928 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:02:04,928 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:02:04,928 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:02:04,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:02:04,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:02:04,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:02:04,929 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:02:04,929 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:02:04,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:02:04,929 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:02:04,930 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-15 13:02:05,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:02:05,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:02:05,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:02:05,182 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:02:05,183 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:02:05,184 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_6.c [2022-04-15 13:02:05,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b53e29cb/fc5f2112c0dd40b69adc1f51733c03d7/FLAGfeb0cbb3c [2022-04-15 13:02:05,605 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:02:05,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_6.c [2022-04-15 13:02:05,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b53e29cb/fc5f2112c0dd40b69adc1f51733c03d7/FLAGfeb0cbb3c [2022-04-15 13:02:06,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b53e29cb/fc5f2112c0dd40b69adc1f51733c03d7 [2022-04-15 13:02:06,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:02:06,046 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:02:06,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:02:06,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:02:06,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:02:06,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:02:06" (1/1) ... [2022-04-15 13:02:06,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17506788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:02:06, skipping insertion in model container [2022-04-15 13:02:06,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:02:06" (1/1) ... [2022-04-15 13:02:06,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:02:06,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:02:06,204 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/mono-crafted_6.c[318,331] [2022-04-15 13:02:06,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:02:06,221 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:02:06,231 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/mono-crafted_6.c[318,331] [2022-04-15 13:02:06,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:02:06,248 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:02:06,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:02:06 WrapperNode [2022-04-15 13:02:06,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:02:06,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:02:06,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:02:06,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:02:06,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:02:06" (1/1) ... [2022-04-15 13:02:06,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:02:06" (1/1) ... [2022-04-15 13:02:06,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:02:06" (1/1) ... [2022-04-15 13:02:06,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:02:06" (1/1) ... [2022-04-15 13:02:06,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:02:06" (1/1) ... [2022-04-15 13:02:06,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:02:06" (1/1) ... [2022-04-15 13:02:06,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:02:06" (1/1) ... [2022-04-15 13:02:06,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:02:06,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:02:06,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:02:06,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:02:06,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:02:06" (1/1) ... [2022-04-15 13:02:06,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:02:06,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:02:06,306 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-15 13:02:06,308 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-15 13:02:06,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:02:06,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:02:06,332 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:02:06,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:02:06,333 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:02:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:02:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:02:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:02:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:02:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:02:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:02:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:02:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:02:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:02:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:02:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:02:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:02:06,379 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:02:06,380 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:02:06,552 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:02:06,558 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:02:06,558 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:02:06,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:02:06 BoogieIcfgContainer [2022-04-15 13:02:06,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:02:06,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:02:06,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:02:06,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:02:06,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:02:06" (1/3) ... [2022-04-15 13:02:06,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9c4f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:02:06, skipping insertion in model container [2022-04-15 13:02:06,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:02:06" (2/3) ... [2022-04-15 13:02:06,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9c4f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:02:06, skipping insertion in model container [2022-04-15 13:02:06,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:02:06" (3/3) ... [2022-04-15 13:02:06,591 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_6.c [2022-04-15 13:02:06,595 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:02:06,595 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:02:06,666 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:02:06,680 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:02:06,680 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:02:06,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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-15 13:02:06,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:02:06,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:02:06,707 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:02:06,712 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:02:06,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:02:06,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1440262230, now seen corresponding path program 1 times [2022-04-15 13:02:06,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:06,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128359466] [2022-04-15 13:02:06,741 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:02:06,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1440262230, now seen corresponding path program 2 times [2022-04-15 13:02:06,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:02:06,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707446312] [2022-04-15 13:02:06,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:06,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:02:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:06,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:02:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:06,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-15 13:02:06,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 13:02:06,986 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #48#return; {25#true} is VALID [2022-04-15 13:02:06,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:02:06,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-15 13:02:06,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 13:02:06,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #48#return; {25#true} is VALID [2022-04-15 13:02:06,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret7 := main(); {25#true} is VALID [2022-04-15 13:02:06,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {30#(= main_~x~0 0)} is VALID [2022-04-15 13:02:06,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#(= main_~x~0 0)} assume !(~x~0 < 1000000); {26#false} is VALID [2022-04-15 13:02:06,991 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {26#false} is VALID [2022-04-15 13:02:06,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-15 13:02:06,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-15 13:02:06,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 13:02:06,993 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-15 13:02:06,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:02:06,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707446312] [2022-04-15 13:02:06,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707446312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:02:06,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:02:06,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:02:06,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:02:07,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128359466] [2022-04-15 13:02:07,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128359466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:02:07,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:02:07,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:02:07,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952710966] [2022-04-15 13:02:07,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:02:07,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:02:07,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:02:07,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:07,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:07,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:02:07,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:07,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:02:07,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:02:07,061 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:07,241 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-04-15 13:02:07,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:02:07,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:02:07,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:02:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 13:02:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 13:02:07,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-15 13:02:07,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:07,325 INFO L225 Difference]: With dead ends: 40 [2022-04-15 13:02:07,326 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 13:02:07,329 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:02:07,333 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:02:07,336 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 30 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:02:07,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 13:02:07,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 13:02:07,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:02:07,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 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-15 13:02:07,374 INFO L74 IsIncluded]: Start isIncluded. First operand 17 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-15 13:02:07,376 INFO L87 Difference]: Start difference. First operand 17 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-15 13:02:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:07,386 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 13:02:07,386 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:02:07,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:07,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:07,387 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 17 states. [2022-04-15 13:02:07,387 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 17 states. [2022-04-15 13:02:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:07,394 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 13:02:07,394 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:02:07,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:07,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:07,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:02:07,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:02:07,396 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-15 13:02:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 13:02:07,399 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-15 13:02:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:02:07,400 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 13:02:07,400 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:07,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 13:02:07,429 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-15 13:02:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:02:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 13:02:07,430 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:02:07,431 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:02:07,432 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:02:07,434 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:02:07,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:02:07,435 INFO L85 PathProgramCache]: Analyzing trace with hash -273622713, now seen corresponding path program 1 times [2022-04-15 13:02:07,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:07,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1157281619] [2022-04-15 13:02:07,572 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:02:07,574 INFO L85 PathProgramCache]: Analyzing trace with hash -550999127, now seen corresponding path program 1 times [2022-04-15 13:02:07,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:02:07,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896334227] [2022-04-15 13:02:07,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:07,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:02:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:07,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:02:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:07,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {184#true} is VALID [2022-04-15 13:02:07,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {184#true} assume true; {184#true} is VALID [2022-04-15 13:02:07,629 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {184#true} {184#true} #48#return; {184#true} is VALID [2022-04-15 13:02:07,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {184#true} call ULTIMATE.init(); {191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:02:07,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {184#true} is VALID [2022-04-15 13:02:07,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {184#true} assume true; {184#true} is VALID [2022-04-15 13:02:07,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {184#true} {184#true} #48#return; {184#true} is VALID [2022-04-15 13:02:07,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {184#true} call #t~ret7 := main(); {184#true} is VALID [2022-04-15 13:02:07,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {184#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {189#(= main_~x~0 0)} is VALID [2022-04-15 13:02:07,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {189#(= main_~x~0 0)} [54] L11-2-->L10-2_primed: Formula: (or (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= |v_main_#t~post4_Out_2| 0) (< v_main_~x~0_Out_2 500001)) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) InVars {main_~x~0=v_main_~x~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_#t~post4=|v_main_#t~post4_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {190#(<= main_~x~0 500000)} is VALID [2022-04-15 13:02:07,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {190#(<= main_~x~0 500000)} [53] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {185#false} is VALID [2022-04-15 13:02:07,633 INFO L272 TraceCheckUtils]: 8: Hoare triple {185#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {185#false} is VALID [2022-04-15 13:02:07,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {185#false} ~cond := #in~cond; {185#false} is VALID [2022-04-15 13:02:07,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {185#false} assume 0 == ~cond; {185#false} is VALID [2022-04-15 13:02:07,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {185#false} assume !false; {185#false} is VALID [2022-04-15 13:02:07,634 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-15 13:02:07,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:02:07,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896334227] [2022-04-15 13:02:07,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896334227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:02:07,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:02:07,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:02:07,720 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:02:07,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1157281619] [2022-04-15 13:02:07,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1157281619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:02:07,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:02:07,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:02:07,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047969375] [2022-04-15 13:02:07,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:02:07,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 13:02:07,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:02:07,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:07,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:07,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:02:07,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:07,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:02:07,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:02:07,735 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:07,881 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-15 13:02:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:02:07,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 13:02:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:02:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-15 13:02:07,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:07,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-15 13:02:07,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-15 13:02:07,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:07,926 INFO L225 Difference]: With dead ends: 29 [2022-04-15 13:02:07,926 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 13:02:07,927 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:02:07,934 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:02:07,936 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 25 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:02:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 13:02:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 13:02:07,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:02:07,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-15 13:02:07,953 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-15 13:02:07,953 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-15 13:02:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:07,954 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 13:02:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 13:02:07,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:07,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:07,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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 20 states. [2022-04-15 13:02:07,955 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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 20 states. [2022-04-15 13:02:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:07,957 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 13:02:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 13:02:07,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:07,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:07,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:02:07,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:02:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-15 13:02:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-15 13:02:07,959 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2022-04-15 13:02:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:02:07,959 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-15 13:02:07,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:07,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-15 13:02:07,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 13:02:07,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:02:07,983 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:02:07,983 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:02:07,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:02:07,983 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:02:07,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:02:07,984 INFO L85 PathProgramCache]: Analyzing trace with hash -88759266, now seen corresponding path program 1 times [2022-04-15 13:02:07,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:07,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [754829009] [2022-04-15 13:04:27,430 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.pushout(QvasrAbstractionJoin.java:181) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.join(QvasrAbstractionJoin.java:116) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:130) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 13:04:27,433 INFO L158 Benchmark]: Toolchain (without parser) took 141387.45ms. Allocated memory was 180.4MB in the beginning and 232.8MB in the end (delta: 52.4MB). Free memory was 133.3MB in the beginning and 147.7MB in the end (delta: -14.4MB). Peak memory consumption was 94.5MB. Max. memory is 8.0GB. [2022-04-15 13:04:27,434 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 180.4MB. Free memory was 150.0MB in the beginning and 149.9MB in the end (delta: 77.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:04:27,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.46ms. Allocated memory is still 180.4MB. Free memory was 133.0MB in the beginning and 159.6MB in the end (delta: -26.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 13:04:27,434 INFO L158 Benchmark]: Boogie Preprocessor took 25.29ms. Allocated memory is still 180.4MB. Free memory was 159.6MB in the beginning and 158.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 13:04:27,435 INFO L158 Benchmark]: RCFGBuilder took 284.71ms. Allocated memory is still 180.4MB. Free memory was 158.0MB in the beginning and 147.3MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 13:04:27,435 INFO L158 Benchmark]: TraceAbstraction took 140871.03ms. Allocated memory was 180.4MB in the beginning and 232.8MB in the end (delta: 52.4MB). Free memory was 146.7MB in the beginning and 147.7MB in the end (delta: -973.9kB). Peak memory consumption was 108.9MB. Max. memory is 8.0GB. [2022-04-15 13:04:27,437 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.21ms. Allocated memory is still 180.4MB. Free memory was 150.0MB in the beginning and 149.9MB in the end (delta: 77.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.46ms. Allocated memory is still 180.4MB. Free memory was 133.0MB in the beginning and 159.6MB in the end (delta: -26.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.29ms. Allocated memory is still 180.4MB. Free memory was 159.6MB in the beginning and 158.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 284.71ms. Allocated memory is still 180.4MB. Free memory was 158.0MB in the beginning and 147.3MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 140871.03ms. Allocated memory was 180.4MB in the beginning and 232.8MB in the end (delta: 52.4MB). Free memory was 146.7MB in the beginning and 147.7MB in the end (delta: -973.9kB). Peak memory consumption was 108.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 13:04:27,466 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...