/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-crafted/simple_array_index_value_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:26:42,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:26:42,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:26:42,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:26:42,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:26:42,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:26:42,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:26:42,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:26:42,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:26:42,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:26:42,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:26:42,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:26:42,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:26:42,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:26:42,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:26:42,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:26:42,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:26:42,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:26:42,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:26:42,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:26:42,265 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:26:42,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:26:42,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:26:42,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:26:42,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:26:42,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:26:42,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:26:42,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:26:42,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:26:42,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:26:42,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:26:42,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:26:42,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:26:42,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:26:42,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:26:42,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:26:42,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:26:42,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:26:42,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:26:42,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:26:42,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:26:42,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:26:42,293 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:26:42,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:26:42,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:26:42,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:26:42,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:26:42,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:26:42,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:26:42,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:26:42,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:26:42,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:26:42,305 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:26:42,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:26:42,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:26:42,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:26:42,306 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:26:42,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:26:42,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:26:42,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:26:42,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:26:42,306 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:26:42,306 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:26:42,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:26:42,306 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:26:42,306 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 09:26:42,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:26:42,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:26:42,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:26:42,531 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:26:42,531 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:26:42,532 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2022-04-28 09:26:42,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9567aa5ae/ae6cd4e6a0d34853b6857694ed1b8a11/FLAG108083c68 [2022-04-28 09:26:42,896 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:26:42,896 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_1-1.i [2022-04-28 09:26:42,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9567aa5ae/ae6cd4e6a0d34853b6857694ed1b8a11/FLAG108083c68 [2022-04-28 09:26:42,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9567aa5ae/ae6cd4e6a0d34853b6857694ed1b8a11 [2022-04-28 09:26:42,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:26:42,911 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:26:42,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:26:42,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:26:42,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:26:42,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:26:42" (1/1) ... [2022-04-28 09:26:42,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74832300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:42, skipping insertion in model container [2022-04-28 09:26:42,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:26:42" (1/1) ... [2022-04-28 09:26:42,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:26:42,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:26:43,062 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-crafted/simple_array_index_value_1-1.i[834,847] [2022-04-28 09:26:43,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:26:43,083 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:26:43,093 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-crafted/simple_array_index_value_1-1.i[834,847] [2022-04-28 09:26:43,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:26:43,105 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:26:43,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:43 WrapperNode [2022-04-28 09:26:43,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:26:43,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:26:43,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:26:43,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:26:43,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:43" (1/1) ... [2022-04-28 09:26:43,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:43" (1/1) ... [2022-04-28 09:26:43,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:43" (1/1) ... [2022-04-28 09:26:43,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:43" (1/1) ... [2022-04-28 09:26:43,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:43" (1/1) ... [2022-04-28 09:26:43,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:43" (1/1) ... [2022-04-28 09:26:43,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:43" (1/1) ... [2022-04-28 09:26:43,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:26:43,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:26:43,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:26:43,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:26:43,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:43" (1/1) ... [2022-04-28 09:26:43,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:26:43,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:43,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 09:26:43,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 09:26:43,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:26:43,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:26:43,184 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:26:43,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:26:43,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:26:43,185 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:26:43,185 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:26:43,185 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:26:43,185 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:26:43,185 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:26:43,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:26:43,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:26:43,186 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:26:43,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 09:26:43,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:26:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:26:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:26:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:26:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:26:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:26:43,262 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:26:43,263 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:26:43,416 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:26:43,421 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:26:43,421 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 09:26:43,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:26:43 BoogieIcfgContainer [2022-04-28 09:26:43,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:26:43,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:26:43,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:26:43,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:26:43,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:26:42" (1/3) ... [2022-04-28 09:26:43,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff5d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:26:43, skipping insertion in model container [2022-04-28 09:26:43,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:43" (2/3) ... [2022-04-28 09:26:43,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff5d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:26:43, skipping insertion in model container [2022-04-28 09:26:43,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:26:43" (3/3) ... [2022-04-28 09:26:43,428 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_1-1.i [2022-04-28 09:26:43,437 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:26:43,438 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:26:43,466 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:26:43,470 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2cee7e55, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d07a87b [2022-04-28 09:26:43,470 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:26:43,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:26:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:26:43,481 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:43,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:43,482 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:43,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:43,486 INFO L85 PathProgramCache]: Analyzing trace with hash 56847072, now seen corresponding path program 1 times [2022-04-28 09:26:43,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:43,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [757296137] [2022-04-28 09:26:43,505 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:26:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash 56847072, now seen corresponding path program 2 times [2022-04-28 09:26:43,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:43,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108059127] [2022-04-28 09:26:43,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:43,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:43,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:43,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(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(31, 2); {30#true} is VALID [2022-04-28 09:26:43,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-28 09:26:43,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #67#return; {30#true} is VALID [2022-04-28 09:26:43,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:43,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(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(31, 2); {30#true} is VALID [2022-04-28 09:26:43,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2022-04-28 09:26:43,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #67#return; {30#true} is VALID [2022-04-28 09:26:43,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID [2022-04-28 09:26:43,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {30#true} is VALID [2022-04-28 09:26:43,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2022-04-28 09:26:43,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} ~index~0 := 0; {31#false} is VALID [2022-04-28 09:26:43,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume !!(~index~0 % 4294967296 < 1000); {31#false} is VALID [2022-04-28 09:26:43,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {31#false} is VALID [2022-04-28 09:26:43,704 INFO L272 TraceCheckUtils]: 10: Hoare triple {31#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {31#false} is VALID [2022-04-28 09:26:43,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2022-04-28 09:26:43,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2022-04-28 09:26:43,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-04-28 09:26:43,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:43,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:43,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108059127] [2022-04-28 09:26:43,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108059127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:43,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:43,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:26:43,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:43,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [757296137] [2022-04-28 09:26:43,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [757296137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:43,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:43,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:26:43,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326048775] [2022-04-28 09:26:43,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:43,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-28 09:26:43,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:43,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-28 09:26:43,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:43,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:26:43,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:43,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:26:43,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:26:43,758 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-28 09:26:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:43,875 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-28 09:26:43,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:26:43,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-28 09:26:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-28 09:26:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-28 09:26:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-28 09:26:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-28 09:26:43,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-28 09:26:43,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:43,980 INFO L225 Difference]: With dead ends: 46 [2022-04-28 09:26:43,980 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 09:26:43,982 INFO L412 NwaCegarLoop]: 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-28 09:26:43,985 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:43,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:26:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 09:26:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 09:26:44,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:44,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:26:44,013 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:26:44,014 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:26:44,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:44,019 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-28 09:26:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-28 09:26:44,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:44,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:44,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-28 09:26:44,021 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-28 09:26:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:44,024 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-28 09:26:44,024 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-28 09:26:44,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:44,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:44,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:44,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:26:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-28 09:26:44,029 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-04-28 09:26:44,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:44,030 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-28 09:26:44,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-28 09:26:44,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 25 transitions. [2022-04-28 09:26:44,080 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-28 09:26:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-28 09:26:44,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:26:44,085 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:44,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:44,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:26:44,086 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:44,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:44,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1810080346, now seen corresponding path program 1 times [2022-04-28 09:26:44,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:44,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1025293716] [2022-04-28 09:26:44,094 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:26:44,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1810080346, now seen corresponding path program 2 times [2022-04-28 09:26:44,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:44,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995057206] [2022-04-28 09:26:44,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:44,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:44,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:44,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#(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(31, 2); {218#true} is VALID [2022-04-28 09:26:44,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-28 09:26:44,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {218#true} {218#true} #67#return; {218#true} is VALID [2022-04-28 09:26:44,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:44,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#(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(31, 2); {218#true} is VALID [2022-04-28 09:26:44,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-28 09:26:44,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} #67#return; {218#true} is VALID [2022-04-28 09:26:44,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} call #t~ret5 := main(); {218#true} is VALID [2022-04-28 09:26:44,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {223#(= main_~index~0 0)} is VALID [2022-04-28 09:26:44,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#(= main_~index~0 0)} assume !(~index~0 % 4294967296 < 1000); {219#false} is VALID [2022-04-28 09:26:44,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {219#false} ~index~0 := 0; {219#false} is VALID [2022-04-28 09:26:44,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#false} assume !!(~index~0 % 4294967296 < 1000); {219#false} is VALID [2022-04-28 09:26:44,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {219#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {219#false} is VALID [2022-04-28 09:26:44,191 INFO L272 TraceCheckUtils]: 10: Hoare triple {219#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {219#false} is VALID [2022-04-28 09:26:44,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {219#false} ~cond := #in~cond; {219#false} is VALID [2022-04-28 09:26:44,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {219#false} assume 0 == ~cond; {219#false} is VALID [2022-04-28 09:26:44,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-04-28 09:26:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:44,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:44,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995057206] [2022-04-28 09:26:44,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995057206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:44,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:44,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:26:44,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:44,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1025293716] [2022-04-28 09:26:44,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1025293716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:44,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:44,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:26:44,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728185631] [2022-04-28 09:26:44,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:44,195 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-28 09:26:44,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:44,195 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-28 09:26:44,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:44,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:26:44,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:44,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:26:44,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:26:44,210 INFO L87 Difference]: Start difference. First operand 22 states and 25 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-28 09:26:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:44,315 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-28 09:26:44,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:26:44,315 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-28 09:26:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:44,316 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-28 09:26:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-28 09:26:44,318 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-28 09:26:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-28 09:26:44,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-28 09:26:44,387 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-28 09:26:44,388 INFO L225 Difference]: With dead ends: 43 [2022-04-28 09:26:44,388 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 09:26:44,389 INFO L412 NwaCegarLoop]: 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-28 09:26:44,389 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:44,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:26:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 09:26:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-28 09:26:44,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:44,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:26:44,395 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:26:44,395 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:26:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:44,396 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 09:26:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 09:26:44,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:44,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:44,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-28 09:26:44,397 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-28 09:26:44,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:44,399 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 09:26:44,399 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 09:26:44,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:44,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:44,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:44,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:26:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-28 09:26:44,411 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-04-28 09:26:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:44,411 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-28 09:26:44,411 INFO L496 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-28 09:26:44,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-28 09:26:44,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:44,466 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 09:26:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 09:26:44,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:44,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:44,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:26:44,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:44,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:44,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1733475192, now seen corresponding path program 1 times [2022-04-28 09:26:44,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:44,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1866539607] [2022-04-28 09:26:44,474 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:26:44,474 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1733475192, now seen corresponding path program 2 times [2022-04-28 09:26:44,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:44,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224692232] [2022-04-28 09:26:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:44,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:44,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:44,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {430#(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(31, 2); {423#true} is VALID [2022-04-28 09:26:44,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-28 09:26:44,564 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-28 09:26:44,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:44,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#(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(31, 2); {423#true} is VALID [2022-04-28 09:26:44,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-28 09:26:44,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-28 09:26:44,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret5 := main(); {423#true} is VALID [2022-04-28 09:26:44,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {428#(= main_~index~0 0)} is VALID [2022-04-28 09:26:44,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {428#(= main_~index~0 0)} is VALID [2022-04-28 09:26:44,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {429#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:26:44,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {429#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 1000); {424#false} is VALID [2022-04-28 09:26:44,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {424#false} ~index~0 := 0; {424#false} is VALID [2022-04-28 09:26:44,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {424#false} assume !!(~index~0 % 4294967296 < 1000); {424#false} is VALID [2022-04-28 09:26:44,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {424#false} is VALID [2022-04-28 09:26:44,568 INFO L272 TraceCheckUtils]: 12: Hoare triple {424#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {424#false} is VALID [2022-04-28 09:26:44,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#false} ~cond := #in~cond; {424#false} is VALID [2022-04-28 09:26:44,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {424#false} assume 0 == ~cond; {424#false} is VALID [2022-04-28 09:26:44,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-28 09:26:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:44,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:44,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224692232] [2022-04-28 09:26:44,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224692232] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:44,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473799956] [2022-04-28 09:26:44,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:26:44,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:44,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:44,575 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:26:44,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 09:26:44,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:26:44,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:26:44,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 09:26:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:44,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:26:44,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-28 09:26:44,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-28 09:26:44,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2022-04-28 09:26:44,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#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(31, 2); {423#true} is VALID [2022-04-28 09:26:44,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-28 09:26:44,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-28 09:26:44,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret5 := main(); {423#true} is VALID [2022-04-28 09:26:44,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {428#(= main_~index~0 0)} is VALID [2022-04-28 09:26:44,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 09:26:44,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 09:26:44,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 1000); {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 09:26:44,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {462#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-28 09:26:44,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {462#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 1000); {462#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-28 09:26:44,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {469#(= |main_#t~mem3| 0)} is VALID [2022-04-28 09:26:44,854 INFO L272 TraceCheckUtils]: 12: Hoare triple {469#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {473#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:26:44,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {473#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {477#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:26:44,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {477#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {424#false} is VALID [2022-04-28 09:26:44,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-28 09:26:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:44,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:26:45,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-04-28 09:26:45,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-04-28 09:26:45,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {424#false} assume !false; {424#false} is VALID [2022-04-28 09:26:45,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {477#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {424#false} is VALID [2022-04-28 09:26:45,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {473#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {477#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:26:45,175 INFO L272 TraceCheckUtils]: 12: Hoare triple {493#(= (mod |main_#t~mem3| 4294967296) 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {473#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:26:45,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {493#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-28 09:26:45,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {497#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} assume !!(~index~0 % 4294967296 < 1000); {497#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-28 09:26:45,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {497#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-28 09:26:45,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 1000); {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-28 09:26:45,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-28 09:26:45,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {514#(= (* (mod main_~index~0 4294967296) 4) 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {504#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-28 09:26:45,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {423#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {514#(= (* (mod main_~index~0 4294967296) 4) 0)} is VALID [2022-04-28 09:26:45,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret5 := main(); {423#true} is VALID [2022-04-28 09:26:45,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #67#return; {423#true} is VALID [2022-04-28 09:26:45,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2022-04-28 09:26:45,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#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(31, 2); {423#true} is VALID [2022-04-28 09:26:45,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2022-04-28 09:26:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:45,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473799956] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:26:45,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:26:45,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 14 [2022-04-28 09:26:45,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:45,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1866539607] [2022-04-28 09:26:45,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1866539607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:45,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:45,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:26:45,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044475057] [2022-04-28 09:26:45,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:45,289 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), 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 16 [2022-04-28 09:26:45,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:45,290 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), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:45,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:45,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:26:45,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:45,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:26:45,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:26:45,306 INFO L87 Difference]: Start difference. First operand 25 states and 28 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), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:45,505 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-28 09:26:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:26:45,505 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), 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 16 [2022-04-28 09:26:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:45,505 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), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 09:26:45,507 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), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 09:26:45,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-28 09:26:45,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:45,552 INFO L225 Difference]: With dead ends: 52 [2022-04-28 09:26:45,552 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 09:26:45,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:26:45,553 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:45,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 29 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:26:45,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 09:26:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2022-04-28 09:26:45,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:45,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:26:45,570 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:26:45,570 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:26:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:45,572 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-28 09:26:45,572 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-28 09:26:45,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:45,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:45,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-04-28 09:26:45,573 INFO L87 Difference]: Start difference. First operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-04-28 09:26:45,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:45,574 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-28 09:26:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-28 09:26:45,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:45,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:45,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:45,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:26:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-28 09:26:45,576 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 16 [2022-04-28 09:26:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:45,576 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-28 09:26:45,576 INFO L496 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), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:45,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-28 09:26:45,606 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-28 09:26:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 09:26:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 09:26:45,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:45,607 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:45,629 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-28 09:26:45,819 WARN L477 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-28 09:26:45,820 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:45,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:45,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1130366230, now seen corresponding path program 3 times [2022-04-28 09:26:45,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:45,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1241512049] [2022-04-28 09:26:45,823 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:26:45,823 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:45,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1130366230, now seen corresponding path program 4 times [2022-04-28 09:26:45,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:45,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500953284] [2022-04-28 09:26:45,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:45,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:45,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:45,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {777#(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(31, 2); {769#true} is VALID [2022-04-28 09:26:45,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-28 09:26:45,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {769#true} {769#true} #67#return; {769#true} is VALID [2022-04-28 09:26:45,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:45,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {777#(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(31, 2); {769#true} is VALID [2022-04-28 09:26:45,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-28 09:26:45,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #67#return; {769#true} is VALID [2022-04-28 09:26:45,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret5 := main(); {769#true} is VALID [2022-04-28 09:26:45,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {774#(= main_~index~0 0)} is VALID [2022-04-28 09:26:45,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {774#(= main_~index~0 0)} is VALID [2022-04-28 09:26:45,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 09:26:45,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 09:26:45,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {776#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:26:45,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {776#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-28 09:26:45,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {770#false} ~index~0 := 0; {770#false} is VALID [2022-04-28 09:26:45,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {770#false} assume !!(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-28 09:26:45,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {770#false} is VALID [2022-04-28 09:26:45,905 INFO L272 TraceCheckUtils]: 14: Hoare triple {770#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {770#false} is VALID [2022-04-28 09:26:45,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#false} ~cond := #in~cond; {770#false} is VALID [2022-04-28 09:26:45,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {770#false} assume 0 == ~cond; {770#false} is VALID [2022-04-28 09:26:45,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-28 09:26:45,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:45,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:45,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500953284] [2022-04-28 09:26:45,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500953284] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:45,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084827418] [2022-04-28 09:26:45,906 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:26:45,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:45,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:45,907 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:26:45,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 09:26:45,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:26:45,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:26:45,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:26:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:45,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:26:46,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {769#true} is VALID [2022-04-28 09:26:46,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#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(31, 2); {769#true} is VALID [2022-04-28 09:26:46,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-28 09:26:46,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #67#return; {769#true} is VALID [2022-04-28 09:26:46,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret5 := main(); {769#true} is VALID [2022-04-28 09:26:46,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {774#(= main_~index~0 0)} is VALID [2022-04-28 09:26:46,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {774#(= main_~index~0 0)} is VALID [2022-04-28 09:26:46,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 09:26:46,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 09:26:46,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {775#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {808#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-28 09:26:46,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {808#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-28 09:26:46,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {770#false} ~index~0 := 0; {770#false} is VALID [2022-04-28 09:26:46,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {770#false} assume !!(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-28 09:26:46,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {770#false} is VALID [2022-04-28 09:26:46,153 INFO L272 TraceCheckUtils]: 14: Hoare triple {770#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {770#false} is VALID [2022-04-28 09:26:46,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#false} ~cond := #in~cond; {770#false} is VALID [2022-04-28 09:26:46,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {770#false} assume 0 == ~cond; {770#false} is VALID [2022-04-28 09:26:46,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-28 09:26:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:46,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:26:46,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-28 09:26:46,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {770#false} assume 0 == ~cond; {770#false} is VALID [2022-04-28 09:26:46,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#false} ~cond := #in~cond; {770#false} is VALID [2022-04-28 09:26:46,243 INFO L272 TraceCheckUtils]: 14: Hoare triple {770#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {770#false} is VALID [2022-04-28 09:26:46,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {770#false} is VALID [2022-04-28 09:26:46,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {770#false} assume !!(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-28 09:26:46,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {770#false} ~index~0 := 0; {770#false} is VALID [2022-04-28 09:26:46,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {854#(< (mod main_~index~0 4294967296) 1000)} assume !(~index~0 % 4294967296 < 1000); {770#false} is VALID [2022-04-28 09:26:46,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {858#(< (mod (+ main_~index~0 1) 4294967296) 1000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {854#(< (mod main_~index~0 4294967296) 1000)} is VALID [2022-04-28 09:26:46,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {858#(< (mod (+ main_~index~0 1) 4294967296) 1000)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {858#(< (mod (+ main_~index~0 1) 4294967296) 1000)} is VALID [2022-04-28 09:26:46,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {865#(< (mod (+ 2 main_~index~0) 4294967296) 1000)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {858#(< (mod (+ main_~index~0 1) 4294967296) 1000)} is VALID [2022-04-28 09:26:46,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {865#(< (mod (+ 2 main_~index~0) 4294967296) 1000)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {865#(< (mod (+ 2 main_~index~0) 4294967296) 1000)} is VALID [2022-04-28 09:26:46,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {865#(< (mod (+ 2 main_~index~0) 4294967296) 1000)} is VALID [2022-04-28 09:26:46,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret5 := main(); {769#true} is VALID [2022-04-28 09:26:46,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #67#return; {769#true} is VALID [2022-04-28 09:26:46,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-28 09:26:46,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#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(31, 2); {769#true} is VALID [2022-04-28 09:26:46,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {769#true} is VALID [2022-04-28 09:26:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:46,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084827418] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:26:46,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:26:46,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 09:26:46,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:46,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1241512049] [2022-04-28 09:26:46,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1241512049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:46,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:46,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:26:46,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260782611] [2022-04-28 09:26:46,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:46,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 18 [2022-04-28 09:26:46,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:46,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-28 09:26:46,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:46,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:26:46,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:46,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:26:46,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:26:46,269 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-28 09:26:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:46,569 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-04-28 09:26:46,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:26:46,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 18 [2022-04-28 09:26:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-28 09:26:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-28 09:26:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-28 09:26:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-28 09:26:46,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-04-28 09:26:46,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:46,628 INFO L225 Difference]: With dead ends: 59 [2022-04-28 09:26:46,628 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 09:26:46,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:26:46,629 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:46,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 29 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:26:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 09:26:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2022-04-28 09:26:46,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:46,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:26:46,654 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:26:46,654 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:26:46,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:46,656 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-04-28 09:26:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-04-28 09:26:46,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:46,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:46,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-04-28 09:26:46,657 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-04-28 09:26:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:46,658 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-04-28 09:26:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-04-28 09:26:46,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:46,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:46,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:46,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:26:46,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-28 09:26:46,660 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 18 [2022-04-28 09:26:46,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:46,661 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-28 09:26:46,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-28 09:26:46,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-28 09:26:46,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-28 09:26:46,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 09:26:46,697 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:46,697 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:46,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 09:26:46,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 09:26:46,911 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:46,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:46,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1363238708, now seen corresponding path program 5 times [2022-04-28 09:26:46,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:46,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [174156257] [2022-04-28 09:26:46,915 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:26:46,915 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:46,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1363238708, now seen corresponding path program 6 times [2022-04-28 09:26:46,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:46,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114581213] [2022-04-28 09:26:46,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:46,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:46,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:46,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {1176#(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(31, 2); {1167#true} is VALID [2022-04-28 09:26:46,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-28 09:26:46,994 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1167#true} {1167#true} #67#return; {1167#true} is VALID [2022-04-28 09:26:46,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {1167#true} call ULTIMATE.init(); {1176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:46,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {1176#(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(31, 2); {1167#true} is VALID [2022-04-28 09:26:46,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-28 09:26:46,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} #67#return; {1167#true} is VALID [2022-04-28 09:26:46,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {1167#true} call #t~ret5 := main(); {1167#true} is VALID [2022-04-28 09:26:46,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {1167#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1172#(= main_~index~0 0)} is VALID [2022-04-28 09:26:46,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {1172#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1172#(= main_~index~0 0)} is VALID [2022-04-28 09:26:46,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {1172#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1173#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 09:26:46,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {1173#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1173#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 09:26:46,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {1173#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1174#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-28 09:26:46,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {1174#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1174#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-28 09:26:46,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {1174#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1175#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:26:46,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {1175#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 1000); {1168#false} is VALID [2022-04-28 09:26:46,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {1168#false} ~index~0 := 0; {1168#false} is VALID [2022-04-28 09:26:46,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {1168#false} assume !!(~index~0 % 4294967296 < 1000); {1168#false} is VALID [2022-04-28 09:26:46,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {1168#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1168#false} is VALID [2022-04-28 09:26:46,999 INFO L272 TraceCheckUtils]: 16: Hoare triple {1168#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1168#false} is VALID [2022-04-28 09:26:46,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {1168#false} ~cond := #in~cond; {1168#false} is VALID [2022-04-28 09:26:46,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {1168#false} assume 0 == ~cond; {1168#false} is VALID [2022-04-28 09:26:46,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {1168#false} assume !false; {1168#false} is VALID [2022-04-28 09:26:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:46,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:46,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114581213] [2022-04-28 09:26:46,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114581213] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:46,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939494498] [2022-04-28 09:26:47,000 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:26:47,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:47,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:47,001 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-28 09:26:47,002 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-28 09:26:47,053 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 09:26:47,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:26:47,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 09:26:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:47,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:26:47,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-04-28 09:26:47,148 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-28 09:26:47,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-04-28 09:26:47,196 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-28 09:26:47,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-28 09:26:47,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-28 09:26:47,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {1167#true} call ULTIMATE.init(); {1167#true} is VALID [2022-04-28 09:26:47,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {1167#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(31, 2); {1167#true} is VALID [2022-04-28 09:26:47,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-28 09:26:47,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} #67#return; {1167#true} is VALID [2022-04-28 09:26:47,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {1167#true} call #t~ret5 := main(); {1167#true} is VALID [2022-04-28 09:26:47,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {1167#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1172#(= main_~index~0 0)} is VALID [2022-04-28 09:26:47,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {1172#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1198#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-28 09:26:47,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {1198#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1202#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-28 09:26:47,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {1202#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1202#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-28 09:26:47,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {1202#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1209#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 09:26:47,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {1209#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 09:26:47,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 09:26:47,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 1000); {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 09:26:47,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {1213#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {1198#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-28 09:26:47,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {1198#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume !!(~index~0 % 4294967296 < 1000); {1198#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-28 09:26:47,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {1198#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1229#(= |main_#t~mem3| 0)} is VALID [2022-04-28 09:26:47,310 INFO L272 TraceCheckUtils]: 16: Hoare triple {1229#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:26:47,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:26:47,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {1237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1168#false} is VALID [2022-04-28 09:26:47,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {1168#false} assume !false; {1168#false} is VALID [2022-04-28 09:26:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:47,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:26:47,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-04-28 09:26:47,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 218 [2022-04-28 09:26:48,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {1168#false} assume !false; {1168#false} is VALID [2022-04-28 09:26:48,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {1237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1168#false} is VALID [2022-04-28 09:26:48,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:26:48,069 INFO L272 TraceCheckUtils]: 16: Hoare triple {1253#(= (mod |main_#t~mem3| 4294967296) 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:26:48,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {1257#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1253#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-28 09:26:48,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {1257#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} assume !!(~index~0 % 4294967296 < 1000); {1257#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-28 09:26:48,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {1257#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-28 09:26:48,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 1000); {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-28 09:26:48,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-28 09:26:48,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {1274#(forall ((v_ArrVal_48 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1264#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-28 09:26:48,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {1278#(forall ((v_ArrVal_48 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1274#(forall ((v_ArrVal_48 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:26:48,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {1282#(forall ((v_ArrVal_48 Int) (v_ArrVal_45 Int)) (= 0 (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_45) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_48) |main_~#array~0.offset|) 4294967296)))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1278#(forall ((v_ArrVal_48 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:26:48,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {1286#(forall ((v_ArrVal_48 Int) (v_ArrVal_45 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_45) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1282#(forall ((v_ArrVal_48 Int) (v_ArrVal_45 Int)) (= 0 (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_45) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_48) |main_~#array~0.offset|) 4294967296)))} is VALID [2022-04-28 09:26:48,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {1290#(forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1286#(forall ((v_ArrVal_48 Int) (v_ArrVal_45 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_45) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_48) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:26:48,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {1167#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1290#(forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|))} is VALID [2022-04-28 09:26:48,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {1167#true} call #t~ret5 := main(); {1167#true} is VALID [2022-04-28 09:26:48,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1167#true} {1167#true} #67#return; {1167#true} is VALID [2022-04-28 09:26:48,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {1167#true} assume true; {1167#true} is VALID [2022-04-28 09:26:48,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {1167#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(31, 2); {1167#true} is VALID [2022-04-28 09:26:48,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {1167#true} call ULTIMATE.init(); {1167#true} is VALID [2022-04-28 09:26:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:48,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939494498] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:26:48,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:26:48,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 12] total 22 [2022-04-28 09:26:48,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:48,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [174156257] [2022-04-28 09:26:48,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [174156257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:48,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:48,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:26:48,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602067218] [2022-04-28 09:26:48,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:48,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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 20 [2022-04-28 09:26:48,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:48,085 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), 6 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-28 09:26:48,101 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-28 09:26:48,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:26:48,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:48,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:26:48,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-04-28 09:26:48,102 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-28 09:26:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:48,535 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-28 09:26:48,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:26:48,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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 20 [2022-04-28 09:26:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:48,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-28 09:26:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-28 09:26:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-28 09:26:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-28 09:26:48,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-28 09:26:48,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:48,610 INFO L225 Difference]: With dead ends: 73 [2022-04-28 09:26:48,610 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 09:26:48,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2022-04-28 09:26:48,611 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 55 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:48,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 36 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:26:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 09:26:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2022-04-28 09:26:48,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:48,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:26:48,662 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:26:48,662 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:26:48,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:48,664 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-28 09:26:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-28 09:26:48,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:48,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:48,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 52 states. [2022-04-28 09:26:48,665 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 52 states. [2022-04-28 09:26:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:48,667 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-28 09:26:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-28 09:26:48,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:48,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:48,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:48,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:26:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-28 09:26:48,669 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 20 [2022-04-28 09:26:48,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:48,669 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-28 09:26:48,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-28 09:26:48,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 46 transitions. [2022-04-28 09:26:48,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:48,714 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-28 09:26:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 09:26:48,715 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:48,715 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:48,747 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-28 09:26:48,931 WARN L477 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-28 09:26:48,931 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:48,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1815390674, now seen corresponding path program 7 times [2022-04-28 09:26:48,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:48,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1344835251] [2022-04-28 09:26:48,934 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:26:48,934 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:48,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1815390674, now seen corresponding path program 8 times [2022-04-28 09:26:48,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:48,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142091166] [2022-04-28 09:26:48,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:48,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:49,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:49,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {1661#(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(31, 2); {1651#true} is VALID [2022-04-28 09:26:49,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#true} assume true; {1651#true} is VALID [2022-04-28 09:26:49,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1651#true} {1651#true} #67#return; {1651#true} is VALID [2022-04-28 09:26:49,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {1651#true} call ULTIMATE.init(); {1661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:49,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {1661#(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(31, 2); {1651#true} is VALID [2022-04-28 09:26:49,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {1651#true} assume true; {1651#true} is VALID [2022-04-28 09:26:49,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1651#true} {1651#true} #67#return; {1651#true} is VALID [2022-04-28 09:26:49,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {1651#true} call #t~ret5 := main(); {1651#true} is VALID [2022-04-28 09:26:49,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {1651#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1656#(= main_~index~0 0)} is VALID [2022-04-28 09:26:49,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {1656#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1656#(= main_~index~0 0)} is VALID [2022-04-28 09:26:49,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {1656#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1657#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 09:26:49,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {1657#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1657#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 09:26:49,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {1657#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1658#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-28 09:26:49,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {1658#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1658#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-28 09:26:49,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {1658#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1659#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-28 09:26:49,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {1659#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1659#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-28 09:26:49,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {1659#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1660#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} is VALID [2022-04-28 09:26:49,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {1660#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} assume !(~index~0 % 4294967296 < 1000); {1652#false} is VALID [2022-04-28 09:26:49,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {1652#false} ~index~0 := 0; {1652#false} is VALID [2022-04-28 09:26:49,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {1652#false} assume !!(~index~0 % 4294967296 < 1000); {1652#false} is VALID [2022-04-28 09:26:49,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {1652#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1652#false} is VALID [2022-04-28 09:26:49,035 INFO L272 TraceCheckUtils]: 18: Hoare triple {1652#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1652#false} is VALID [2022-04-28 09:26:49,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {1652#false} ~cond := #in~cond; {1652#false} is VALID [2022-04-28 09:26:49,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {1652#false} assume 0 == ~cond; {1652#false} is VALID [2022-04-28 09:26:49,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {1652#false} assume !false; {1652#false} is VALID [2022-04-28 09:26:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:49,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:49,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142091166] [2022-04-28 09:26:49,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142091166] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:49,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234830743] [2022-04-28 09:26:49,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:26:49,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:49,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:49,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:26:49,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 09:26:49,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:26:49,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:26:49,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 09:26:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:49,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:26:49,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-04-28 09:26:49,176 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-28 09:26:49,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-04-28 09:26:49,213 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-28 09:26:49,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-28 09:26:49,256 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-28 09:26:49,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-28 09:26:49,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-28 09:26:49,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {1651#true} call ULTIMATE.init(); {1651#true} is VALID [2022-04-28 09:26:49,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#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(31, 2); {1651#true} is VALID [2022-04-28 09:26:49,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {1651#true} assume true; {1651#true} is VALID [2022-04-28 09:26:49,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1651#true} {1651#true} #67#return; {1651#true} is VALID [2022-04-28 09:26:49,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {1651#true} call #t~ret5 := main(); {1651#true} is VALID [2022-04-28 09:26:49,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {1651#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1656#(= main_~index~0 0)} is VALID [2022-04-28 09:26:49,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {1656#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1683#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-28 09:26:49,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {1683#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1687#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-28 09:26:49,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {1687#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1687#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-28 09:26:49,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {1687#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1694#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 09:26:49,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {1694#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1694#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 09:26:49,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {1694#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1701#(and (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 09:26:49,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {1701#(and (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 09:26:49,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 09:26:49,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 1000); {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 09:26:49,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {1705#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {1683#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-28 09:26:49,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {1683#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume !!(~index~0 % 4294967296 < 1000); {1683#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-28 09:26:49,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {1683#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1721#(= |main_#t~mem3| 0)} is VALID [2022-04-28 09:26:49,364 INFO L272 TraceCheckUtils]: 18: Hoare triple {1721#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1725#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:26:49,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {1725#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1729#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:26:49,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {1729#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1652#false} is VALID [2022-04-28 09:26:49,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {1652#false} assume !false; {1652#false} is VALID [2022-04-28 09:26:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:49,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:26:50,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2022-04-28 09:26:50,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3830 treesize of output 3814 [2022-04-28 09:26:58,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {1652#false} assume !false; {1652#false} is VALID [2022-04-28 09:26:58,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {1729#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1652#false} is VALID [2022-04-28 09:26:58,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {1725#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1729#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:26:58,313 INFO L272 TraceCheckUtils]: 18: Hoare triple {1745#(= (mod |main_#t~mem3| 4294967296) 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {1725#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:26:58,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {1749#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1745#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-28 09:26:58,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {1753#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000); {1749#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-28 09:26:58,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {1753#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-28 09:26:58,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 1000); {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-28 09:26:58,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-28 09:26:58,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {1767#(forall ((v_ArrVal_76 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1757#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-28 09:26:58,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {1771#(forall ((v_ArrVal_76 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1767#(forall ((v_ArrVal_76 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:26:58,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {1775#(forall ((v_ArrVal_76 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_74) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1771#(forall ((v_ArrVal_76 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:26:58,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {1779#(forall ((v_ArrVal_76 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_74) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1775#(forall ((v_ArrVal_76 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_74) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:26:58,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {1783#(forall ((v_ArrVal_76 Int) (v_ArrVal_72 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_72) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_74) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1779#(forall ((v_ArrVal_76 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_74) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:26:58,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#(forall ((v_ArrVal_76 Int) (v_ArrVal_72 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_72) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_74) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {1783#(forall ((v_ArrVal_76 Int) (v_ArrVal_72 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_72) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_74) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:26:58,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {1791#(or (= (* (mod main_~index~0 4294967296) 4) 0) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {1787#(forall ((v_ArrVal_76 Int) (v_ArrVal_72 Int) (v_ArrVal_74 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_72) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_74) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_76) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:26:58,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {1651#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {1791#(or (= (* (mod main_~index~0 4294967296) 4) 0) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-28 09:26:58,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {1651#true} call #t~ret5 := main(); {1651#true} is VALID [2022-04-28 09:26:58,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1651#true} {1651#true} #67#return; {1651#true} is VALID [2022-04-28 09:26:58,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {1651#true} assume true; {1651#true} is VALID [2022-04-28 09:26:58,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#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(31, 2); {1651#true} is VALID [2022-04-28 09:26:58,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {1651#true} call ULTIMATE.init(); {1651#true} is VALID [2022-04-28 09:26:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:58,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234830743] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:26:58,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:26:58,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 15] total 27 [2022-04-28 09:26:58,372 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:58,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1344835251] [2022-04-28 09:26:58,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1344835251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:58,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:58,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:26:58,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381260986] [2022-04-28 09:26:58,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:58,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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 22 [2022-04-28 09:26:58,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:58,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-28 09:26:58,388 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-28 09:26:58,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:26:58,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:58,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:26:58,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2022-04-28 09:26:58,389 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-28 09:26:58,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:58,931 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2022-04-28 09:26:58,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:26:58,931 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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 22 [2022-04-28 09:26:58,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-28 09:26:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-04-28 09:26:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-28 09:26:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-04-28 09:26:58,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 87 transitions. [2022-04-28 09:26:59,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:59,002 INFO L225 Difference]: With dead ends: 85 [2022-04-28 09:26:59,002 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 09:26:59,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2022-04-28 09:26:59,004 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 63 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:59,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 43 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:26:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 09:26:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2022-04-28 09:26:59,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:59,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 09:26:59,071 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 09:26:59,072 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 09:26:59,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:59,073 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-28 09:26:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-28 09:26:59,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:59,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:59,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 59 states. [2022-04-28 09:26:59,074 INFO L87 Difference]: Start difference. First operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 59 states. [2022-04-28 09:26:59,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:59,076 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-28 09:26:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-28 09:26:59,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:59,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:59,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:59,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:59,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 09:26:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-04-28 09:26:59,078 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 22 [2022-04-28 09:26:59,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:59,078 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-04-28 09:26:59,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-28 09:26:59,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 54 transitions. [2022-04-28 09:26:59,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-28 09:26:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 09:26:59,135 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:59,135 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:59,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 09:26:59,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:59,336 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:59,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1753234192, now seen corresponding path program 9 times [2022-04-28 09:26:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:59,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [818898826] [2022-04-28 09:26:59,341 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:26:59,341 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:59,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1753234192, now seen corresponding path program 10 times [2022-04-28 09:26:59,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:59,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666933002] [2022-04-28 09:26:59,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:59,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:59,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:59,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {2217#(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(31, 2); {2206#true} is VALID [2022-04-28 09:26:59,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {2206#true} assume true; {2206#true} is VALID [2022-04-28 09:26:59,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2206#true} {2206#true} #67#return; {2206#true} is VALID [2022-04-28 09:26:59,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:59,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {2217#(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(31, 2); {2206#true} is VALID [2022-04-28 09:26:59,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2022-04-28 09:26:59,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #67#return; {2206#true} is VALID [2022-04-28 09:26:59,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret5 := main(); {2206#true} is VALID [2022-04-28 09:26:59,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {2211#(= main_~index~0 0)} is VALID [2022-04-28 09:26:59,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {2211#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2211#(= main_~index~0 0)} is VALID [2022-04-28 09:26:59,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {2211#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2212#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 09:26:59,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {2212#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2212#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 09:26:59,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {2212#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2213#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-28 09:26:59,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {2213#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2213#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-28 09:26:59,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {2213#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2214#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-28 09:26:59,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {2214#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2214#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-28 09:26:59,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {2214#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2215#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-28 09:26:59,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {2215#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2215#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-28 09:26:59,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {2215#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2216#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 5))} is VALID [2022-04-28 09:26:59,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {2216#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 5))} assume !(~index~0 % 4294967296 < 1000); {2207#false} is VALID [2022-04-28 09:26:59,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {2207#false} ~index~0 := 0; {2207#false} is VALID [2022-04-28 09:26:59,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {2207#false} assume !!(~index~0 % 4294967296 < 1000); {2207#false} is VALID [2022-04-28 09:26:59,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {2207#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2207#false} is VALID [2022-04-28 09:26:59,471 INFO L272 TraceCheckUtils]: 20: Hoare triple {2207#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {2207#false} is VALID [2022-04-28 09:26:59,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {2207#false} ~cond := #in~cond; {2207#false} is VALID [2022-04-28 09:26:59,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {2207#false} assume 0 == ~cond; {2207#false} is VALID [2022-04-28 09:26:59,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2022-04-28 09:26:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:59,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:59,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666933002] [2022-04-28 09:26:59,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666933002] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:59,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71408962] [2022-04-28 09:26:59,472 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:26:59,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:59,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:59,484 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:26:59,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 09:26:59,550 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:26:59,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:26:59,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 09:26:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:59,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:26:59,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-04-28 09:26:59,643 INFO L356 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2022-04-28 09:26:59,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-04-28 09:26:59,679 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-28 09:26:59,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-28 09:26:59,714 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-28 09:26:59,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-28 09:26:59,762 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-28 09:26:59,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-28 09:26:59,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-28 09:26:59,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2022-04-28 09:26:59,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {2206#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(31, 2); {2206#true} is VALID [2022-04-28 09:26:59,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2022-04-28 09:26:59,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #67#return; {2206#true} is VALID [2022-04-28 09:26:59,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret5 := main(); {2206#true} is VALID [2022-04-28 09:26:59,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {2211#(= main_~index~0 0)} is VALID [2022-04-28 09:26:59,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {2211#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2239#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-28 09:26:59,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {2239#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2243#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-28 09:26:59,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {2243#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2243#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-28 09:26:59,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {2243#(and (= (mod (+ main_~index~0 1) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2250#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 09:26:59,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {2250#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2250#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 09:26:59,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {2250#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2257#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} is VALID [2022-04-28 09:26:59,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {2257#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2257#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} is VALID [2022-04-28 09:26:59,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {2257#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= 3 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2264#(and (= 3 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 09:26:59,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {2264#(and (= 3 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 09:26:59,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 09:26:59,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 1000); {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 09:26:59,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {2268#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {2239#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-28 09:26:59,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {2239#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume !!(~index~0 % 4294967296 < 1000); {2239#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-28 09:26:59,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {2239#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2284#(= |main_#t~mem3| 0)} is VALID [2022-04-28 09:26:59,888 INFO L272 TraceCheckUtils]: 20: Hoare triple {2284#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {2288#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:26:59,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {2288#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2292#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:26:59,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {2292#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2207#false} is VALID [2022-04-28 09:26:59,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2022-04-28 09:26:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:59,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:27:01,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2022-04-28 09:27:01,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15622 treesize of output 15590 [2022-04-28 09:28:17,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2022-04-28 09:28:17,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {2292#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2207#false} is VALID [2022-04-28 09:28:17,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {2288#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2292#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:28:17,295 INFO L272 TraceCheckUtils]: 20: Hoare triple {2308#(= (mod |main_#t~mem3| 4294967296) 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {2288#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:28:17,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {2312#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2308#(= (mod |main_#t~mem3| 4294967296) 0)} is VALID [2022-04-28 09:28:17,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {2316#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} assume !!(~index~0 % 4294967296 < 1000); {2312#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)))} is VALID [2022-04-28 09:28:17,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {2320#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {2316#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296) 0) (not (<= (mod main_~index~0 2) 0)) (not (< (mod main_~index~0 4294967296) 1000)))} is VALID [2022-04-28 09:28:17,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {2320#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 1000); {2320#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-28 09:28:17,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {2320#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2320#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-28 09:28:17,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {2330#(forall ((v_ArrVal_109 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2320#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-28 09:28:17,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {2334#(forall ((v_ArrVal_109 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2330#(forall ((v_ArrVal_109 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:28:17,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {2338#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_108) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2334#(forall ((v_ArrVal_109 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:28:17,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {2342#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_108) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2338#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_108) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:28:17,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {2346#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_106) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_108) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2342#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_108) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:28:17,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {2350#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_106) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_108) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2346#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_106) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_108) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:28:17,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {2354#(forall ((v_ArrVal_104 Int) (v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_104) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_106) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_108) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2350#(forall ((v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_106) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_108) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:28:17,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {2358#(forall ((v_ArrVal_104 Int) (v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_104) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_106) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_108) (+ |main_~#array~0.offset| (* (mod (+ main_~index~0 4) 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2354#(forall ((v_ArrVal_104 Int) (v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_104) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_106) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_108) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:28:17,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {2362#(= (* (mod main_~index~0 4294967296) 4) 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2358#(forall ((v_ArrVal_104 Int) (v_ArrVal_109 Int) (v_ArrVal_108 Int) (v_ArrVal_106 Int)) (= (mod (select (store (store (store (store (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_104) (+ |main_~#array~0.offset| (* (mod (+ 2 main_~index~0) 4294967296) 4)) v_ArrVal_106) (+ (* 4 (mod (+ 3 main_~index~0) 4294967296)) |main_~#array~0.offset|) v_ArrVal_108) (+ |main_~#array~0.offset| (* (mod (+ main_~index~0 4) 4294967296) 4)) v_ArrVal_109) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-28 09:28:17,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {2362#(= (* (mod main_~index~0 4294967296) 4) 0)} is VALID [2022-04-28 09:28:17,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret5 := main(); {2206#true} is VALID [2022-04-28 09:28:17,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #67#return; {2206#true} is VALID [2022-04-28 09:28:17,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2022-04-28 09:28:17,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {2206#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(31, 2); {2206#true} is VALID [2022-04-28 09:28:17,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2022-04-28 09:28:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:28:17,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71408962] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:28:17,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:28:17,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 17] total 31 [2022-04-28 09:28:17,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:28:17,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [818898826] [2022-04-28 09:28:17,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [818898826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:28:17,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:28:17,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:28:17,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047755353] [2022-04-28 09:28:17,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:28:17,357 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 24 [2022-04-28 09:28:17,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:28:17,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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-28 09:28:17,373 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-28 09:28:17,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:28:17,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:28:17,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:28:17,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2022-04-28 09:28:17,374 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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-28 09:28:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:28:18,019 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2022-04-28 09:28:18,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:28:18,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 24 [2022-04-28 09:28:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:28:18,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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-28 09:28:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 09:28:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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-28 09:28:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 09:28:18,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-28 09:28:18,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:28:18,101 INFO L225 Difference]: With dead ends: 97 [2022-04-28 09:28:18,101 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 09:28:18,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 09:28:18,102 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 83 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:28:18,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 30 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:28:18,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 09:28:18,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-04-28 09:28:18,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:28:18,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 55 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:28:18,187 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 55 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:28:18,188 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 55 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:28:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:28:18,194 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-28 09:28:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-28 09:28:18,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:28:18,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:28:18,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 66 states. [2022-04-28 09:28:18,195 INFO L87 Difference]: Start difference. First operand has 55 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 66 states. [2022-04-28 09:28:18,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:28:18,197 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-28 09:28:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-28 09:28:18,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:28:18,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:28:18,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:28:18,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:28:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:28:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-04-28 09:28:18,199 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 24 [2022-04-28 09:28:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:28:18,199 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-04-28 09:28:18,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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-28 09:28:18,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 62 transitions. [2022-04-28 09:28:18,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:28:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-04-28 09:28:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 09:28:18,267 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:28:18,267 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:28:18,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 09:28:18,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:28:18,468 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:28:18,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:28:18,468 INFO L85 PathProgramCache]: Analyzing trace with hash -477139086, now seen corresponding path program 11 times [2022-04-28 09:28:18,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:28:18,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1675603505] [2022-04-28 09:28:18,470 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:28:18,470 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:28:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash -477139086, now seen corresponding path program 12 times [2022-04-28 09:28:18,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:28:18,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518102195] [2022-04-28 09:28:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:28:18,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:28:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:28:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:28:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:28:18,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {2843#(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(31, 2); {2831#true} is VALID [2022-04-28 09:28:18,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {2831#true} assume true; {2831#true} is VALID [2022-04-28 09:28:18,606 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2831#true} {2831#true} #67#return; {2831#true} is VALID [2022-04-28 09:28:18,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {2831#true} call ULTIMATE.init(); {2843#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:28:18,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {2843#(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(31, 2); {2831#true} is VALID [2022-04-28 09:28:18,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {2831#true} assume true; {2831#true} is VALID [2022-04-28 09:28:18,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2831#true} {2831#true} #67#return; {2831#true} is VALID [2022-04-28 09:28:18,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {2831#true} call #t~ret5 := main(); {2831#true} is VALID [2022-04-28 09:28:18,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {2831#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {2836#(= main_~index~0 0)} is VALID [2022-04-28 09:28:18,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {2836#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2836#(= main_~index~0 0)} is VALID [2022-04-28 09:28:18,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {2836#(= main_~index~0 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2837#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 09:28:18,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {2837#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2837#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-28 09:28:18,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {2837#(and (<= main_~index~0 1) (<= 1 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2838#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-28 09:28:18,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {2838#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2838#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-28 09:28:18,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {2838#(and (<= main_~index~0 2) (<= 2 main_~index~0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2839#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-28 09:28:18,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {2839#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2839#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-28 09:28:18,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {2839#(and (<= 3 main_~index~0) (<= main_~index~0 3))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2840#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-28 09:28:18,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {2840#(and (<= 4 main_~index~0) (<= main_~index~0 4))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2840#(and (<= 4 main_~index~0) (<= main_~index~0 4))} is VALID [2022-04-28 09:28:18,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {2840#(and (<= 4 main_~index~0) (<= main_~index~0 4))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2841#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-28 09:28:18,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {2841#(and (<= 5 main_~index~0) (<= main_~index~0 5))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2841#(and (<= 5 main_~index~0) (<= main_~index~0 5))} is VALID [2022-04-28 09:28:18,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {2841#(and (<= 5 main_~index~0) (<= main_~index~0 5))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2842#(and (<= main_~index~0 6) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:28:18,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {2842#(and (<= main_~index~0 6) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 1000); {2832#false} is VALID [2022-04-28 09:28:18,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {2832#false} ~index~0 := 0; {2832#false} is VALID [2022-04-28 09:28:18,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {2832#false} assume !!(~index~0 % 4294967296 < 1000); {2832#false} is VALID [2022-04-28 09:28:18,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {2832#false} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2832#false} is VALID [2022-04-28 09:28:18,621 INFO L272 TraceCheckUtils]: 22: Hoare triple {2832#false} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {2832#false} is VALID [2022-04-28 09:28:18,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {2832#false} ~cond := #in~cond; {2832#false} is VALID [2022-04-28 09:28:18,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {2832#false} assume 0 == ~cond; {2832#false} is VALID [2022-04-28 09:28:18,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {2832#false} assume !false; {2832#false} is VALID [2022-04-28 09:28:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:28:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:28:18,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518102195] [2022-04-28 09:28:18,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518102195] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:28:18,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828969016] [2022-04-28 09:28:18,622 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:28:18,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:28:18,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:28:18,623 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:28:18,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 09:28:18,793 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 09:28:18,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:28:18,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 09:28:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:28:18,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:28:18,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-04-28 09:28:18,872 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-28 09:28:18,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-28 09:28:18,912 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-28 09:28:18,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-28 09:28:18,947 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-04-28 09:28:18,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-28 09:28:18,989 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-28 09:28:18,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-28 09:28:19,017 INFO L356 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-04-28 09:28:19,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2022-04-28 09:28:19,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-28 09:28:19,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {2831#true} call ULTIMATE.init(); {2831#true} is VALID [2022-04-28 09:28:19,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {2831#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(31, 2); {2831#true} is VALID [2022-04-28 09:28:19,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {2831#true} assume true; {2831#true} is VALID [2022-04-28 09:28:19,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2831#true} {2831#true} #67#return; {2831#true} is VALID [2022-04-28 09:28:19,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {2831#true} call #t~ret5 := main(); {2831#true} is VALID [2022-04-28 09:28:19,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {2831#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(4000);havoc ~index~0;~index~0 := 0; {2836#(= main_~index~0 0)} is VALID [2022-04-28 09:28:19,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {2836#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2865#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-28 09:28:19,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {2865#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2869#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} is VALID [2022-04-28 09:28:19,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {2869#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2869#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} is VALID [2022-04-28 09:28:19,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {2869#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 1))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2876#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 09:28:19,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {2876#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2876#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 09:28:19,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {2876#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2883#(and (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 09:28:19,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {2883#(and (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2883#(and (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 09:28:19,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {2883#(and (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2890#(and (= main_~index~0 4) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 09:28:19,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {2890#(and (= main_~index~0 4) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2894#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 09:28:19,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {2894#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2894#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 09:28:19,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {2894#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !!(~index~0 % 4294967296 < 1000);call write~int((if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2), ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2901#(or (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (* (mod main_~index~0 4294967296) 4) 0))} is VALID [2022-04-28 09:28:19,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {2901#(or (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= (* (mod main_~index~0 4294967296) 4) 0))} #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; {2905#(or (= (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-28 09:28:19,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {2905#(or (= (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) 0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !(~index~0 % 4294967296 < 1000); {2894#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-28 09:28:19,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {2894#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {2865#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-28 09:28:19,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {2865#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume !!(~index~0 % 4294967296 < 1000); {2865#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} is VALID [2022-04-28 09:28:19,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {2865#(and (= main_~index~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) (mod main_~index~0 2)))} assume 0 == (if ~index~0 % 4294967296 < 0 && 0 != ~index~0 % 4294967296 % 2 then ~index~0 % 4294967296 % 2 - 2 else ~index~0 % 4294967296 % 2) % 4294967296;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4); {2918#(= |main_#t~mem3| 0)} is VALID [2022-04-28 09:28:19,220 INFO L272 TraceCheckUtils]: 22: Hoare triple {2918#(= |main_#t~mem3| 0)} call __VERIFIER_assert((if 0 == #t~mem3 % 4294967296 then 1 else 0)); {2922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:28:19,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {2922#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:28:19,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {2926#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2832#false} is VALID [2022-04-28 09:28:19,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {2832#false} assume !false; {2832#false} is VALID [2022-04-28 09:28:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:28:19,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:28:20,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_main_~index~0_36 Int) (v_ArrVal_149 Int)) (or (< aux_mod_main_~index~0_36 1000) (<= 4294967296 aux_mod_main_~index~0_36) (= (mod (select (store (select |c_#memory_int| |c_main_~#array~0.base|) (+ |c_main_~#array~0.offset| (* (mod (+ 4294967295 aux_mod_main_~index~0_36) 4294967296) 4)) v_ArrVal_149) |c_main_~#array~0.offset|) 4294967296) 0))) is different from false [2022-04-28 09:29:03,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2022-04-28 09:29:04,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245990 treesize of output 245734