/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_3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:26:08,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:26:08,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:26:08,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:26:08,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:26:08,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:26:08,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:26:08,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:26:08,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:26:08,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:26:08,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:26:08,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:26:08,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:26:08,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:26:08,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:26:08,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:26:08,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:26:08,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:26:08,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:26:08,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:26:08,701 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:26:08,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:26:08,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:26:08,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:26:08,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:26:08,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:26:08,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:26:08,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:26:08,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:26:08,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:26:08,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:26:08,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:26:08,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:26:08,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:26:08,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:26:08,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:26:08,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:26:08,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:26:08,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:26:08,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:26:08,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:26:08,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:26:08,710 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:26:08,716 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:26:08,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:26:08,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:26:08,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:26:08,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:26:08,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:26:08,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:26:08,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:26:08,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:26:08,718 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:26:08,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:26:08,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:26:08,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:26:08,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:26:08,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:26:08,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:26:08,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:26:08,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:26:08,719 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:26:08,719 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:26:08,719 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:26:08,719 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:26:08,719 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:26:08,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:26:08,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:26:08,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:26:08,921 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:26:08,922 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:26:08,923 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_3.i [2022-04-08 09:26:08,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628dc9a4c/46c383146910459db555dc7320e66889/FLAG61bc417bd [2022-04-08 09:26:09,287 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:26:09,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i [2022-04-08 09:26:09,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628dc9a4c/46c383146910459db555dc7320e66889/FLAG61bc417bd [2022-04-08 09:26:09,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/628dc9a4c/46c383146910459db555dc7320e66889 [2022-04-08 09:26:09,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:26:09,723 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:26:09,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:26:09,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:26:09,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:26:09,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:26:09" (1/1) ... [2022-04-08 09:26:09,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43692a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:09, skipping insertion in model container [2022-04-08 09:26:09,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:26:09" (1/1) ... [2022-04-08 09:26:09,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:26:09,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:26:09,878 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_3.i[920,933] [2022-04-08 09:26:09,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:26:09,902 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:26:09,910 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_3.i[920,933] [2022-04-08 09:26:09,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:26:09,924 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:26:09,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:09 WrapperNode [2022-04-08 09:26:09,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:26:09,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:26:09,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:26:09,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:26:09,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:09" (1/1) ... [2022-04-08 09:26:09,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:09" (1/1) ... [2022-04-08 09:26:09,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:09" (1/1) ... [2022-04-08 09:26:09,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:09" (1/1) ... [2022-04-08 09:26:09,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:09" (1/1) ... [2022-04-08 09:26:09,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:09" (1/1) ... [2022-04-08 09:26:09,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:09" (1/1) ... [2022-04-08 09:26:09,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:26:09,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:26:09,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:26:09,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:26:09,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:09" (1/1) ... [2022-04-08 09:26:09,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:26:09,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:26:09,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:26:09,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:26:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:26:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:26:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:26:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:26:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:26:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:26:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:26:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:26:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:26:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:26:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:26:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:26:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:26:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:26:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:26:10,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 09:26:10,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:26:10,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:26:10,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:26:10,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:26:10,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:26:10,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:26:10,041 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:26:10,043 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:26:10,162 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:26:10,167 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:26:10,167 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 09:26:10,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:26:10 BoogieIcfgContainer [2022-04-08 09:26:10,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:26:10,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:26:10,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:26:10,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:26:10,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:26:09" (1/3) ... [2022-04-08 09:26:10,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f7dab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:26:10, skipping insertion in model container [2022-04-08 09:26:10,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:26:09" (2/3) ... [2022-04-08 09:26:10,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f7dab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:26:10, skipping insertion in model container [2022-04-08 09:26:10,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:26:10" (3/3) ... [2022-04-08 09:26:10,173 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_3.i [2022-04-08 09:26:10,177 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:26:10,177 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:26:10,204 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:26:10,209 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:26:10,209 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:26:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:26:10,225 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:26:10,226 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:26:10,226 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:26:10,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:26:10,229 INFO L85 PathProgramCache]: Analyzing trace with hash -851892248, now seen corresponding path program 1 times [2022-04-08 09:26:10,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:10,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [488614653] [2022-04-08 09:26:10,242 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:26:10,242 INFO L85 PathProgramCache]: Analyzing trace with hash -851892248, now seen corresponding path program 2 times [2022-04-08 09:26:10,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:26:10,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797401520] [2022-04-08 09:26:10,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:26:10,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:26:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:10,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:26:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:10,414 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(29, 2); {27#true} is VALID [2022-04-08 09:26:10,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 09:26:10,415 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #71#return; {27#true} is VALID [2022-04-08 09:26:10,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:26:10,417 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(29, 2); {27#true} is VALID [2022-04-08 09:26:10,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 09:26:10,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #71#return; {27#true} is VALID [2022-04-08 09:26:10,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-08 09:26:10,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {27#true} is VALID [2022-04-08 09:26:10,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~index~0 % 4294967296 < 10000); {27#true} is VALID [2022-04-08 09:26:10,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~index~0 := 0; {27#true} is VALID [2022-04-08 09:26:10,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {27#true} is VALID [2022-04-08 09:26:10,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume #t~short4; {32#|main_#t~short4|} is VALID [2022-04-08 09:26:10,419 INFO L272 TraceCheckUtils]: 10: Hoare triple {32#|main_#t~short4|} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:26:10,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:26:10,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28#false} is VALID [2022-04-08 09:26:10,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-08 09:26:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:10,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:26:10,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797401520] [2022-04-08 09:26:10,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797401520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:10,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:10,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:26:10,424 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:26:10,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [488614653] [2022-04-08 09:26:10,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [488614653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:10,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:10,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:26:10,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146607685] [2022-04-08 09:26:10,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:26:10,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:26:10,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:26:10,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:10,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:10,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:26:10,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:10,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:26:10,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:26:10,472 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:10,752 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-08 09:26:10,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:26:10,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:26:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:26:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-08 09:26:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-08 09:26:10,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-08 09:26:10,827 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-08 09:26:10,833 INFO L225 Difference]: With dead ends: 47 [2022-04-08 09:26:10,833 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 09:26:10,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:26:10,837 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:26:10,838 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 44 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:26:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 09:26:10,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-08 09:26:10,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:26:10,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:10,859 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:10,859 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:10,861 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 09:26:10,861 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 09:26:10,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:10,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:10,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 09:26:10,862 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 09:26:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:10,863 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 09:26:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 09:26:10,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:10,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:10,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:26:10,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:26:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-08 09:26:10,866 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2022-04-08 09:26:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:26:10,867 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-08 09:26:10,869 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:10,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-08 09:26:10,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-08 09:26:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:26:10,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:26:10,898 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:26:10,898 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:26:10,898 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:26:10,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:26:10,899 INFO L85 PathProgramCache]: Analyzing trace with hash -850045206, now seen corresponding path program 1 times [2022-04-08 09:26:10,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:10,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1116848339] [2022-04-08 09:26:10,900 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:26:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash -850045206, now seen corresponding path program 2 times [2022-04-08 09:26:10,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:26:10,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590647219] [2022-04-08 09:26:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:26:10,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:26:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:10,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:26:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:10,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#(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(29, 2); {238#true} is VALID [2022-04-08 09:26:10,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-08 09:26:10,977 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {238#true} {238#true} #71#return; {238#true} is VALID [2022-04-08 09:26:10,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {238#true} call ULTIMATE.init(); {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:26:10,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#(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(29, 2); {238#true} is VALID [2022-04-08 09:26:10,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-08 09:26:10,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {238#true} {238#true} #71#return; {238#true} is VALID [2022-04-08 09:26:10,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {238#true} call #t~ret5 := main(); {238#true} is VALID [2022-04-08 09:26:10,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {238#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {243#(= main_~index~0 0)} is VALID [2022-04-08 09:26:10,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#(= main_~index~0 0)} assume !(~index~0 % 4294967296 < 10000); {239#false} is VALID [2022-04-08 09:26:10,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#false} ~index~0 := 0; {239#false} is VALID [2022-04-08 09:26:10,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {239#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {239#false} is VALID [2022-04-08 09:26:10,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {239#false} is VALID [2022-04-08 09:26:10,980 INFO L272 TraceCheckUtils]: 10: Hoare triple {239#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {239#false} is VALID [2022-04-08 09:26:10,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {239#false} ~cond := #in~cond; {239#false} is VALID [2022-04-08 09:26:10,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {239#false} assume 0 == ~cond; {239#false} is VALID [2022-04-08 09:26:10,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {239#false} assume !false; {239#false} is VALID [2022-04-08 09:26:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:10,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:26:10,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590647219] [2022-04-08 09:26:10,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590647219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:10,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:10,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:26:10,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:26:10,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1116848339] [2022-04-08 09:26:10,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1116848339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:10,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:10,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:26:10,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308312234] [2022-04-08 09:26:10,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:26:10,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:26:10,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:26:10,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:10,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:10,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:26:10,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:10,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:26:10,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:26:10,995 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:11,084 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-08 09:26:11,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:26:11,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:26:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:26:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-08 09:26:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-04-08 09:26:11,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2022-04-08 09:26:11,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:11,129 INFO L225 Difference]: With dead ends: 48 [2022-04-08 09:26:11,129 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 09:26:11,129 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:26:11,131 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:26:11,132 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 23 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:26:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 09:26:11,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-04-08 09:26:11,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:26:11,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:11,141 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:11,142 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:11,144 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-08 09:26:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-08 09:26:11,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:11,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:11,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-08 09:26:11,145 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-08 09:26:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:11,148 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-08 09:26:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-08 09:26:11,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:11,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:11,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:26:11,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:26:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-08 09:26:11,151 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2022-04-08 09:26:11,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:26:11,151 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-08 09:26:11,152 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:11,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-08 09:26:11,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 09:26:11,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 09:26:11,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:26:11,184 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:26:11,184 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:26:11,184 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:26:11,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:26:11,185 INFO L85 PathProgramCache]: Analyzing trace with hash -446317518, now seen corresponding path program 1 times [2022-04-08 09:26:11,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:11,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1294870396] [2022-04-08 09:26:11,197 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:26:11,197 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:26:11,197 INFO L85 PathProgramCache]: Analyzing trace with hash -446317518, now seen corresponding path program 2 times [2022-04-08 09:26:11,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:26:11,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974293780] [2022-04-08 09:26:11,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:26:11,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:26:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:11,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:26:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:11,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {464#(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(29, 2); {457#true} is VALID [2022-04-08 09:26:11,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-08 09:26:11,307 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-08 09:26:11,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:26:11,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#(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(29, 2); {457#true} is VALID [2022-04-08 09:26:11,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-08 09:26:11,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-08 09:26:11,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2022-04-08 09:26:11,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {462#(= main_~index~0 0)} is VALID [2022-04-08 09:26:11,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {463#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:26:11,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(and (<= main_~index~0 1) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {458#false} is VALID [2022-04-08 09:26:11,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#false} ~index~0 := 0; {458#false} is VALID [2022-04-08 09:26:11,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {458#false} is VALID [2022-04-08 09:26:11,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {458#false} is VALID [2022-04-08 09:26:11,310 INFO L272 TraceCheckUtils]: 11: Hoare triple {458#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {458#false} is VALID [2022-04-08 09:26:11,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#false} ~cond := #in~cond; {458#false} is VALID [2022-04-08 09:26:11,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} assume 0 == ~cond; {458#false} is VALID [2022-04-08 09:26:11,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-08 09:26:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:11,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:26:11,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974293780] [2022-04-08 09:26:11,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974293780] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:26:11,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315510160] [2022-04-08 09:26:11,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:26:11,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:26:11,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:26:11,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:26:11,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 09:26:11,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:26:11,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:26:11,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 09:26:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:11,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:26:11,447 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-08 09:26:11,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2022-04-08 09:26:11,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#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(29, 2); {457#true} is VALID [2022-04-08 09:26:11,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-08 09:26:11,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-08 09:26:11,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2022-04-08 09:26:11,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {483#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-08 09:26:11,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {487#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:26:11,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {487#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 10000); {487#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:26:11,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {487#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {494#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-08 09:26:11,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {494#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {498#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} is VALID [2022-04-08 09:26:11,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {498#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {458#false} is VALID [2022-04-08 09:26:11,587 INFO L272 TraceCheckUtils]: 11: Hoare triple {458#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {458#false} is VALID [2022-04-08 09:26:11,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#false} ~cond := #in~cond; {458#false} is VALID [2022-04-08 09:26:11,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} assume 0 == ~cond; {458#false} is VALID [2022-04-08 09:26:11,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-08 09:26:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:11,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:26:11,723 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 18 treesize of output 16 [2022-04-08 09:26:11,733 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-08 09:26:11,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-08 09:26:11,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} assume 0 == ~cond; {458#false} is VALID [2022-04-08 09:26:11,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {458#false} ~cond := #in~cond; {458#false} is VALID [2022-04-08 09:26:11,808 INFO L272 TraceCheckUtils]: 11: Hoare triple {458#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {458#false} is VALID [2022-04-08 09:26:11,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {526#|main_#t~short4|} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {458#false} is VALID [2022-04-08 09:26:11,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {530#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {526#|main_#t~short4|} is VALID [2022-04-08 09:26:11,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {534#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {530#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-08 09:26:11,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {534#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 10000); {534#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-08 09:26:11,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {541#(and (= (mod main_~tmp~0 4294967296) 0) (forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {534#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-08 09:26:11,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {541#(and (= (mod main_~tmp~0 4294967296) 0) (forall ((|main_~#array~0.offset| Int)) (= (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) |main_~#array~0.offset|)))} is VALID [2022-04-08 09:26:11,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2022-04-08 09:26:11,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #71#return; {457#true} is VALID [2022-04-08 09:26:11,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-08 09:26:11,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#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(29, 2); {457#true} is VALID [2022-04-08 09:26:11,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2022-04-08 09:26:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:11,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315510160] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:26:11,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:26:11,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2022-04-08 09:26:11,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:26:11,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1294870396] [2022-04-08 09:26:11,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1294870396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:11,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:11,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:26:11,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32070950] [2022-04-08 09:26:11,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:26:11,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-08 09:26:11,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:26:11,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:11,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:11,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:26:11,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:11,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:26:11,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:26:11,828 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:11,970 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-08 09:26:11,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:26:11,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-08 09:26:11,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:26:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-08 09:26:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:11,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-08 09:26:11,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-08 09:26:12,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:12,012 INFO L225 Difference]: With dead ends: 55 [2022-04-08 09:26:12,012 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 09:26:12,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-04-08 09:26:12,013 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:26:12,013 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 28 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:26:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 09:26:12,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-04-08 09:26:12,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:26:12,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:12,025 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:12,025 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:12,027 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-08 09:26:12,027 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-04-08 09:26:12,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:12,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:12,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-04-08 09:26:12,028 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-04-08 09:26:12,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:12,030 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-08 09:26:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-04-08 09:26:12,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:12,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:12,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:26:12,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:26:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-08 09:26:12,031 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2022-04-08 09:26:12,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:26:12,031 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-08 09:26:12,032 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:12,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-08 09:26:12,054 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-08 09:26:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-08 09:26:12,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:26:12,055 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:26:12,055 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:26:12,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 09:26:12,270 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:26:12,271 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:26:12,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:26:12,271 INFO L85 PathProgramCache]: Analyzing trace with hash -815661078, now seen corresponding path program 3 times [2022-04-08 09:26:12,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:12,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1831356135] [2022-04-08 09:26:12,274 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:26:12,274 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:26:12,274 INFO L85 PathProgramCache]: Analyzing trace with hash -815661078, now seen corresponding path program 4 times [2022-04-08 09:26:12,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:26:12,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038044199] [2022-04-08 09:26:12,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:26:12,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:26:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:12,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:26:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:12,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {812#(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(29, 2); {804#true} is VALID [2022-04-08 09:26:12,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {804#true} assume true; {804#true} is VALID [2022-04-08 09:26:12,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {804#true} {804#true} #71#return; {804#true} is VALID [2022-04-08 09:26:12,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:26:12,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {812#(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(29, 2); {804#true} is VALID [2022-04-08 09:26:12,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2022-04-08 09:26:12,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #71#return; {804#true} is VALID [2022-04-08 09:26:12,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret5 := main(); {804#true} is VALID [2022-04-08 09:26:12,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {804#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {809#(= main_~index~0 0)} is VALID [2022-04-08 09:26:12,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {809#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {810#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 09:26:12,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {810#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {811#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:26:12,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {811#(and (<= main_~index~0 2) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {805#false} is VALID [2022-04-08 09:26:12,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {805#false} ~index~0 := 0; {805#false} is VALID [2022-04-08 09:26:12,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {805#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {805#false} is VALID [2022-04-08 09:26:12,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {805#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {805#false} is VALID [2022-04-08 09:26:12,361 INFO L272 TraceCheckUtils]: 12: Hoare triple {805#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {805#false} is VALID [2022-04-08 09:26:12,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {805#false} ~cond := #in~cond; {805#false} is VALID [2022-04-08 09:26:12,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {805#false} assume 0 == ~cond; {805#false} is VALID [2022-04-08 09:26:12,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {805#false} assume !false; {805#false} is VALID [2022-04-08 09:26:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:12,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:26:12,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038044199] [2022-04-08 09:26:12,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038044199] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:26:12,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749315579] [2022-04-08 09:26:12,363 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:26:12,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:26:12,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:26:12,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:26:12,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 09:26:12,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:26:12,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:26:12,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 09:26:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:12,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:26:12,454 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 13 treesize of output 9 [2022-04-08 09:26:12,494 INFO L356 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-04-08 09:26:12,494 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 33 treesize of output 28 [2022-04-08 09:26:12,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {804#true} is VALID [2022-04-08 09:26:12,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {804#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(29, 2); {804#true} is VALID [2022-04-08 09:26:12,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2022-04-08 09:26:12,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #71#return; {804#true} is VALID [2022-04-08 09:26:12,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret5 := main(); {804#true} is VALID [2022-04-08 09:26:12,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {804#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {831#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-08 09:26:12,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {831#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {835#(and (= (+ (- 2) main_~tmp~0) 0) (= (+ (- 2) main_~tmp~0) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~index~0 1))} is VALID [2022-04-08 09:26:12,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#(and (= (+ (- 2) main_~tmp~0) 0) (= (+ (- 2) main_~tmp~0) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~index~0 1))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {839#(and (= (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 09:26:12,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {839#(and (= (+ (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~index~0) 1) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !(~index~0 % 4294967296 < 10000); {805#false} is VALID [2022-04-08 09:26:12,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {805#false} ~index~0 := 0; {805#false} is VALID [2022-04-08 09:26:12,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {805#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {805#false} is VALID [2022-04-08 09:26:12,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {805#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {805#false} is VALID [2022-04-08 09:26:12,534 INFO L272 TraceCheckUtils]: 12: Hoare triple {805#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {805#false} is VALID [2022-04-08 09:26:12,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {805#false} ~cond := #in~cond; {805#false} is VALID [2022-04-08 09:26:12,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {805#false} assume 0 == ~cond; {805#false} is VALID [2022-04-08 09:26:12,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {805#false} assume !false; {805#false} is VALID [2022-04-08 09:26:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:12,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:26:12,693 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 31 treesize of output 29 [2022-04-08 09:26:12,741 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 218 treesize of output 214 [2022-04-08 09:26:12,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {805#false} assume !false; {805#false} is VALID [2022-04-08 09:26:12,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {805#false} assume 0 == ~cond; {805#false} is VALID [2022-04-08 09:26:12,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {805#false} ~cond := #in~cond; {805#false} is VALID [2022-04-08 09:26:12,836 INFO L272 TraceCheckUtils]: 12: Hoare triple {805#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {805#false} is VALID [2022-04-08 09:26:12,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {876#|main_#t~short4|} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {805#false} is VALID [2022-04-08 09:26:12,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {880#(= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {876#|main_#t~short4|} is VALID [2022-04-08 09:26:12,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {880#(= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296))} is VALID [2022-04-08 09:26:12,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {888#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (< (mod main_~index~0 4294967296) 10000))} assume !(~index~0 % 4294967296 < 10000); {884#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-08 09:26:12,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {892#(or (< (mod (+ main_~index~0 1) 4294967296) 10000) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) main_~tmp~0) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {888#(or (= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0) (< (mod main_~index~0 4294967296) 10000))} is VALID [2022-04-08 09:26:12,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {896#(or (<= 10000 (mod main_~index~0 4294967296)) (< (mod (+ 2 main_~index~0) 4294967296) 10000))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {892#(or (< (mod (+ main_~index~0 1) 4294967296) 10000) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) main_~tmp~0) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-08 09:26:12,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {804#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {896#(or (<= 10000 (mod main_~index~0 4294967296)) (< (mod (+ 2 main_~index~0) 4294967296) 10000))} is VALID [2022-04-08 09:26:12,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret5 := main(); {804#true} is VALID [2022-04-08 09:26:12,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #71#return; {804#true} is VALID [2022-04-08 09:26:12,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2022-04-08 09:26:12,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {804#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(29, 2); {804#true} is VALID [2022-04-08 09:26:12,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {804#true} is VALID [2022-04-08 09:26:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:12,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749315579] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:26:12,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:26:12,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 8] total 15 [2022-04-08 09:26:12,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:26:12,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1831356135] [2022-04-08 09:26:12,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1831356135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:12,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:12,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:26:12,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339805440] [2022-04-08 09:26:12,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:26:12,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-08 09:26:12,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:26:12,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-08 09:26:12,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:12,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:26:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:12,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:26:12,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-04-08 09:26:12,859 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-08 09:26:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:13,087 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-04-08 09:26:13,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:26:13,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-08 09:26:13,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:26:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-08 09:26:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-08 09:26:13,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-08 09:26:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-08 09:26:13,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2022-04-08 09:26:13,140 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-08 09:26:13,142 INFO L225 Difference]: With dead ends: 62 [2022-04-08 09:26:13,143 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 09:26:13,144 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:26:13,146 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:26:13,147 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 26 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:26:13,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 09:26:13,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 27. [2022-04-08 09:26:13,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:26:13,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:13,174 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:13,175 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:13,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:13,179 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-08 09:26:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-08 09:26:13,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:13,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:13,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 45 states. [2022-04-08 09:26:13,185 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 45 states. [2022-04-08 09:26:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:13,188 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-08 09:26:13,188 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-08 09:26:13,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:13,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:13,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:26:13,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:26:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-08 09:26:13,190 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2022-04-08 09:26:13,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:26:13,190 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-08 09:26:13,190 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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-08 09:26:13,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-08 09:26:13,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-08 09:26:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:26:13,216 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:26:13,216 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:26:13,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 09:26:13,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 09:26:13,435 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:26:13,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:26:13,436 INFO L85 PathProgramCache]: Analyzing trace with hash 619590450, now seen corresponding path program 5 times [2022-04-08 09:26:13,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:13,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1103193110] [2022-04-08 09:26:13,439 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:26:13,440 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:26:13,440 INFO L85 PathProgramCache]: Analyzing trace with hash 619590450, now seen corresponding path program 6 times [2022-04-08 09:26:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:26:13,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142495796] [2022-04-08 09:26:13,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:26:13,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:26:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:13,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:26:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:13,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {1200#(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(29, 2); {1191#true} is VALID [2022-04-08 09:26:13,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-08 09:26:13,526 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1191#true} {1191#true} #71#return; {1191#true} is VALID [2022-04-08 09:26:13,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:26:13,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {1200#(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(29, 2); {1191#true} is VALID [2022-04-08 09:26:13,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-08 09:26:13,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #71#return; {1191#true} is VALID [2022-04-08 09:26:13,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret5 := main(); {1191#true} is VALID [2022-04-08 09:26:13,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1196#(= main_~index~0 0)} is VALID [2022-04-08 09:26:13,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {1196#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1197#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 09:26:13,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {1197#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1198#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-08 09:26:13,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {1198#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1199#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} is VALID [2022-04-08 09:26:13,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {1199#(and (<= main_~index~0 3) (not (<= (+ (div main_~index~0 4294967296) 1) 0)))} assume !(~index~0 % 4294967296 < 10000); {1192#false} is VALID [2022-04-08 09:26:13,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {1192#false} ~index~0 := 0; {1192#false} is VALID [2022-04-08 09:26:13,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {1192#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1192#false} is VALID [2022-04-08 09:26:13,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {1192#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1192#false} is VALID [2022-04-08 09:26:13,530 INFO L272 TraceCheckUtils]: 13: Hoare triple {1192#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1192#false} is VALID [2022-04-08 09:26:13,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#false} ~cond := #in~cond; {1192#false} is VALID [2022-04-08 09:26:13,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {1192#false} assume 0 == ~cond; {1192#false} is VALID [2022-04-08 09:26:13,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-08 09:26:13,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:13,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:26:13,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142495796] [2022-04-08 09:26:13,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142495796] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:26:13,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481365630] [2022-04-08 09:26:13,531 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:26:13,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:26:13,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:26:13,532 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:26:13,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 09:26:13,576 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 09:26:13,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:26:13,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 09:26:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:13,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:26:13,617 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-08 09:26:13,652 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-08 09:26:13,653 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-08 09:26:13,680 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-08 09:26:13,680 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-08 09:26:13,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1191#true} is VALID [2022-04-08 09:26:13,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#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(29, 2); {1191#true} is VALID [2022-04-08 09:26:13,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-08 09:26:13,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #71#return; {1191#true} is VALID [2022-04-08 09:26:13,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret5 := main(); {1191#true} is VALID [2022-04-08 09:26:13,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1219#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-08 09:26:13,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {1219#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1223#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-08 09:26:13,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {1223#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 0) (= (+ (- 1) main_~index~0) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1227#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 09:26:13,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1231#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:26:13,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {1231#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 10000); {1231#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:26:13,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {1231#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {1238#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-08 09:26:13,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {1238#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1242#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} is VALID [2022-04-08 09:26:13,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {1242#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1192#false} is VALID [2022-04-08 09:26:13,741 INFO L272 TraceCheckUtils]: 13: Hoare triple {1192#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1192#false} is VALID [2022-04-08 09:26:13,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#false} ~cond := #in~cond; {1192#false} is VALID [2022-04-08 09:26:13,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {1192#false} assume 0 == ~cond; {1192#false} is VALID [2022-04-08 09:26:13,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-08 09:26:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:13,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:26:14,046 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 40 treesize of output 38 [2022-04-08 09:26:14,067 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 470 treesize of output 466 [2022-04-08 09:26:14,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-08 09:26:14,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {1192#false} assume 0 == ~cond; {1192#false} is VALID [2022-04-08 09:26:14,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#false} ~cond := #in~cond; {1192#false} is VALID [2022-04-08 09:26:14,412 INFO L272 TraceCheckUtils]: 13: Hoare triple {1192#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1192#false} is VALID [2022-04-08 09:26:14,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {1270#|main_#t~short4|} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1192#false} is VALID [2022-04-08 09:26:14,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {1274#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1270#|main_#t~short4|} is VALID [2022-04-08 09:26:14,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {1278#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} ~index~0 := 0; {1274#(or (= (mod (* 2 main_~index~0) 4294967296) (mod (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4))) 4294967296)) (not (< (mod main_~index~0 4294967296) 10000)))} is VALID [2022-04-08 09:26:14,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {1278#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} assume !(~index~0 % 4294967296 < 10000); {1278#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-08 09:26:14,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {1285#(forall ((v_ArrVal_52 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1278#(= (mod (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 4294967296) 0)} is VALID [2022-04-08 09:26:14,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {1289#(forall ((v_ArrVal_50 Int) (v_ArrVal_52 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_50) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|) 4294967296) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1285#(forall ((v_ArrVal_52 Int)) (= (mod (select (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_52) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-08 09:26:14,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {1293#(and (= (mod main_~tmp~0 4294967296) 0) (= (* (mod main_~index~0 4294967296) 4) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1289#(forall ((v_ArrVal_50 Int) (v_ArrVal_52 Int)) (= (mod (select (store (store (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* (mod main_~index~0 4294967296) 4)) v_ArrVal_50) (+ (* (mod (+ main_~index~0 1) 4294967296) 4) |main_~#array~0.offset|) v_ArrVal_52) |main_~#array~0.offset|) 4294967296) 0))} is VALID [2022-04-08 09:26:14,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1293#(and (= (mod main_~tmp~0 4294967296) 0) (= (* (mod main_~index~0 4294967296) 4) 0))} is VALID [2022-04-08 09:26:14,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret5 := main(); {1191#true} is VALID [2022-04-08 09:26:14,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #71#return; {1191#true} is VALID [2022-04-08 09:26:14,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-08 09:26:14,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#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(29, 2); {1191#true} is VALID [2022-04-08 09:26:14,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1191#true} is VALID [2022-04-08 09:26:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:14,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481365630] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:26:14,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:26:14,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2022-04-08 09:26:14,419 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:26:14,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1103193110] [2022-04-08 09:26:14,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1103193110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:26:14,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:26:14,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:26:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32271998] [2022-04-08 09:26:14,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:26:14,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 17 [2022-04-08 09:26:14,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:26:14,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:14,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:14,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:26:14,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:14,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:26:14,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-04-08 09:26:14,432 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:14,771 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-04-08 09:26:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:26:14,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 17 [2022-04-08 09:26:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:26:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-08 09:26:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-08 09:26:14,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-08 09:26:14,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:14,829 INFO L225 Difference]: With dead ends: 69 [2022-04-08 09:26:14,829 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 09:26:14,830 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-04-08 09:26:14,830 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:26:14,830 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 39 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:26:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 09:26:14,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2022-04-08 09:26:14,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:26:14,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:14,854 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:14,854 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:14,858 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 09:26:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-08 09:26:14,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:14,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:14,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 52 states. [2022-04-08 09:26:14,859 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 52 states. [2022-04-08 09:26:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:26:14,860 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 09:26:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-08 09:26:14,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:26:14,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:26:14,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:26:14,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:26:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:26:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-08 09:26:14,862 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 17 [2022-04-08 09:26:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:26:14,862 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-08 09:26:14,862 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:26:14,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-08 09:26:14,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:26:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-08 09:26:14,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 09:26:14,887 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:26:14,887 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:26:14,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 09:26:15,092 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:26:15,093 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:26:15,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:26:15,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2132252438, now seen corresponding path program 7 times [2022-04-08 09:26:15,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:26:15,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1972556479] [2022-04-08 09:26:15,095 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:26:15,095 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:26:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2132252438, now seen corresponding path program 8 times [2022-04-08 09:26:15,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:26:15,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240515099] [2022-04-08 09:26:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:26:15,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:26:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:15,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:26:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:15,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {1630#(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(29, 2); {1620#true} is VALID [2022-04-08 09:26:15,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-04-08 09:26:15,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1620#true} {1620#true} #71#return; {1620#true} is VALID [2022-04-08 09:26:15,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {1620#true} call ULTIMATE.init(); {1630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:26:15,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#(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(29, 2); {1620#true} is VALID [2022-04-08 09:26:15,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-04-08 09:26:15,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1620#true} {1620#true} #71#return; {1620#true} is VALID [2022-04-08 09:26:15,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {1620#true} call #t~ret5 := main(); {1620#true} is VALID [2022-04-08 09:26:15,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {1620#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1625#(= main_~index~0 0)} is VALID [2022-04-08 09:26:15,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {1625#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1626#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2022-04-08 09:26:15,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {1626#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1627#(and (<= main_~index~0 2) (<= 2 main_~index~0))} is VALID [2022-04-08 09:26:15,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {1627#(and (<= main_~index~0 2) (<= 2 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1628#(and (<= 3 main_~index~0) (<= main_~index~0 3))} is VALID [2022-04-08 09:26:15,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {1628#(and (<= 3 main_~index~0) (<= main_~index~0 3))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1629#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} is VALID [2022-04-08 09:26:15,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {1629#(and (not (<= (+ (div main_~index~0 4294967296) 1) 0)) (<= main_~index~0 4))} assume !(~index~0 % 4294967296 < 10000); {1621#false} is VALID [2022-04-08 09:26:15,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {1621#false} ~index~0 := 0; {1621#false} is VALID [2022-04-08 09:26:15,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {1621#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1621#false} is VALID [2022-04-08 09:26:15,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {1621#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1621#false} is VALID [2022-04-08 09:26:15,177 INFO L272 TraceCheckUtils]: 14: Hoare triple {1621#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1621#false} is VALID [2022-04-08 09:26:15,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {1621#false} ~cond := #in~cond; {1621#false} is VALID [2022-04-08 09:26:15,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {1621#false} assume 0 == ~cond; {1621#false} is VALID [2022-04-08 09:26:15,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {1621#false} assume !false; {1621#false} is VALID [2022-04-08 09:26:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:15,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:26:15,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240515099] [2022-04-08 09:26:15,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240515099] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:26:15,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909024115] [2022-04-08 09:26:15,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:26:15,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:26:15,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:26:15,178 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-08 09:26:15,179 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-08 09:26:15,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:26:15,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:26:15,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 09:26:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:26:15,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:26:15,260 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-08 09:26:15,291 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-08 09:26:15,291 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-08 09:26:15,321 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-04-08 09:26:15,321 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 27 treesize of output 26 [2022-04-08 09:26:15,347 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-08 09:26:15,348 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-08 09:26:15,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {1620#true} call ULTIMATE.init(); {1620#true} is VALID [2022-04-08 09:26:15,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {1620#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(29, 2); {1620#true} is VALID [2022-04-08 09:26:15,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-04-08 09:26:15,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1620#true} {1620#true} #71#return; {1620#true} is VALID [2022-04-08 09:26:15,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {1620#true} call #t~ret5 := main(); {1620#true} is VALID [2022-04-08 09:26:15,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {1620#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(40000);~index~0 := 0;~tmp~0 := 0; {1649#(and (= main_~index~0 0) (= main_~tmp~0 0))} is VALID [2022-04-08 09:26:15,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {1649#(and (= main_~index~0 0) (= main_~tmp~0 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1653#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 0) (= (+ (- 1) main_~index~0) 0))} is VALID [2022-04-08 09:26:15,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {1653#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ 4294967295 main_~index~0) 4294967296) 4) |main_~#array~0.offset|)) 0) (= (+ (- 1) main_~index~0) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1657#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 09:26:15,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {1657#(and (= 2 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1661#(and (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} is VALID [2022-04-08 09:26:15,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {1661#(and (= 2 (+ (- 1) main_~index~0)) (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1665#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:26:15,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {1665#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} assume !(~index~0 % 4294967296 < 10000); {1665#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} is VALID [2022-04-08 09:26:15,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {1665#(= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0)} ~index~0 := 0; {1672#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} is VALID [2022-04-08 09:26:15,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {1672#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1676#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} is VALID [2022-04-08 09:26:15,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {1676#(and (= (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|) 0) (= main_~index~0 0) |main_#t~short4|)} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (~index~0 % 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1621#false} is VALID [2022-04-08 09:26:15,409 INFO L272 TraceCheckUtils]: 14: Hoare triple {1621#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1621#false} is VALID [2022-04-08 09:26:15,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {1621#false} ~cond := #in~cond; {1621#false} is VALID [2022-04-08 09:26:15,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {1621#false} assume 0 == ~cond; {1621#false} is VALID [2022-04-08 09:26:15,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {1621#false} assume !false; {1621#false} is VALID [2022-04-08 09:26:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:26:15,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:26:15,972 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 51 treesize of output 49 [2022-04-08 09:26:16,003 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 14886 treesize of output 14822 [2022-04-08 09:26:17,089 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-08 09:26:17,109 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-08 09:26:17,304 WARN L460 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-08 09:26:17,305 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:275) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 09:26:17,309 INFO L158 Benchmark]: Toolchain (without parser) took 7585.31ms. Allocated memory was 198.2MB in the beginning and 358.6MB in the end (delta: 160.4MB). Free memory was 146.8MB in the beginning and 307.7MB in the end (delta: -160.8MB). Peak memory consumption was 146.6MB. Max. memory is 8.0GB. [2022-04-08 09:26:17,309 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 198.2MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:26:17,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.81ms. Allocated memory is still 198.2MB. Free memory was 146.6MB in the beginning and 173.9MB in the end (delta: -27.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 09:26:17,309 INFO L158 Benchmark]: Boogie Preprocessor took 23.23ms. Allocated memory is still 198.2MB. Free memory was 173.9MB in the beginning and 171.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:26:17,309 INFO L158 Benchmark]: RCFGBuilder took 218.96ms. Allocated memory is still 198.2MB. Free memory was 171.9MB in the beginning and 160.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 09:26:17,310 INFO L158 Benchmark]: TraceAbstraction took 7138.79ms. Allocated memory was 198.2MB in the beginning and 358.6MB in the end (delta: 160.4MB). Free memory was 159.8MB in the beginning and 307.7MB in the end (delta: -147.9MB). Peak memory consumption was 159.2MB. Max. memory is 8.0GB. [2022-04-08 09:26:17,310 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 198.2MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.81ms. Allocated memory is still 198.2MB. Free memory was 146.6MB in the beginning and 173.9MB in the end (delta: -27.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.23ms. Allocated memory is still 198.2MB. Free memory was 173.9MB in the beginning and 171.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 218.96ms. Allocated memory is still 198.2MB. Free memory was 171.9MB in the beginning and 160.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7138.79ms. Allocated memory was 198.2MB in the beginning and 358.6MB in the end (delta: 160.4MB). Free memory was 159.8MB in the beginning and 307.7MB in the end (delta: -147.9MB). Peak memory consumption was 159.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 09:26:17,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...