/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:58:24,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:58:24,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:58:25,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:58:25,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:58:25,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:58:25,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:58:25,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:58:25,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:58:25,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:58:25,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:58:25,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:58:25,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:58:25,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:58:25,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:58:25,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:58:25,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:58:25,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:58:25,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:58:25,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:58:25,034 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:58:25,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:58:25,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:58:25,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:58:25,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:58:25,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:58:25,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:58:25,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:58:25,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:58:25,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:58:25,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:58:25,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:58:25,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:58:25,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:58:25,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:58:25,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:58:25,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:58:25,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:58:25,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:58:25,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:58:25,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:58:25,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:58:25,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:58:25,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:58:25,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:58:25,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:58:25,066 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:58:25,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:58:25,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:58:25,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:58:25,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:58:25,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:58:25,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:58:25,067 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:58:25,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:58:25,067 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:58:25,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:58:25,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:58:25,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:58:25,067 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:58:25,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:58:25,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:58:25,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:58:25,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:58:25,068 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:58:25,068 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:58:25,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:58:25,068 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:58:25,068 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:58:25,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:58:25,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:58:25,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:58:25,267 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:58:25,279 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:58:25,280 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt2.c [2022-04-28 03:58:25,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad4cd8299/820a47a769ba433e8dab54b20a7a8587/FLAGcb67f9ab7 [2022-04-28 03:58:25,680 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:58:25,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt2.c [2022-04-28 03:58:25,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad4cd8299/820a47a769ba433e8dab54b20a7a8587/FLAGcb67f9ab7 [2022-04-28 03:58:25,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad4cd8299/820a47a769ba433e8dab54b20a7a8587 [2022-04-28 03:58:25,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:58:25,698 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:58:25,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:58:25,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:58:25,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:58:25,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:58:25" (1/1) ... [2022-04-28 03:58:25,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33479dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:58:25, skipping insertion in model container [2022-04-28 03:58:25,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:58:25" (1/1) ... [2022-04-28 03:58:25,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:58:25,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:58:25,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt2.c[403,416] [2022-04-28 03:58:25,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:58:25,884 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:58:25,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt2.c[403,416] [2022-04-28 03:58:25,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:58:25,908 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:58:25,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:58:25 WrapperNode [2022-04-28 03:58:25,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:58:25,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:58:25,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:58:25,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:58:25,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:58:25" (1/1) ... [2022-04-28 03:58:25,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:58:25" (1/1) ... [2022-04-28 03:58:25,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:58:25" (1/1) ... [2022-04-28 03:58:25,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:58:25" (1/1) ... [2022-04-28 03:58:25,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:58:25" (1/1) ... [2022-04-28 03:58:25,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:58:25" (1/1) ... [2022-04-28 03:58:25,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:58:25" (1/1) ... [2022-04-28 03:58:25,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:58:25,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:58:25,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:58:25,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:58:25,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:58:25" (1/1) ... [2022-04-28 03:58:25,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:58:25,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:58:25,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:58:25,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:58:26,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:58:26,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:58:26,022 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:58:26,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:58:26,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:58:26,022 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:58:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:58:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:58:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:58:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:58:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:58:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:58:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 03:58:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:58:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:58:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:58:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:58:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:58:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:58:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:58:26,070 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:58:26,071 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:58:26,218 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:58:26,222 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:58:26,222 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:58:26,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:58:26 BoogieIcfgContainer [2022-04-28 03:58:26,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:58:26,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:58:26,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:58:26,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:58:26,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:58:25" (1/3) ... [2022-04-28 03:58:26,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73717c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:58:26, skipping insertion in model container [2022-04-28 03:58:26,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:58:25" (2/3) ... [2022-04-28 03:58:26,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73717c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:58:26, skipping insertion in model container [2022-04-28 03:58:26,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:58:26" (3/3) ... [2022-04-28 03:58:26,229 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt2.c [2022-04-28 03:58:26,237 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:58:26,237 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:58:26,310 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:58:26,314 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b4040bf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@19ab5582 [2022-04-28 03:58:26,315 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:58:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:58:26,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:58:26,326 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:26,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:26,327 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:26,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:26,330 INFO L85 PathProgramCache]: Analyzing trace with hash 410732699, now seen corresponding path program 1 times [2022-04-28 03:58:26,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:26,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1845047040] [2022-04-28 03:58:26,360 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:58:26,361 INFO L85 PathProgramCache]: Analyzing trace with hash 410732699, now seen corresponding path program 2 times [2022-04-28 03:58:26,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:26,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570580059] [2022-04-28 03:58:26,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:26,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:26,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:26,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {25#true} is VALID [2022-04-28 03:58:26,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 03:58:26,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-28 03:58:26,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:26,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {25#true} is VALID [2022-04-28 03:58:26,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 03:58:26,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #56#return; {25#true} is VALID [2022-04-28 03:58:26,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-28 03:58:26,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {25#true} is VALID [2022-04-28 03:58:26,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~l~0 := 0; {25#true} is VALID [2022-04-28 03:58:26,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 03:58:26,519 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if (~i~0 + ~j~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {26#false} is VALID [2022-04-28 03:58:26,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 03:58:26,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 03:58:26,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 03:58:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:58:26,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:26,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570580059] [2022-04-28 03:58:26,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570580059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:26,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:26,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:58:26,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:58:26,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1845047040] [2022-04-28 03:58:26,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1845047040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:26,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:26,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:58:26,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924815095] [2022-04-28 03:58:26,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:58:26,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-28 03:58:26,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:58:26,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:26,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:26,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:58:26,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:26,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:58:26,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:58:26,569 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:26,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:26,648 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-28 03:58:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:58:26,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-28 03:58:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:26,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-28 03:58:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:26,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-28 03:58:26,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-28 03:58:26,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:26,720 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:58:26,721 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 03:58:26,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:58:26,727 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:26,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:58:26,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 03:58:26,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 03:58:26,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:26,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:26,753 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:26,753 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:26,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:26,755 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 03:58:26,755 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:58:26,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:26,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:26,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:58:26,756 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:58:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:26,757 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 03:58:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:58:26,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:26,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:26,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:26,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 03:58:26,760 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-28 03:58:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:26,760 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 03:58:26,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:26,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 03:58:26,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:26,778 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:58:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:58:26,779 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:26,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:26,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:58:26,779 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:26,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:26,781 INFO L85 PathProgramCache]: Analyzing trace with hash 400573968, now seen corresponding path program 1 times [2022-04-28 03:58:26,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:26,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1272112740] [2022-04-28 03:58:26,782 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:58:26,782 INFO L85 PathProgramCache]: Analyzing trace with hash 400573968, now seen corresponding path program 2 times [2022-04-28 03:58:26,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:26,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906151341] [2022-04-28 03:58:26,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:26,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:27,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:27,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {161#true} is VALID [2022-04-28 03:58:27,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 03:58:27,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #56#return; {161#true} is VALID [2022-04-28 03:58:27,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {169#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:27,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {161#true} is VALID [2022-04-28 03:58:27,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 03:58:27,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #56#return; {161#true} is VALID [2022-04-28 03:58:27,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret5 := main(); {161#true} is VALID [2022-04-28 03:58:27,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {161#true} is VALID [2022-04-28 03:58:27,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~l~0 := 0; {166#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:58:27,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {166#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:58:27,049 INFO L272 TraceCheckUtils]: 8: Hoare triple {166#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {167#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:58:27,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {168#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:58:27,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {168#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {162#false} is VALID [2022-04-28 03:58:27,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-28 03:58:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:58:27,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:27,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906151341] [2022-04-28 03:58:27,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906151341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:27,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:27,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:58:27,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:58:27,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1272112740] [2022-04-28 03:58:27,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1272112740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:27,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:27,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:58:27,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456070579] [2022-04-28 03:58:27,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:58:27,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-28 03:58:27,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:58:27,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:27,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:27,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:58:27,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:27,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:58:27,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:58:27,063 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:27,190 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 03:58:27,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:58:27,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-28 03:58:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 03:58:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 03:58:27,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-28 03:58:27,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:27,224 INFO L225 Difference]: With dead ends: 28 [2022-04-28 03:58:27,224 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:58:27,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:58:27,227 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:27,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 28 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:58:27,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:58:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:58:27,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:27,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:27,234 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:27,235 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:27,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:27,237 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-28 03:58:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 03:58:27,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:27,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:27,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:58:27,238 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:58:27,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:27,240 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-28 03:58:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 03:58:27,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:27,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:27,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:27,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-28 03:58:27,242 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2022-04-28 03:58:27,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:27,242 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-28 03:58:27,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:27,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-28 03:58:27,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 03:58:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:58:27,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:27,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:27,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:58:27,261 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:27,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:27,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1582670899, now seen corresponding path program 1 times [2022-04-28 03:58:27,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:27,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [860207027] [2022-04-28 03:58:27,840 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:58:27,841 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:58:27,844 INFO L85 PathProgramCache]: Analyzing trace with hash 655293938, now seen corresponding path program 1 times [2022-04-28 03:58:27,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:27,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438568174] [2022-04-28 03:58:27,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:27,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:28,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:28,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {302#true} is VALID [2022-04-28 03:58:28,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#true} assume true; {302#true} is VALID [2022-04-28 03:58:28,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {302#true} {302#true} #56#return; {302#true} is VALID [2022-04-28 03:58:28,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {302#true} call ULTIMATE.init(); {312#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:28,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {302#true} is VALID [2022-04-28 03:58:28,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} assume true; {302#true} is VALID [2022-04-28 03:58:28,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {302#true} {302#true} #56#return; {302#true} is VALID [2022-04-28 03:58:28,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {302#true} call #t~ret5 := main(); {302#true} is VALID [2022-04-28 03:58:28,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {302#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {302#true} is VALID [2022-04-28 03:58:28,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {302#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~l~0 := 0; {307#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:58:28,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {307#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [60] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_8 v_main_~i~0_7)) (.cse2 (< (mod v_main_~l~0_12 4294967296) (mod v_main_~n~0_8 4294967296))) (.cse3 (= (mod v_main_~l~0_12 2) 0)) (.cse1 (= v_main_~l~0_12 v_main_~l~0_11))) (or (and .cse0 (= v_main_~n~0_8 v_main_~n~0_8) .cse1) (and (= (+ v_main_~l~0_11 v_main_~i~0_8) (+ v_main_~l~0_12 v_main_~i~0_7)) (< v_main_~l~0_11 (+ v_main_~l~0_12 2)) (< v_main_~l~0_12 v_main_~l~0_11) .cse2 .cse3) (and .cse0 (or (not .cse2) (not .cse3)) .cse1))) InVars {main_~i~0=v_main_~i~0_8, main_~l~0=v_main_~l~0_12, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_7, main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~l~0, main_~i~0] {308#(and (= main_~j~0 0) (<= main_~i~0 main_~l~0) (<= (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296))) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0)))} is VALID [2022-04-28 03:58:28,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {308#(and (= main_~j~0 0) (<= main_~i~0 main_~l~0) (<= (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296))) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0)))} [59] L23-3_primed-->L23-3: Formula: (not (< (mod v_main_~l~0_2 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} OutVars{main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {309#(and (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~j~0) 4294967296))) (<= (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296))) (< (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0 1)) (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~j~0) 4294967296)))} is VALID [2022-04-28 03:58:28,143 INFO L272 TraceCheckUtils]: 9: Hoare triple {309#(and (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~j~0) 4294967296))) (<= (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296))) (< (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0 1)) (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~j~0) 4294967296)))} call __VERIFIER_assert((if (~i~0 + ~j~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {310#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:58:28,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {310#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {311#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:58:28,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {311#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {303#false} is VALID [2022-04-28 03:58:28,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {303#false} assume !false; {303#false} is VALID [2022-04-28 03:58:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:58:28,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:28,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438568174] [2022-04-28 03:58:28,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438568174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:28,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:28,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:58:28,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:58:28,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [860207027] [2022-04-28 03:58:28,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [860207027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:28,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:28,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:58:28,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899273724] [2022-04-28 03:58:28,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:58:28,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-28 03:58:28,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:58:28,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-28 03:58:28,336 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-28 03:58:28,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:58:28,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:28,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:58:28,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:58:28,337 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-28 03:58:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:28,666 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-28 03:58:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:58:28,666 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-28 03:58:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-28 03:58:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-04-28 03:58:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-28 03:58:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-04-28 03:58:28,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 35 transitions. [2022-04-28 03:58:28,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:28,699 INFO L225 Difference]: With dead ends: 31 [2022-04-28 03:58:28,699 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 03:58:28,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:58:28,700 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:28,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 41 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:58:28,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 03:58:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 03:58:28,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:28,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:28,712 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:28,712 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:28,713 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-28 03:58:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-28 03:58:28,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:28,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:28,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:58:28,714 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:58:28,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:28,715 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-28 03:58:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-28 03:58:28,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:28,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:28,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:28,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-28 03:58:28,716 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2022-04-28 03:58:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:28,717 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-28 03:58:28,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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-28 03:58:28,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2022-04-28 03:58:28,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-28 03:58:28,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:58:28,752 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:28,752 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:28,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:58:28,755 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:28,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:28,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1085372558, now seen corresponding path program 1 times [2022-04-28 03:58:28,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:28,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [860745575] [2022-04-28 03:58:29,207 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:58:29,650 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:58:29,652 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:58:29,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1450652529, now seen corresponding path program 1 times [2022-04-28 03:58:29,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:29,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609160919] [2022-04-28 03:58:29,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:29,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:29,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:29,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {485#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {475#true} is VALID [2022-04-28 03:58:29,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {475#true} assume true; {475#true} is VALID [2022-04-28 03:58:29,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {475#true} {475#true} #56#return; {475#true} is VALID [2022-04-28 03:58:29,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {485#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:29,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {475#true} is VALID [2022-04-28 03:58:29,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {475#true} assume true; {475#true} is VALID [2022-04-28 03:58:29,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {475#true} {475#true} #56#return; {475#true} is VALID [2022-04-28 03:58:29,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {475#true} call #t~ret5 := main(); {475#true} is VALID [2022-04-28 03:58:29,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {475#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {475#true} is VALID [2022-04-28 03:58:29,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~l~0 := 0; {480#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:58:29,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [62] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~j~0_8 v_main_~j~0_7)) (.cse3 (< (mod v_main_~l~0_19 4294967296) (mod v_main_~n~0_10 4294967296))) (.cse2 (= (mod v_main_~l~0_19 2) 0)) (.cse1 (= v_main_~l~0_19 v_main_~l~0_18))) (or (and .cse0 (= v_main_~n~0_10 v_main_~n~0_10) .cse1) (and (not .cse2) (= (+ v_main_~l~0_19 v_main_~j~0_7) (+ v_main_~l~0_18 v_main_~j~0_8)) .cse3 (< v_main_~l~0_19 v_main_~l~0_18) (< (div (* v_main_~l~0_18 (- 1)) (- 2)) (+ 2 (div v_main_~l~0_19 2)))) (and .cse0 (or (not .cse3) .cse2) .cse1))) InVars {main_~l~0=v_main_~l~0_19, main_~n~0=v_main_~n~0_10, main_~j~0=v_main_~j~0_8} OutVars{main_~l~0=v_main_~l~0_18, main_~n~0=v_main_~n~0_10, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~l~0, main_~j~0] {480#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:58:29,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {480#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [63] L23-3_primed-->L23-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {480#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:58:29,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {480#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [64] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_15 v_main_~i~0_14)) (.cse1 (= v_main_~l~0_21 v_main_~l~0_20)) (.cse2 (< (mod v_main_~l~0_21 4294967296) (mod v_main_~n~0_11 4294967296))) (.cse3 (= (mod v_main_~l~0_21 2) 0))) (or (and (= v_main_~n~0_11 v_main_~n~0_11) .cse0 .cse1) (and .cse0 (or (not .cse2) (not .cse3)) .cse1) (and (<= (div (+ v_main_~i~0_15 (* v_main_~i~0_14 (- 1)) (* v_main_~l~0_21 (- 1)) 1) (- 2)) (+ (div (+ v_main_~l~0_21 (- 1)) 2) 1)) (= (+ v_main_~i~0_15 v_main_~l~0_20) (+ v_main_~i~0_14 v_main_~l~0_21)) (< v_main_~i~0_15 v_main_~i~0_14) .cse2 .cse3))) InVars {main_~i~0=v_main_~i~0_15, main_~l~0=v_main_~l~0_21, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_14, main_~l~0=v_main_~l~0_20, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[main_~l~0, main_~i~0] {481#(and (or (and (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0)) (not (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0))) (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~j~0) 4294967296))) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296))) (and (= main_~i~0 0) (< (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)))) (= main_~j~0 0))} is VALID [2022-04-28 03:58:29,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {481#(and (or (and (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0)) (not (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0))) (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~j~0) 4294967296))) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296))) (and (= main_~i~0 0) (< (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)))) (= main_~j~0 0))} [61] L23-3_primed-->L23-3: Formula: (not (< (mod v_main_~l~0_2 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} OutVars{main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {482#(and (or (and (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0)) (not (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0))) (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~j~0) 4294967296))) (and (= main_~i~0 0) (< (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)))) (= main_~j~0 0))} is VALID [2022-04-28 03:58:29,955 INFO L272 TraceCheckUtils]: 11: Hoare triple {482#(and (or (and (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0)) (not (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0))) (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~j~0) 4294967296))) (and (= main_~i~0 0) (< (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)))) (= main_~j~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {483#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:58:29,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {483#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {484#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:58:29,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {484#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {476#false} is VALID [2022-04-28 03:58:29,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {476#false} assume !false; {476#false} is VALID [2022-04-28 03:58:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:58:29,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:29,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609160919] [2022-04-28 03:58:29,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609160919] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:58:29,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611498656] [2022-04-28 03:58:29,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:29,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:58:29,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:58:29,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:58:30,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 03:58:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:30,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:58:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:30,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:58:30,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {475#true} is VALID [2022-04-28 03:58:30,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {475#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {475#true} is VALID [2022-04-28 03:58:30,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {475#true} assume true; {475#true} is VALID [2022-04-28 03:58:30,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {475#true} {475#true} #56#return; {475#true} is VALID [2022-04-28 03:58:30,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {475#true} call #t~ret5 := main(); {475#true} is VALID [2022-04-28 03:58:30,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {475#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {475#true} is VALID [2022-04-28 03:58:30,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~l~0 := 0; {480#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:58:30,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [62] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~j~0_8 v_main_~j~0_7)) (.cse3 (< (mod v_main_~l~0_19 4294967296) (mod v_main_~n~0_10 4294967296))) (.cse2 (= (mod v_main_~l~0_19 2) 0)) (.cse1 (= v_main_~l~0_19 v_main_~l~0_18))) (or (and .cse0 (= v_main_~n~0_10 v_main_~n~0_10) .cse1) (and (not .cse2) (= (+ v_main_~l~0_19 v_main_~j~0_7) (+ v_main_~l~0_18 v_main_~j~0_8)) .cse3 (< v_main_~l~0_19 v_main_~l~0_18) (< (div (* v_main_~l~0_18 (- 1)) (- 2)) (+ 2 (div v_main_~l~0_19 2)))) (and .cse0 (or (not .cse3) .cse2) .cse1))) InVars {main_~l~0=v_main_~l~0_19, main_~n~0=v_main_~n~0_10, main_~j~0=v_main_~j~0_8} OutVars{main_~l~0=v_main_~l~0_18, main_~n~0=v_main_~n~0_10, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~l~0, main_~j~0] {480#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:58:30,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {480#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [63] L23-3_primed-->L23-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {480#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:58:30,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {480#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [64] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_15 v_main_~i~0_14)) (.cse1 (= v_main_~l~0_21 v_main_~l~0_20)) (.cse2 (< (mod v_main_~l~0_21 4294967296) (mod v_main_~n~0_11 4294967296))) (.cse3 (= (mod v_main_~l~0_21 2) 0))) (or (and (= v_main_~n~0_11 v_main_~n~0_11) .cse0 .cse1) (and .cse0 (or (not .cse2) (not .cse3)) .cse1) (and (<= (div (+ v_main_~i~0_15 (* v_main_~i~0_14 (- 1)) (* v_main_~l~0_21 (- 1)) 1) (- 2)) (+ (div (+ v_main_~l~0_21 (- 1)) 2) 1)) (= (+ v_main_~i~0_15 v_main_~l~0_20) (+ v_main_~i~0_14 v_main_~l~0_21)) (< v_main_~i~0_15 v_main_~i~0_14) .cse2 .cse3))) InVars {main_~i~0=v_main_~i~0_15, main_~l~0=v_main_~l~0_21, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_14, main_~l~0=v_main_~l~0_20, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[main_~l~0, main_~i~0] {516#(and (or (and (< 0 main_~i~0) (= main_~i~0 main_~l~0) (< 0 (mod main_~n~0 4294967296)) (<= (div (+ (* (- 1) main_~i~0) 1) (- 2)) 0)) (and (= main_~l~0 0) (= main_~i~0 0))) (= main_~j~0 0))} is VALID [2022-04-28 03:58:30,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {516#(and (or (and (< 0 main_~i~0) (= main_~i~0 main_~l~0) (< 0 (mod main_~n~0 4294967296)) (<= (div (+ (* (- 1) main_~i~0) 1) (- 2)) 0)) (and (= main_~l~0 0) (= main_~i~0 0))) (= main_~j~0 0))} [61] L23-3_primed-->L23-3: Formula: (not (< (mod v_main_~l~0_2 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} OutVars{main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {520#(and (or (and (< 0 main_~i~0) (= main_~i~0 main_~l~0) (<= (div (+ (* (- 1) main_~i~0) 1) (- 2)) 0)) (and (= main_~l~0 0) (= main_~i~0 0))) (= main_~j~0 0))} is VALID [2022-04-28 03:58:30,413 INFO L272 TraceCheckUtils]: 11: Hoare triple {520#(and (or (and (< 0 main_~i~0) (= main_~i~0 main_~l~0) (<= (div (+ (* (- 1) main_~i~0) 1) (- 2)) 0)) (and (= main_~l~0 0) (= main_~i~0 0))) (= main_~j~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {524#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:58:30,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {524#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {528#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:58:30,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {528#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {476#false} is VALID [2022-04-28 03:58:30,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {476#false} assume !false; {476#false} is VALID [2022-04-28 03:58:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:58:30,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:59:13,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {476#false} assume !false; {476#false} is VALID [2022-04-28 03:59:13,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {528#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {476#false} is VALID [2022-04-28 03:59:13,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {524#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {528#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:59:13,204 INFO L272 TraceCheckUtils]: 11: Hoare triple {544#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {524#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:59:13,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {548#(or (< (mod main_~l~0 4294967296) (mod main_~n~0 4294967296)) (= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296)))} [61] L23-3_primed-->L23-3: Formula: (not (< (mod v_main_~l~0_2 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} OutVars{main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {544#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 03:59:15,209 WARN L290 TraceCheckUtils]: 9: Hoare triple {552#(and (or (and (<= (+ (div (+ (* (- 1) main_~i~0) main_~l~0 (* (- 1) main_~j~0)) (- 4294967296)) (div (+ (* (- 1) main_~l~0) (- 1)) (- 4294967296))) (+ 2 (div (+ main_~i~0 main_~j~0 (- 4294967296)) 4294967296))) (<= (div (+ (- 1) (* (- 1) main_~i~0) (* (- 1) main_~j~0)) (- 4294967296)) (+ (div (+ (- 1) (* (- 1) main_~i~0) main_~l~0 (* (- 1) main_~j~0)) (- 4294967296)) (div (+ main_~l~0 (- 4294967296)) 4294967296) 1))) (<= (div (+ (* (- 1) main_~l~0) (- 1) (mod main_~n~0 4294967296)) (- 4294967296)) (+ (div (+ main_~l~0 (- 4294967296)) 4294967296) 1))) (or (not (= (mod main_~l~0 2) 0)) (<= (div (+ (* (- 1) (div (+ (- 1) main_~l~0) 2)) (- 1) (div (+ (- 2) (mod main_~n~0 4294967296)) 2)) (- 2147483648)) (+ (div (+ main_~l~0 (- 4294967295)) 4294967296) 1)) (and (<= (+ (div (+ (* (- 1) main_~l~0) (mod main_~n~0 4294967296) main_~i~0 main_~j~0 (- 4294967296)) (- 4294967296)) (div (+ (* (- 1) main_~l~0) (- 1) main_~i~0 main_~j~0) 4294967296)) 0) (<= (+ (div (+ (mod main_~n~0 4294967296) (- 4294967296)) (- 4294967296)) (div (+ (* (- 1) (div (+ (- 1) main_~l~0) 2)) (- 1) (div (+ (* (- 1) main_~i~0) (- 2) main_~l~0 (* (- 1) main_~j~0)) 2)) (- 2147483648))) (+ (div (+ main_~l~0 (- 4294967295)) 4294967296) (div (+ (* (- 1) main_~l~0) main_~i~0 main_~j~0) 4294967296) 3)))))} [64] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_15 v_main_~i~0_14)) (.cse1 (= v_main_~l~0_21 v_main_~l~0_20)) (.cse2 (< (mod v_main_~l~0_21 4294967296) (mod v_main_~n~0_11 4294967296))) (.cse3 (= (mod v_main_~l~0_21 2) 0))) (or (and (= v_main_~n~0_11 v_main_~n~0_11) .cse0 .cse1) (and .cse0 (or (not .cse2) (not .cse3)) .cse1) (and (<= (div (+ v_main_~i~0_15 (* v_main_~i~0_14 (- 1)) (* v_main_~l~0_21 (- 1)) 1) (- 2)) (+ (div (+ v_main_~l~0_21 (- 1)) 2) 1)) (= (+ v_main_~i~0_15 v_main_~l~0_20) (+ v_main_~i~0_14 v_main_~l~0_21)) (< v_main_~i~0_15 v_main_~i~0_14) .cse2 .cse3))) InVars {main_~i~0=v_main_~i~0_15, main_~l~0=v_main_~l~0_21, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_14, main_~l~0=v_main_~l~0_20, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[main_~l~0, main_~i~0] {548#(or (< (mod main_~l~0 4294967296) (mod main_~n~0 4294967296)) (= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296)))} is UNKNOWN [2022-04-28 03:59:15,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {552#(and (or (and (<= (+ (div (+ (* (- 1) main_~i~0) main_~l~0 (* (- 1) main_~j~0)) (- 4294967296)) (div (+ (* (- 1) main_~l~0) (- 1)) (- 4294967296))) (+ 2 (div (+ main_~i~0 main_~j~0 (- 4294967296)) 4294967296))) (<= (div (+ (- 1) (* (- 1) main_~i~0) (* (- 1) main_~j~0)) (- 4294967296)) (+ (div (+ (- 1) (* (- 1) main_~i~0) main_~l~0 (* (- 1) main_~j~0)) (- 4294967296)) (div (+ main_~l~0 (- 4294967296)) 4294967296) 1))) (<= (div (+ (* (- 1) main_~l~0) (- 1) (mod main_~n~0 4294967296)) (- 4294967296)) (+ (div (+ main_~l~0 (- 4294967296)) 4294967296) 1))) (or (not (= (mod main_~l~0 2) 0)) (<= (div (+ (* (- 1) (div (+ (- 1) main_~l~0) 2)) (- 1) (div (+ (- 2) (mod main_~n~0 4294967296)) 2)) (- 2147483648)) (+ (div (+ main_~l~0 (- 4294967295)) 4294967296) 1)) (and (<= (+ (div (+ (* (- 1) main_~l~0) (mod main_~n~0 4294967296) main_~i~0 main_~j~0 (- 4294967296)) (- 4294967296)) (div (+ (* (- 1) main_~l~0) (- 1) main_~i~0 main_~j~0) 4294967296)) 0) (<= (+ (div (+ (mod main_~n~0 4294967296) (- 4294967296)) (- 4294967296)) (div (+ (* (- 1) (div (+ (- 1) main_~l~0) 2)) (- 1) (div (+ (* (- 1) main_~i~0) (- 2) main_~l~0 (* (- 1) main_~j~0)) 2)) (- 2147483648))) (+ (div (+ main_~l~0 (- 4294967295)) 4294967296) (div (+ (* (- 1) main_~l~0) main_~i~0 main_~j~0) 4294967296) 3)))))} [63] L23-3_primed-->L23-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {552#(and (or (and (<= (+ (div (+ (* (- 1) main_~i~0) main_~l~0 (* (- 1) main_~j~0)) (- 4294967296)) (div (+ (* (- 1) main_~l~0) (- 1)) (- 4294967296))) (+ 2 (div (+ main_~i~0 main_~j~0 (- 4294967296)) 4294967296))) (<= (div (+ (- 1) (* (- 1) main_~i~0) (* (- 1) main_~j~0)) (- 4294967296)) (+ (div (+ (- 1) (* (- 1) main_~i~0) main_~l~0 (* (- 1) main_~j~0)) (- 4294967296)) (div (+ main_~l~0 (- 4294967296)) 4294967296) 1))) (<= (div (+ (* (- 1) main_~l~0) (- 1) (mod main_~n~0 4294967296)) (- 4294967296)) (+ (div (+ main_~l~0 (- 4294967296)) 4294967296) 1))) (or (not (= (mod main_~l~0 2) 0)) (<= (div (+ (* (- 1) (div (+ (- 1) main_~l~0) 2)) (- 1) (div (+ (- 2) (mod main_~n~0 4294967296)) 2)) (- 2147483648)) (+ (div (+ main_~l~0 (- 4294967295)) 4294967296) 1)) (and (<= (+ (div (+ (* (- 1) main_~l~0) (mod main_~n~0 4294967296) main_~i~0 main_~j~0 (- 4294967296)) (- 4294967296)) (div (+ (* (- 1) main_~l~0) (- 1) main_~i~0 main_~j~0) 4294967296)) 0) (<= (+ (div (+ (mod main_~n~0 4294967296) (- 4294967296)) (- 4294967296)) (div (+ (* (- 1) (div (+ (- 1) main_~l~0) 2)) (- 1) (div (+ (* (- 1) main_~i~0) (- 2) main_~l~0 (* (- 1) main_~j~0)) 2)) (- 2147483648))) (+ (div (+ main_~l~0 (- 4294967295)) 4294967296) (div (+ (* (- 1) main_~l~0) main_~i~0 main_~j~0) 4294967296) 3)))))} is VALID [2022-04-28 03:59:16,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {544#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [62] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~j~0_8 v_main_~j~0_7)) (.cse3 (< (mod v_main_~l~0_19 4294967296) (mod v_main_~n~0_10 4294967296))) (.cse2 (= (mod v_main_~l~0_19 2) 0)) (.cse1 (= v_main_~l~0_19 v_main_~l~0_18))) (or (and .cse0 (= v_main_~n~0_10 v_main_~n~0_10) .cse1) (and (not .cse2) (= (+ v_main_~l~0_19 v_main_~j~0_7) (+ v_main_~l~0_18 v_main_~j~0_8)) .cse3 (< v_main_~l~0_19 v_main_~l~0_18) (< (div (* v_main_~l~0_18 (- 1)) (- 2)) (+ 2 (div v_main_~l~0_19 2)))) (and .cse0 (or (not .cse3) .cse2) .cse1))) InVars {main_~l~0=v_main_~l~0_19, main_~n~0=v_main_~n~0_10, main_~j~0=v_main_~j~0_8} OutVars{main_~l~0=v_main_~l~0_18, main_~n~0=v_main_~n~0_10, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~l~0, main_~j~0] {552#(and (or (and (<= (+ (div (+ (* (- 1) main_~i~0) main_~l~0 (* (- 1) main_~j~0)) (- 4294967296)) (div (+ (* (- 1) main_~l~0) (- 1)) (- 4294967296))) (+ 2 (div (+ main_~i~0 main_~j~0 (- 4294967296)) 4294967296))) (<= (div (+ (- 1) (* (- 1) main_~i~0) (* (- 1) main_~j~0)) (- 4294967296)) (+ (div (+ (- 1) (* (- 1) main_~i~0) main_~l~0 (* (- 1) main_~j~0)) (- 4294967296)) (div (+ main_~l~0 (- 4294967296)) 4294967296) 1))) (<= (div (+ (* (- 1) main_~l~0) (- 1) (mod main_~n~0 4294967296)) (- 4294967296)) (+ (div (+ main_~l~0 (- 4294967296)) 4294967296) 1))) (or (not (= (mod main_~l~0 2) 0)) (<= (div (+ (* (- 1) (div (+ (- 1) main_~l~0) 2)) (- 1) (div (+ (- 2) (mod main_~n~0 4294967296)) 2)) (- 2147483648)) (+ (div (+ main_~l~0 (- 4294967295)) 4294967296) 1)) (and (<= (+ (div (+ (* (- 1) main_~l~0) (mod main_~n~0 4294967296) main_~i~0 main_~j~0 (- 4294967296)) (- 4294967296)) (div (+ (* (- 1) main_~l~0) (- 1) main_~i~0 main_~j~0) 4294967296)) 0) (<= (+ (div (+ (mod main_~n~0 4294967296) (- 4294967296)) (- 4294967296)) (div (+ (* (- 1) (div (+ (- 1) main_~l~0) 2)) (- 1) (div (+ (* (- 1) main_~i~0) (- 2) main_~l~0 (* (- 1) main_~j~0)) 2)) (- 2147483648))) (+ (div (+ main_~l~0 (- 4294967295)) 4294967296) (div (+ (* (- 1) main_~l~0) main_~i~0 main_~j~0) 4294967296) 3)))))} is VALID [2022-04-28 03:59:16,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~l~0 := 0; {544#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 03:59:16,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {475#true} havoc ~n~0;havoc ~i~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {475#true} is VALID [2022-04-28 03:59:16,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {475#true} call #t~ret5 := main(); {475#true} is VALID [2022-04-28 03:59:16,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {475#true} {475#true} #56#return; {475#true} is VALID [2022-04-28 03:59:16,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {475#true} assume true; {475#true} is VALID [2022-04-28 03:59:16,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {475#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {475#true} is VALID [2022-04-28 03:59:16,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {475#true} is VALID [2022-04-28 03:59:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:59:16,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611498656] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:59:16,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:59:16,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-28 03:59:16,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:59:16,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [860745575] [2022-04-28 03:59:16,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [860745575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:59:16,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:59:16,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:59:16,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636907855] [2022-04-28 03:59:16,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:59:16,470 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:59:16,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:59:16,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:16,482 WARN L143 InductivityCheck]: Transition 585#(and (= main_~j~0 1) (= main_~i~0 1) (< (mod (+ main_~l~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~l~0) 1)) ( _ , assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); , 482#(and (or (and (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0)) (not (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0))) (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~j~0) 4294967296))) (and (= main_~i~0 0) (< (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)))) (= main_~j~0 0)) ) not inductive [2022-04-28 03:59:16,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 03:59:16,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:59:16,683 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 03:59:16,686 INFO L158 Benchmark]: Toolchain (without parser) took 50988.42ms. Allocated memory was 184.5MB in the beginning and 354.4MB in the end (delta: 169.9MB). Free memory was 129.5MB in the beginning and 292.2MB in the end (delta: -162.7MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-28 03:59:16,686 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:59:16,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.73ms. Allocated memory was 184.5MB in the beginning and 287.3MB in the end (delta: 102.8MB). Free memory was 129.4MB in the beginning and 258.2MB in the end (delta: -128.8MB). Peak memory consumption was 5.1MB. Max. memory is 8.0GB. [2022-04-28 03:59:16,687 INFO L158 Benchmark]: Boogie Preprocessor took 33.74ms. Allocated memory is still 287.3MB. Free memory was 258.2MB in the beginning and 256.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 03:59:16,687 INFO L158 Benchmark]: RCFGBuilder took 279.32ms. Allocated memory is still 287.3MB. Free memory was 256.7MB in the beginning and 245.6MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 03:59:16,687 INFO L158 Benchmark]: TraceAbstraction took 50460.79ms. Allocated memory was 287.3MB in the beginning and 354.4MB in the end (delta: 67.1MB). Free memory was 245.3MB in the beginning and 292.2MB in the end (delta: -47.0MB). Peak memory consumption was 21.1MB. Max. memory is 8.0GB. [2022-04-28 03:59:16,688 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.09ms. Allocated memory is still 184.5MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.73ms. Allocated memory was 184.5MB in the beginning and 287.3MB in the end (delta: 102.8MB). Free memory was 129.4MB in the beginning and 258.2MB in the end (delta: -128.8MB). Peak memory consumption was 5.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.74ms. Allocated memory is still 287.3MB. Free memory was 258.2MB in the beginning and 256.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 279.32ms. Allocated memory is still 287.3MB. Free memory was 256.7MB in the beginning and 245.6MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 50460.79ms. Allocated memory was 287.3MB in the beginning and 354.4MB in the end (delta: 67.1MB). Free memory was 245.3MB in the beginning and 292.2MB in the end (delta: -47.0MB). Peak memory consumption was 21.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 03:59:16,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...