/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_3-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:13:04,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:13:05,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:13:05,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:13:05,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:13:05,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:13:05,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:13:05,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:13:05,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:13:05,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:13:05,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:13:05,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:13:05,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:13:05,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:13:05,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:13:05,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:13:05,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:13:05,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:13:05,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:13:05,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:13:05,091 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:13:05,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:13:05,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:13:05,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:13:05,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:13:05,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:13:05,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:13:05,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:13:05,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:13:05,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:13:05,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:13:05,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:13:05,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:13:05,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:13:05,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:13:05,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:13:05,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:13:05,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:13:05,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:13:05,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:13:05,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:13:05,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:13:05,108 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:13:05,119 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:13:05,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:13:05,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:13:05,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:13:05,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:13:05,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:13:05,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:13:05,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:13:05,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:13:05,122 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:13:05,122 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:13:05,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:13:05,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:13:05,122 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:13:05,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:13:05,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:13:05,123 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:13:05,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:13:05,123 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:13:05,124 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:13:05,124 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:13:05,124 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:13:05,124 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:13:05,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:13:05,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:13:05,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:13:05,341 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:13:05,342 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:13:05,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_3-1.i [2022-04-08 09:13:05,419 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bf2c581c/ce45de2673084bb7828b41646b7493b4/FLAG01ba9d18e [2022-04-08 09:13:05,782 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:13:05,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-1.i [2022-04-08 09:13:05,788 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bf2c581c/ce45de2673084bb7828b41646b7493b4/FLAG01ba9d18e [2022-04-08 09:13:05,804 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bf2c581c/ce45de2673084bb7828b41646b7493b4 [2022-04-08 09:13:05,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:13:05,807 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:13:05,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:13:05,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:13:05,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:13:05,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:13:05" (1/1) ... [2022-04-08 09:13:05,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73fdbce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:13:05, skipping insertion in model container [2022-04-08 09:13:05,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:13:05" (1/1) ... [2022-04-08 09:13:05,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:13:05,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:13:05,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-1.i[849,862] [2022-04-08 09:13:05,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:13:05,988 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:13:05,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-1.i[849,862] [2022-04-08 09:13:06,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:13:06,013 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:13:06,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:13:06 WrapperNode [2022-04-08 09:13:06,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:13:06,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:13:06,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:13:06,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:13:06,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:13:06" (1/1) ... [2022-04-08 09:13:06,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:13:06" (1/1) ... [2022-04-08 09:13:06,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:13:06" (1/1) ... [2022-04-08 09:13:06,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:13:06" (1/1) ... [2022-04-08 09:13:06,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:13:06" (1/1) ... [2022-04-08 09:13:06,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:13:06" (1/1) ... [2022-04-08 09:13:06,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:13:06" (1/1) ... [2022-04-08 09:13:06,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:13:06,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:13:06,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:13:06,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:13:06,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:13:06" (1/1) ... [2022-04-08 09:13:06,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:13:06,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:13:06,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:13:06,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:13:06,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:13:06,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:13:06,091 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:13:06,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:13:06,091 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:13:06,091 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:13:06,091 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:13:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:13:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:13:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:13:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:13:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:13:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:13:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:13:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 09:13:06,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:13:06,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:13:06,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:13:06,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:13:06,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:13:06,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:13:06,143 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:13:06,144 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:13:06,248 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:13:06,254 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:13:06,254 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 09:13:06,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:13:06 BoogieIcfgContainer [2022-04-08 09:13:06,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:13:06,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:13:06,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:13:06,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:13:06,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:13:05" (1/3) ... [2022-04-08 09:13:06,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d5676a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:13:06, skipping insertion in model container [2022-04-08 09:13:06,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:13:06" (2/3) ... [2022-04-08 09:13:06,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d5676a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:13:06, skipping insertion in model container [2022-04-08 09:13:06,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:13:06" (3/3) ... [2022-04-08 09:13:06,262 INFO L111 eAbstractionObserver]: Analyzing ICFG array_3-1.i [2022-04-08 09:13:06,266 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:13:06,267 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:13:06,300 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:13:06,305 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:13:06,306 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:13:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:13:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 09:13:06,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:13:06,326 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:13:06,327 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:13:06,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:13:06,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1037683284, now seen corresponding path program 1 times [2022-04-08 09:13:06,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:13:06,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2100901553] [2022-04-08 09:13:06,346 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:13:06,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1037683284, now seen corresponding path program 2 times [2022-04-08 09:13:06,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:13:06,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548063600] [2022-04-08 09:13:06,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:13:06,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:13:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:13:06,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:13:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:13:06,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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(12, 2); {28#true} is VALID [2022-04-08 09:13:06,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 09:13:06,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #63#return; {28#true} is VALID [2022-04-08 09:13:06,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:13:06,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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(12, 2); {28#true} is VALID [2022-04-08 09:13:06,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 09:13:06,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #63#return; {28#true} is VALID [2022-04-08 09:13:06,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret5 := main(); {28#true} is VALID [2022-04-08 09:13:06,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28#true} is VALID [2022-04-08 09:13:06,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-08 09:13:06,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} ~i~0 := 0; {29#false} is VALID [2022-04-08 09:13:06,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} assume !true; {29#false} is VALID [2022-04-08 09:13:06,624 INFO L272 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {29#false} is VALID [2022-04-08 09:13:06,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-08 09:13:06,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-08 09:13:06,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-08 09:13:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:13:06,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:13:06,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548063600] [2022-04-08 09:13:06,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548063600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:13:06,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:13:06,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:13:06,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:13:06,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2100901553] [2022-04-08 09:13:06,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2100901553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:13:06,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:13:06,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:13:06,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414297954] [2022-04-08 09:13:06,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:13:06,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:13:06,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:13:06,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:06,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:06,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:13:06,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:13:06,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:13:06,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:13:06,695 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:06,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:06,766 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-08 09:13:06,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:13:06,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 09:13:06,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:13:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-08 09:13:06,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-08 09:13:06,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-04-08 09:13:06,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:06,881 INFO L225 Difference]: With dead ends: 42 [2022-04-08 09:13:06,882 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 09:13:06,885 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:13:06,889 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:13:06,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:13:06,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 09:13:06,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-08 09:13:06,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:13:06,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:06,928 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:06,929 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:06,932 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-08 09:13:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 09:13:06,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:13:06,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:13:06,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-08 09:13:06,933 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-08 09:13:06,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:06,935 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-08 09:13:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 09:13:06,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:13:06,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:13:06,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:13:06,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:13:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-08 09:13:06,942 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2022-04-08 09:13:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:13:06,944 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-08 09:13:06,945 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:06,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-08 09:13:06,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 09:13:06,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:13:06,979 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:13:06,979 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:13:06,982 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:13:06,982 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:13:06,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:13:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash -193552662, now seen corresponding path program 1 times [2022-04-08 09:13:06,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:13:06,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [339184925] [2022-04-08 09:13:06,984 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:13:06,984 INFO L85 PathProgramCache]: Analyzing trace with hash -193552662, now seen corresponding path program 2 times [2022-04-08 09:13:06,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:13:06,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158374939] [2022-04-08 09:13:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:13:06,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:13:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:13:07,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:13:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:13:07,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#(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(12, 2); {192#true} is VALID [2022-04-08 09:13:07,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#true} assume true; {192#true} is VALID [2022-04-08 09:13:07,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {192#true} {192#true} #63#return; {192#true} is VALID [2022-04-08 09:13:07,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {192#true} call ULTIMATE.init(); {198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:13:07,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#(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(12, 2); {192#true} is VALID [2022-04-08 09:13:07,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {192#true} assume true; {192#true} is VALID [2022-04-08 09:13:07,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192#true} {192#true} #63#return; {192#true} is VALID [2022-04-08 09:13:07,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {192#true} call #t~ret5 := main(); {192#true} is VALID [2022-04-08 09:13:07,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {192#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {197#(= main_~i~0 0)} is VALID [2022-04-08 09:13:07,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {197#(= main_~i~0 0)} assume !(~i~0 < 1024); {193#false} is VALID [2022-04-08 09:13:07,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {193#false} ~i~0 := 0; {193#false} is VALID [2022-04-08 09:13:07,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {193#false} is VALID [2022-04-08 09:13:07,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {193#false} assume !(0 != #t~mem4);havoc #t~mem4; {193#false} is VALID [2022-04-08 09:13:07,068 INFO L272 TraceCheckUtils]: 10: Hoare triple {193#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {193#false} is VALID [2022-04-08 09:13:07,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {193#false} ~cond := #in~cond; {193#false} is VALID [2022-04-08 09:13:07,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {193#false} assume 0 == ~cond; {193#false} is VALID [2022-04-08 09:13:07,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {193#false} assume !false; {193#false} is VALID [2022-04-08 09:13:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:13:07,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:13:07,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158374939] [2022-04-08 09:13:07,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158374939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:13:07,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:13:07,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:13:07,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:13:07,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [339184925] [2022-04-08 09:13:07,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [339184925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:13:07,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:13:07,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:13:07,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532372220] [2022-04-08 09:13:07,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:13:07,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:13:07,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:13:07,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:07,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:07,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:13:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:13:07,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:13:07,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:13:07,086 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:07,161 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-08 09:13:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:13:07,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:13:07,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:13:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-08 09:13:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-08 09:13:07,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-08 09:13:07,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:07,205 INFO L225 Difference]: With dead ends: 35 [2022-04-08 09:13:07,205 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 09:13:07,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:13:07,207 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:13:07,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 22 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:13:07,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 09:13:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-08 09:13:07,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:13:07,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:07,214 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:07,214 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:07,216 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 09:13:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 09:13:07,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:13:07,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:13:07,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 25 states. [2022-04-08 09:13:07,218 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 25 states. [2022-04-08 09:13:07,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:07,220 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 09:13:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 09:13:07,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:13:07,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:13:07,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:13:07,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:13:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-08 09:13:07,222 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-04-08 09:13:07,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:13:07,223 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-08 09:13:07,223 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:07,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 25 transitions. [2022-04-08 09:13:07,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-08 09:13:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:13:07,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:13:07,249 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:13:07,249 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:13:07,249 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:13:07,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:13:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1156315956, now seen corresponding path program 1 times [2022-04-08 09:13:07,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:13:07,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [96992543] [2022-04-08 09:13:07,261 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:13:07,261 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:13:07,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1156315956, now seen corresponding path program 2 times [2022-04-08 09:13:07,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:13:07,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992592541] [2022-04-08 09:13:07,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:13:07,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:13:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:13:07,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:13:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:13:07,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {374#(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(12, 2); {367#true} is VALID [2022-04-08 09:13:07,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} assume true; {367#true} is VALID [2022-04-08 09:13:07,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {367#true} {367#true} #63#return; {367#true} is VALID [2022-04-08 09:13:07,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} call ULTIMATE.init(); {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:13:07,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {374#(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(12, 2); {367#true} is VALID [2022-04-08 09:13:07,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {367#true} assume true; {367#true} is VALID [2022-04-08 09:13:07,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} #63#return; {367#true} is VALID [2022-04-08 09:13:07,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {367#true} call #t~ret5 := main(); {367#true} is VALID [2022-04-08 09:13:07,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {372#(= main_~i~0 0)} is VALID [2022-04-08 09:13:07,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {372#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {372#(= main_~i~0 0)} is VALID [2022-04-08 09:13:07,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {372#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {373#(<= main_~i~0 1)} is VALID [2022-04-08 09:13:07,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {373#(<= main_~i~0 1)} assume !(~i~0 < 1024); {368#false} is VALID [2022-04-08 09:13:07,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#false} ~i~0 := 0; {368#false} is VALID [2022-04-08 09:13:07,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {368#false} is VALID [2022-04-08 09:13:07,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#false} assume !(0 != #t~mem4);havoc #t~mem4; {368#false} is VALID [2022-04-08 09:13:07,321 INFO L272 TraceCheckUtils]: 12: Hoare triple {368#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {368#false} is VALID [2022-04-08 09:13:07,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {368#false} ~cond := #in~cond; {368#false} is VALID [2022-04-08 09:13:07,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {368#false} assume 0 == ~cond; {368#false} is VALID [2022-04-08 09:13:07,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {368#false} assume !false; {368#false} is VALID [2022-04-08 09:13:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:13:07,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:13:07,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992592541] [2022-04-08 09:13:07,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992592541] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:13:07,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120093303] [2022-04-08 09:13:07,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:13:07,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:13:07,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:13:07,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:13:07,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 09:13:07,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 09:13:07,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:13:07,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 09:13:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:13:07,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:13:07,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} call ULTIMATE.init(); {367#true} is VALID [2022-04-08 09:13:07,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#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(12, 2); {367#true} is VALID [2022-04-08 09:13:07,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {367#true} assume true; {367#true} is VALID [2022-04-08 09:13:07,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} #63#return; {367#true} is VALID [2022-04-08 09:13:07,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {367#true} call #t~ret5 := main(); {367#true} is VALID [2022-04-08 09:13:07,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {367#true} is VALID [2022-04-08 09:13:07,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {367#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {367#true} is VALID [2022-04-08 09:13:07,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {367#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {367#true} is VALID [2022-04-08 09:13:07,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {367#true} assume !(~i~0 < 1024); {367#true} is VALID [2022-04-08 09:13:07,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {367#true} ~i~0 := 0; {405#(<= main_~i~0 0)} is VALID [2022-04-08 09:13:07,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {405#(<= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {405#(<= main_~i~0 0)} is VALID [2022-04-08 09:13:07,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {405#(<= main_~i~0 0)} assume !(0 != #t~mem4);havoc #t~mem4; {405#(<= main_~i~0 0)} is VALID [2022-04-08 09:13:07,518 INFO L272 TraceCheckUtils]: 12: Hoare triple {405#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:13:07,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:13:07,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {368#false} is VALID [2022-04-08 09:13:07,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {368#false} assume !false; {368#false} is VALID [2022-04-08 09:13:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:13:07,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 09:13:07,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120093303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:13:07,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 09:13:07,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-04-08 09:13:07,521 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:13:07,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [96992543] [2022-04-08 09:13:07,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [96992543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:13:07,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:13:07,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:13:07,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037497138] [2022-04-08 09:13:07,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:13:07,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-08 09:13:07,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:13:07,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-08 09:13:07,536 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-08 09:13:07,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:13:07,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:13:07,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:13:07,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:13:07,537 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-08 09:13:07,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:07,621 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-08 09:13:07,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:13:07,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-08 09:13:07,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:13:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-08 09:13:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-08 09:13:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-08 09:13:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-08 09:13:07,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-08 09:13:07,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:07,651 INFO L225 Difference]: With dead ends: 29 [2022-04-08 09:13:07,651 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 09:13:07,651 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 09:13:07,652 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:13:07,653 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:13:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 09:13:07,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-04-08 09:13:07,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:13:07,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:07,661 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:07,661 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:07,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:07,663 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-08 09:13:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-08 09:13:07,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:13:07,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:13:07,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 24 states. [2022-04-08 09:13:07,664 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 24 states. [2022-04-08 09:13:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:07,666 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-08 09:13:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-08 09:13:07,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:13:07,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:13:07,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:13:07,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:13:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-08 09:13:07,668 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2022-04-08 09:13:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:13:07,668 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-08 09:13:07,668 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-08 09:13:07,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2022-04-08 09:13:07,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-08 09:13:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:13:07,693 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:13:07,693 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:13:07,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 09:13:07,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:13:07,916 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:13:07,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:13:07,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1375191853, now seen corresponding path program 1 times [2022-04-08 09:13:07,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:13:07,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1511764998] [2022-04-08 09:13:07,924 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:13:07,924 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:13:07,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1375191853, now seen corresponding path program 2 times [2022-04-08 09:13:07,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:13:07,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282330111] [2022-04-08 09:13:07,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:13:07,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:13:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:13:07,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:13:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:13:08,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#(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(12, 2); {577#true} is VALID [2022-04-08 09:13:08,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {577#true} assume true; {577#true} is VALID [2022-04-08 09:13:08,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {577#true} {577#true} #63#return; {577#true} is VALID [2022-04-08 09:13:08,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {577#true} call ULTIMATE.init(); {584#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:13:08,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#(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(12, 2); {577#true} is VALID [2022-04-08 09:13:08,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {577#true} assume true; {577#true} is VALID [2022-04-08 09:13:08,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {577#true} {577#true} #63#return; {577#true} is VALID [2022-04-08 09:13:08,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {577#true} call #t~ret5 := main(); {577#true} is VALID [2022-04-08 09:13:08,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {577#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {582#(= main_~i~0 0)} is VALID [2022-04-08 09:13:08,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {582#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {582#(= main_~i~0 0)} is VALID [2022-04-08 09:13:08,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {582#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {583#(<= main_~i~0 1)} is VALID [2022-04-08 09:13:08,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {583#(<= main_~i~0 1)} assume !(~i~0 < 1024); {578#false} is VALID [2022-04-08 09:13:08,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {578#false} ~i~0 := 0; {578#false} is VALID [2022-04-08 09:13:08,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {578#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {578#false} is VALID [2022-04-08 09:13:08,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {578#false} assume !!(0 != #t~mem4);havoc #t~mem4; {578#false} is VALID [2022-04-08 09:13:08,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {578#false} assume !(~i~0 >= 1023); {578#false} is VALID [2022-04-08 09:13:08,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {578#false} is VALID [2022-04-08 09:13:08,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {578#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {578#false} is VALID [2022-04-08 09:13:08,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {578#false} assume !(0 != #t~mem4);havoc #t~mem4; {578#false} is VALID [2022-04-08 09:13:08,024 INFO L272 TraceCheckUtils]: 16: Hoare triple {578#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {578#false} is VALID [2022-04-08 09:13:08,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {578#false} ~cond := #in~cond; {578#false} is VALID [2022-04-08 09:13:08,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {578#false} assume 0 == ~cond; {578#false} is VALID [2022-04-08 09:13:08,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {578#false} assume !false; {578#false} is VALID [2022-04-08 09:13:08,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:13:08,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:13:08,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282330111] [2022-04-08 09:13:08,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282330111] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:13:08,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322124778] [2022-04-08 09:13:08,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:13:08,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:13:08,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:13:08,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:13:08,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 09:13:08,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:13:08,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:13:08,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 09:13:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:13:08,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:13:08,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {577#true} call ULTIMATE.init(); {577#true} is VALID [2022-04-08 09:13:08,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {577#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(12, 2); {577#true} is VALID [2022-04-08 09:13:08,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {577#true} assume true; {577#true} is VALID [2022-04-08 09:13:08,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {577#true} {577#true} #63#return; {577#true} is VALID [2022-04-08 09:13:08,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {577#true} call #t~ret5 := main(); {577#true} is VALID [2022-04-08 09:13:08,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {577#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {603#(<= main_~i~0 0)} is VALID [2022-04-08 09:13:08,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {603#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {603#(<= main_~i~0 0)} is VALID [2022-04-08 09:13:08,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {603#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {583#(<= main_~i~0 1)} is VALID [2022-04-08 09:13:08,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {583#(<= main_~i~0 1)} assume !(~i~0 < 1024); {578#false} is VALID [2022-04-08 09:13:08,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {578#false} ~i~0 := 0; {578#false} is VALID [2022-04-08 09:13:08,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {578#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {578#false} is VALID [2022-04-08 09:13:08,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {578#false} assume !!(0 != #t~mem4);havoc #t~mem4; {578#false} is VALID [2022-04-08 09:13:08,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {578#false} assume !(~i~0 >= 1023); {578#false} is VALID [2022-04-08 09:13:08,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {578#false} is VALID [2022-04-08 09:13:08,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {578#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {578#false} is VALID [2022-04-08 09:13:08,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {578#false} assume !(0 != #t~mem4);havoc #t~mem4; {578#false} is VALID [2022-04-08 09:13:08,175 INFO L272 TraceCheckUtils]: 16: Hoare triple {578#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {578#false} is VALID [2022-04-08 09:13:08,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {578#false} ~cond := #in~cond; {578#false} is VALID [2022-04-08 09:13:08,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {578#false} assume 0 == ~cond; {578#false} is VALID [2022-04-08 09:13:08,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {578#false} assume !false; {578#false} is VALID [2022-04-08 09:13:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:13:08,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:13:08,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {578#false} assume !false; {578#false} is VALID [2022-04-08 09:13:08,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {578#false} assume 0 == ~cond; {578#false} is VALID [2022-04-08 09:13:08,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {578#false} ~cond := #in~cond; {578#false} is VALID [2022-04-08 09:13:08,260 INFO L272 TraceCheckUtils]: 16: Hoare triple {578#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {578#false} is VALID [2022-04-08 09:13:08,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {578#false} assume !(0 != #t~mem4);havoc #t~mem4; {578#false} is VALID [2022-04-08 09:13:08,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {578#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {578#false} is VALID [2022-04-08 09:13:08,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {578#false} is VALID [2022-04-08 09:13:08,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {578#false} assume !(~i~0 >= 1023); {578#false} is VALID [2022-04-08 09:13:08,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {578#false} assume !!(0 != #t~mem4);havoc #t~mem4; {578#false} is VALID [2022-04-08 09:13:08,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {578#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {578#false} is VALID [2022-04-08 09:13:08,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {578#false} ~i~0 := 0; {578#false} is VALID [2022-04-08 09:13:08,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#(< main_~i~0 1024)} assume !(~i~0 < 1024); {578#false} is VALID [2022-04-08 09:13:08,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {683#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {679#(< main_~i~0 1024)} is VALID [2022-04-08 09:13:08,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {683#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {683#(< main_~i~0 1023)} is VALID [2022-04-08 09:13:08,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {577#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {683#(< main_~i~0 1023)} is VALID [2022-04-08 09:13:08,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {577#true} call #t~ret5 := main(); {577#true} is VALID [2022-04-08 09:13:08,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {577#true} {577#true} #63#return; {577#true} is VALID [2022-04-08 09:13:08,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {577#true} assume true; {577#true} is VALID [2022-04-08 09:13:08,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {577#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(12, 2); {577#true} is VALID [2022-04-08 09:13:08,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {577#true} call ULTIMATE.init(); {577#true} is VALID [2022-04-08 09:13:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:13:08,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322124778] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:13:08,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:13:08,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-08 09:13:08,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:13:08,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1511764998] [2022-04-08 09:13:08,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1511764998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:13:08,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:13:08,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:13:08,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162489131] [2022-04-08 09:13:08,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:13:08,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 20 [2022-04-08 09:13:08,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:13:08,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:08,280 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-08 09:13:08,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:13:08,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:13:08,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:13:08,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:13:08,282 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:08,393 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-08 09:13:08,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:13:08,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 20 [2022-04-08 09:13:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:13:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 09:13:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 09:13:08,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 09:13:08,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:08,437 INFO L225 Difference]: With dead ends: 44 [2022-04-08 09:13:08,437 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 09:13:08,438 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:13:08,439 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:13:08,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 27 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:13:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 09:13:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-04-08 09:13:08,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:13:08,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:08,458 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:08,458 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:08,463 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 09:13:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 09:13:08,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:13:08,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:13:08,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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 31 states. [2022-04-08 09:13:08,468 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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 31 states. [2022-04-08 09:13:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:08,471 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 09:13:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 09:13:08,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:13:08,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:13:08,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:13:08,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:13:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-08 09:13:08,474 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2022-04-08 09:13:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:13:08,474 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-08 09:13:08,475 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:08,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2022-04-08 09:13:08,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-08 09:13:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 09:13:08,510 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:13:08,510 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:13:08,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 09:13:08,728 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 09:13:08,728 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:13:08,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:13:08,729 INFO L85 PathProgramCache]: Analyzing trace with hash -746180299, now seen corresponding path program 3 times [2022-04-08 09:13:08,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:13:08,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [405751408] [2022-04-08 09:13:08,739 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:13:08,739 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:13:08,739 INFO L85 PathProgramCache]: Analyzing trace with hash -746180299, now seen corresponding path program 4 times [2022-04-08 09:13:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:13:08,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803907073] [2022-04-08 09:13:08,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:13:08,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:13:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:13:08,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:13:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:13:08,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {926#(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(12, 2); {917#true} is VALID [2022-04-08 09:13:08,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} assume true; {917#true} is VALID [2022-04-08 09:13:08,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {917#true} {917#true} #63#return; {917#true} is VALID [2022-04-08 09:13:08,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} call ULTIMATE.init(); {926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:13:08,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {926#(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(12, 2); {917#true} is VALID [2022-04-08 09:13:08,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} assume true; {917#true} is VALID [2022-04-08 09:13:08,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} #63#return; {917#true} is VALID [2022-04-08 09:13:08,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} call #t~ret5 := main(); {917#true} is VALID [2022-04-08 09:13:08,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {917#true} is VALID [2022-04-08 09:13:08,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {917#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {917#true} is VALID [2022-04-08 09:13:08,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {917#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {917#true} is VALID [2022-04-08 09:13:08,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {917#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {917#true} is VALID [2022-04-08 09:13:08,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {917#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {917#true} is VALID [2022-04-08 09:13:08,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {917#true} assume !(~i~0 < 1024); {917#true} is VALID [2022-04-08 09:13:08,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {917#true} ~i~0 := 0; {922#(= main_~i~0 0)} is VALID [2022-04-08 09:13:08,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {922#(= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {922#(= main_~i~0 0)} is VALID [2022-04-08 09:13:08,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {922#(= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {922#(= main_~i~0 0)} is VALID [2022-04-08 09:13:08,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {922#(= main_~i~0 0)} assume !(~i~0 >= 1023); {922#(= main_~i~0 0)} is VALID [2022-04-08 09:13:08,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {922#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {923#(<= main_~i~0 1)} is VALID [2022-04-08 09:13:08,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {923#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {923#(<= main_~i~0 1)} is VALID [2022-04-08 09:13:08,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {923#(<= main_~i~0 1)} assume !(0 != #t~mem4);havoc #t~mem4; {923#(<= main_~i~0 1)} is VALID [2022-04-08 09:13:08,826 INFO L272 TraceCheckUtils]: 18: Hoare triple {923#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:13:08,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {924#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {925#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:13:08,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {925#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {918#false} is VALID [2022-04-08 09:13:08,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {918#false} assume !false; {918#false} is VALID [2022-04-08 09:13:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 09:13:08,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:13:08,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803907073] [2022-04-08 09:13:08,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803907073] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:13:08,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280756432] [2022-04-08 09:13:08,828 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:13:08,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:13:08,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:13:08,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:13:08,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 09:13:08,881 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:13:08,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:13:08,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 09:13:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:13:08,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:13:08,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} call ULTIMATE.init(); {917#true} is VALID [2022-04-08 09:13:08,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#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(12, 2); {917#true} is VALID [2022-04-08 09:13:08,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} assume true; {917#true} is VALID [2022-04-08 09:13:08,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} #63#return; {917#true} is VALID [2022-04-08 09:13:08,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} call #t~ret5 := main(); {917#true} is VALID [2022-04-08 09:13:08,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {945#(<= main_~i~0 0)} is VALID [2022-04-08 09:13:08,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {945#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {945#(<= main_~i~0 0)} is VALID [2022-04-08 09:13:08,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {945#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {923#(<= main_~i~0 1)} is VALID [2022-04-08 09:13:08,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {923#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {923#(<= main_~i~0 1)} is VALID [2022-04-08 09:13:08,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {923#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {958#(<= main_~i~0 2)} is VALID [2022-04-08 09:13:08,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {958#(<= main_~i~0 2)} assume !(~i~0 < 1024); {918#false} is VALID [2022-04-08 09:13:08,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {918#false} ~i~0 := 0; {918#false} is VALID [2022-04-08 09:13:08,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {918#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {918#false} is VALID [2022-04-08 09:13:08,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {918#false} assume !!(0 != #t~mem4);havoc #t~mem4; {918#false} is VALID [2022-04-08 09:13:08,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {918#false} assume !(~i~0 >= 1023); {918#false} is VALID [2022-04-08 09:13:08,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {918#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {918#false} is VALID [2022-04-08 09:13:08,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {918#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {918#false} is VALID [2022-04-08 09:13:08,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {918#false} assume !(0 != #t~mem4);havoc #t~mem4; {918#false} is VALID [2022-04-08 09:13:08,990 INFO L272 TraceCheckUtils]: 18: Hoare triple {918#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {918#false} is VALID [2022-04-08 09:13:08,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {918#false} ~cond := #in~cond; {918#false} is VALID [2022-04-08 09:13:08,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {918#false} assume 0 == ~cond; {918#false} is VALID [2022-04-08 09:13:08,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {918#false} assume !false; {918#false} is VALID [2022-04-08 09:13:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:13:08,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:13:09,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {918#false} assume !false; {918#false} is VALID [2022-04-08 09:13:09,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {918#false} assume 0 == ~cond; {918#false} is VALID [2022-04-08 09:13:09,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {918#false} ~cond := #in~cond; {918#false} is VALID [2022-04-08 09:13:09,121 INFO L272 TraceCheckUtils]: 18: Hoare triple {918#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {918#false} is VALID [2022-04-08 09:13:09,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {918#false} assume !(0 != #t~mem4);havoc #t~mem4; {918#false} is VALID [2022-04-08 09:13:09,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {918#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {918#false} is VALID [2022-04-08 09:13:09,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {918#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {918#false} is VALID [2022-04-08 09:13:09,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {918#false} assume !(~i~0 >= 1023); {918#false} is VALID [2022-04-08 09:13:09,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {918#false} assume !!(0 != #t~mem4);havoc #t~mem4; {918#false} is VALID [2022-04-08 09:13:09,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {918#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {918#false} is VALID [2022-04-08 09:13:09,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {918#false} ~i~0 := 0; {918#false} is VALID [2022-04-08 09:13:09,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {1028#(< main_~i~0 1024)} assume !(~i~0 < 1024); {918#false} is VALID [2022-04-08 09:13:09,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {1032#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1028#(< main_~i~0 1024)} is VALID [2022-04-08 09:13:09,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {1032#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1032#(< main_~i~0 1023)} is VALID [2022-04-08 09:13:09,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {1039#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1032#(< main_~i~0 1023)} is VALID [2022-04-08 09:13:09,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {1039#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1039#(< main_~i~0 1022)} is VALID [2022-04-08 09:13:09,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1039#(< main_~i~0 1022)} is VALID [2022-04-08 09:13:09,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} call #t~ret5 := main(); {917#true} is VALID [2022-04-08 09:13:09,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} #63#return; {917#true} is VALID [2022-04-08 09:13:09,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} assume true; {917#true} is VALID [2022-04-08 09:13:09,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#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(12, 2); {917#true} is VALID [2022-04-08 09:13:09,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} call ULTIMATE.init(); {917#true} is VALID [2022-04-08 09:13:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:13:09,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280756432] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:13:09,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:13:09,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-04-08 09:13:09,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:13:09,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [405751408] [2022-04-08 09:13:09,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [405751408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:13:09,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:13:09,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:13:09,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22042378] [2022-04-08 09:13:09,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:13:09,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 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 22 [2022-04-08 09:13:09,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:13:09,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:09,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:09,144 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:13:09,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:13:09,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:13:09,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:13:09,144 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:09,311 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-08 09:13:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:13:09,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 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 22 [2022-04-08 09:13:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:13:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-08 09:13:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-08 09:13:09,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2022-04-08 09:13:09,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:09,349 INFO L225 Difference]: With dead ends: 35 [2022-04-08 09:13:09,349 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 09:13:09,349 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:13:09,350 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:13:09,350 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 31 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:13:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 09:13:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-04-08 09:13:09,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:13:09,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:09,362 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:09,362 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:09,363 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 09:13:09,363 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 09:13:09,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:13:09,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:13:09,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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 30 states. [2022-04-08 09:13:09,364 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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 30 states. [2022-04-08 09:13:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:09,365 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 09:13:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 09:13:09,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:13:09,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:13:09,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:13:09,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:13:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-08 09:13:09,367 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2022-04-08 09:13:09,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:13:09,367 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-08 09:13:09,367 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:09,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-08 09:13:09,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-08 09:13:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 09:13:09,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:13:09,393 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:13:09,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 09:13:09,617 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:13:09,618 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:13:09,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:13:09,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1353970500, now seen corresponding path program 5 times [2022-04-08 09:13:09,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:13:09,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1312490836] [2022-04-08 09:13:09,624 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:13:09,624 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:13:09,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1353970500, now seen corresponding path program 6 times [2022-04-08 09:13:09,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:13:09,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367535740] [2022-04-08 09:13:09,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:13:09,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:13:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:13:09,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:13:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:13:09,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {1268#(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(12, 2); {1259#true} is VALID [2022-04-08 09:13:09,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {1259#true} assume true; {1259#true} is VALID [2022-04-08 09:13:09,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1259#true} {1259#true} #63#return; {1259#true} is VALID [2022-04-08 09:13:09,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {1259#true} call ULTIMATE.init(); {1268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:13:09,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {1268#(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(12, 2); {1259#true} is VALID [2022-04-08 09:13:09,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {1259#true} assume true; {1259#true} is VALID [2022-04-08 09:13:09,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1259#true} {1259#true} #63#return; {1259#true} is VALID [2022-04-08 09:13:09,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {1259#true} call #t~ret5 := main(); {1259#true} is VALID [2022-04-08 09:13:09,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {1259#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1259#true} is VALID [2022-04-08 09:13:09,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {1259#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1259#true} is VALID [2022-04-08 09:13:09,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {1259#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1259#true} is VALID [2022-04-08 09:13:09,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {1259#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1259#true} is VALID [2022-04-08 09:13:09,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {1259#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1259#true} is VALID [2022-04-08 09:13:09,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {1259#true} assume !(~i~0 < 1024); {1259#true} is VALID [2022-04-08 09:13:09,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {1259#true} ~i~0 := 0; {1259#true} is VALID [2022-04-08 09:13:09,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {1259#true} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1259#true} is VALID [2022-04-08 09:13:09,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {1259#true} assume !!(0 != #t~mem4);havoc #t~mem4; {1259#true} is VALID [2022-04-08 09:13:09,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {1259#true} assume !(~i~0 >= 1023); {1259#true} is VALID [2022-04-08 09:13:09,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {1259#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1259#true} is VALID [2022-04-08 09:13:09,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {1259#true} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1259#true} is VALID [2022-04-08 09:13:09,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {1259#true} assume !!(0 != #t~mem4);havoc #t~mem4; {1259#true} is VALID [2022-04-08 09:13:09,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {1259#true} assume !(~i~0 >= 1023); {1264#(<= main_~i~0 1022)} is VALID [2022-04-08 09:13:09,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {1264#(<= main_~i~0 1022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1265#(<= main_~i~0 1023)} is VALID [2022-04-08 09:13:09,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {1265#(<= main_~i~0 1023)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {1265#(<= main_~i~0 1023)} is VALID [2022-04-08 09:13:09,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {1265#(<= main_~i~0 1023)} assume !(0 != #t~mem4);havoc #t~mem4; {1265#(<= main_~i~0 1023)} is VALID [2022-04-08 09:13:09,701 INFO L272 TraceCheckUtils]: 22: Hoare triple {1265#(<= main_~i~0 1023)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {1266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:13:09,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {1266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:13:09,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {1267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1260#false} is VALID [2022-04-08 09:13:09,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {1260#false} assume !false; {1260#false} is VALID [2022-04-08 09:13:09,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-08 09:13:09,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:13:09,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367535740] [2022-04-08 09:13:09,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367535740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:13:09,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:13:09,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:13:09,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:13:09,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1312490836] [2022-04-08 09:13:09,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1312490836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:13:09,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:13:09,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:13:09,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134090853] [2022-04-08 09:13:09,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:13:09,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 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 26 [2022-04-08 09:13:09,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:13:09,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:09,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:09,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:13:09,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:13:09,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:13:09,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:13:09,720 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:09,850 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-08 09:13:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:13:09,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 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 26 [2022-04-08 09:13:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:13:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:09,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-08 09:13:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-08 09:13:09,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 26 transitions. [2022-04-08 09:13:09,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:09,873 INFO L225 Difference]: With dead ends: 28 [2022-04-08 09:13:09,873 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:13:09,873 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:13:09,874 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:13:09,874 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 33 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:13:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:13:09,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:13:09,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:13:09,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:13:09,875 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:13:09,875 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:13:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:09,876 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:13:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:13:09,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:13:09,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:13:09,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:13:09,876 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:13:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:13:09,876 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:13:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:13:09,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:13:09,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:13:09,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:13:09,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:13:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:13:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:13:09,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-08 09:13:09,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:13:09,877 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:13:09,877 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:13:09,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:13:09,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:13:09,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:13:09,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:13:09,880 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:13:09,880 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 09:13:09,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:13:10,024 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 09:13:10,024 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 09:13:10,024 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 09:13:10,024 INFO L885 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: true [2022-04-08 09:13:10,024 INFO L878 garLoopResultBuilder]: At program point L29(lines 29 31) the Hoare annotation is: (<= main_~i~0 1023) [2022-04-08 09:13:10,024 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 20 34) the Hoare annotation is: true [2022-04-08 09:13:10,025 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 20 34) the Hoare annotation is: true [2022-04-08 09:13:10,025 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 34) the Hoare annotation is: true [2022-04-08 09:13:10,025 INFO L878 garLoopResultBuilder]: At program point L28-1(lines 28 32) the Hoare annotation is: (<= main_~i~0 1023) [2022-04-08 09:13:10,025 INFO L878 garLoopResultBuilder]: At program point L28-3(lines 28 32) the Hoare annotation is: (<= main_~i~0 1022) [2022-04-08 09:13:10,025 INFO L878 garLoopResultBuilder]: At program point L28-4(lines 28 32) the Hoare annotation is: (<= main_~i~0 1023) [2022-04-08 09:13:10,025 INFO L878 garLoopResultBuilder]: At program point L28-5(lines 28 32) the Hoare annotation is: (<= main_~i~0 1023) [2022-04-08 09:13:10,025 INFO L878 garLoopResultBuilder]: At program point L24-2(lines 24 26) the Hoare annotation is: (<= main_~i~0 1023) [2022-04-08 09:13:10,025 INFO L885 garLoopResultBuilder]: At program point L24-3(lines 24 26) the Hoare annotation is: true [2022-04-08 09:13:10,025 INFO L885 garLoopResultBuilder]: At program point L24-4(lines 24 26) the Hoare annotation is: true [2022-04-08 09:13:10,025 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:13:10,025 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 09:13:10,025 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:13:10,026 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:13:10,026 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:13:10,026 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:13:10,026 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:13:10,026 INFO L878 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:13:10,026 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 09:13:10,026 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-08 09:13:10,026 INFO L885 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: true [2022-04-08 09:13:10,026 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 19) the Hoare annotation is: true [2022-04-08 09:13:10,026 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:13:10,029 INFO L719 BasicCegarLoop]: Path program histogram: [6, 2, 2, 2] [2022-04-08 09:13:10,030 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:13:10,032 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:13:10,032 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:13:10,034 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:13:10,040 INFO L163 areAnnotationChecker]: CFG has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:13:10,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:13:10 BoogieIcfgContainer [2022-04-08 09:13:10,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:13:10,046 INFO L158 Benchmark]: Toolchain (without parser) took 4239.45ms. Allocated memory was 177.2MB in the beginning and 232.8MB in the end (delta: 55.6MB). Free memory was 128.7MB in the beginning and 133.2MB in the end (delta: -4.5MB). Peak memory consumption was 51.7MB. Max. memory is 8.0GB. [2022-04-08 09:13:10,047 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 177.2MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:13:10,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.08ms. Allocated memory is still 177.2MB. Free memory was 128.5MB in the beginning and 153.4MB in the end (delta: -24.8MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-04-08 09:13:10,047 INFO L158 Benchmark]: Boogie Preprocessor took 25.35ms. Allocated memory is still 177.2MB. Free memory was 153.4MB in the beginning and 151.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 09:13:10,047 INFO L158 Benchmark]: RCFGBuilder took 215.11ms. Allocated memory is still 177.2MB. Free memory was 151.9MB in the beginning and 140.8MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 09:13:10,048 INFO L158 Benchmark]: TraceAbstraction took 3788.53ms. Allocated memory was 177.2MB in the beginning and 232.8MB in the end (delta: 55.6MB). Free memory was 140.4MB in the beginning and 133.2MB in the end (delta: 7.2MB). Peak memory consumption was 63.6MB. Max. memory is 8.0GB. [2022-04-08 09:13:10,049 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.20ms. Allocated memory is still 177.2MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.08ms. Allocated memory is still 177.2MB. Free memory was 128.5MB in the beginning and 153.4MB in the end (delta: -24.8MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.35ms. Allocated memory is still 177.2MB. Free memory was 153.4MB in the beginning and 151.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 215.11ms. Allocated memory is still 177.2MB. Free memory was 151.9MB in the beginning and 140.8MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3788.53ms. Allocated memory was 177.2MB in the beginning and 232.8MB in the end (delta: 55.6MB). Free memory was 140.4MB in the beginning and 133.2MB in the end (delta: 7.2MB). Peak memory consumption was 63.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: 16]: 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 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 190 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 95 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 55 PreInvPairs, 88 NumberOfFragments, 63 HoareAnnotationTreeSize, 55 FomulaSimplifications, 42 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 25 FomulaSimplificationsInter, 55 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: 28]: Loop Invariant Derived loop invariant: i <= 1023 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 09:13:10,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...