/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:28:47,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:28:47,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:28:47,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:28:47,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:28:47,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:28:47,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:28:47,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:28:47,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:28:47,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:28:47,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:28:47,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:28:47,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:28:47,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:28:47,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:28:47,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:28:47,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:28:47,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:28:47,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:28:47,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:28:47,526 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:28:47,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:28:47,529 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:28:47,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:28:47,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:28:47,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:28:47,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:28:47,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:28:47,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:28:47,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:28:47,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:28:47,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:28:47,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:28:47,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:28:47,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:28:47,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:28:47,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:28:47,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:28:47,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:28:47,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:28:47,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:28:47,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:28:47,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:28:47,556 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:28:47,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:28:47,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:28:47,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:28:47,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:28:47,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:28:47,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:28:47,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:28:47,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:28:47,559 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:28:47,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:28:47,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:28:47,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:28:47,559 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:28:47,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:28:47,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:28:47,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:28:47,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:28:47,560 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:28:47,560 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:28:47,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:28:47,560 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:28:47,560 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 10:28:47,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:28:47,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:28:47,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:28:47,764 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:28:47,765 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:28:47,766 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-28 10:28:47,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30257218c/72a916328da540318e169822d2948798/FLAGa2a41b78f [2022-04-28 10:28:48,209 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:28:48,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-28 10:28:48,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30257218c/72a916328da540318e169822d2948798/FLAGa2a41b78f [2022-04-28 10:28:48,225 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30257218c/72a916328da540318e169822d2948798 [2022-04-28 10:28:48,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:28:48,229 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:28:48,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:28:48,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:28:48,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:28:48,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:28:48" (1/1) ... [2022-04-28 10:28:48,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12cae766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:48, skipping insertion in model container [2022-04-28 10:28:48,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:28:48" (1/1) ... [2022-04-28 10:28:48,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:28:48,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:28:48,381 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/sumt6.c[403,416] [2022-04-28 10:28:48,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:28:48,412 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:28:48,423 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/sumt6.c[403,416] [2022-04-28 10:28:48,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:28:48,443 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:28:48,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:48 WrapperNode [2022-04-28 10:28:48,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:28:48,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:28:48,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:28:48,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:28:48,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:48" (1/1) ... [2022-04-28 10:28:48,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:48" (1/1) ... [2022-04-28 10:28:48,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:48" (1/1) ... [2022-04-28 10:28:48,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:48" (1/1) ... [2022-04-28 10:28:48,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:48" (1/1) ... [2022-04-28 10:28:48,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:48" (1/1) ... [2022-04-28 10:28:48,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:48" (1/1) ... [2022-04-28 10:28:48,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:28:48,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:28:48,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:28:48,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:28:48,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:48" (1/1) ... [2022-04-28 10:28:48,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:28:48,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:28:48,507 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 10:28:48,540 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 10:28:48,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:28:48,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:28:48,555 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:28:48,555 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:28:48,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:28:48,555 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:28:48,555 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:28:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:28:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:28:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:28:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:28:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:28:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:28:48,556 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:28:48,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:28:48,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:28:48,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:28:48,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:28:48,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:28:48,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:28:48,604 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:28:48,605 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:28:55,253 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:28:55,257 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:28:55,257 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:28:55,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:28:55 BoogieIcfgContainer [2022-04-28 10:28:55,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:28:55,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:28:55,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:28:55,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:28:55,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:28:48" (1/3) ... [2022-04-28 10:28:55,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339eeb0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:28:55, skipping insertion in model container [2022-04-28 10:28:55,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:28:48" (2/3) ... [2022-04-28 10:28:55,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339eeb0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:28:55, skipping insertion in model container [2022-04-28 10:28:55,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:28:55" (3/3) ... [2022-04-28 10:28:55,267 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt6.c [2022-04-28 10:28:55,276 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:28:55,276 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:28:55,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:28:55,317 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@5b6e861c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5256f6ed [2022-04-28 10:28:55,317 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:28:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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 10:28:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:28:55,326 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:28:55,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:28:55,327 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:28:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:28:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash 503999003, now seen corresponding path program 1 times [2022-04-28 10:28:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:55,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1151928200] [2022-04-28 10:28:55,343 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:28:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash 503999003, now seen corresponding path program 2 times [2022-04-28 10:28:55,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:28:55,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379362348] [2022-04-28 10:28:55,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:28:55,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:28:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:28:55,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:28:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:28:55,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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; {29#true} is VALID [2022-04-28 10:28:55,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 10:28:55,524 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #76#return; {29#true} is VALID [2022-04-28 10:28:55,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:28:55,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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; {29#true} is VALID [2022-04-28 10:28:55,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 10:28:55,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #76#return; {29#true} is VALID [2022-04-28 10:28:55,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2022-04-28 10:28:55,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {29#true} is VALID [2022-04-28 10:28:55,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {29#true} is VALID [2022-04-28 10:28:55,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-28 10:28:55,527 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-28 10:28:55,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-28 10:28:55,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-28 10:28:55,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-28 10:28:55,528 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 10:28:55,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:28:55,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379362348] [2022-04-28 10:28:55,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379362348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:28:55,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:28:55,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:28:55,531 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:28:55,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1151928200] [2022-04-28 10:28:55,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1151928200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:28:55,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:28:55,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:28:55,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872722458] [2022-04-28 10:28:55,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:28:55,535 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 10:28:55,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:28:55,538 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 10:28:55,551 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 10:28:55,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:28:55,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:28:55,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:28:55,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:28:55,569 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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 10:29:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:02,160 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-28 10:29:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:29:02,160 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 10:29:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:29:02,161 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 10:29:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-28 10:29:02,169 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 10:29:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-28 10:29:02,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-28 10:29:02,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:02,241 INFO L225 Difference]: With dead ends: 38 [2022-04-28 10:29:02,241 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 10:29:02,243 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 10:29:02,245 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 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 10:29:02,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:29:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 10:29:02,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 10:29:02,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:29:02,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:02,265 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:02,265 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:02,267 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-28 10:29:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-28 10:29:02,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:02,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:02,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:29:02,268 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 10:29:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:02,269 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-28 10:29:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-28 10:29:02,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:02,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:02,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:29:02,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:29:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-28 10:29:02,272 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2022-04-28 10:29:02,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:29:02,273 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-28 10:29:02,273 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 10:29:02,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 24 transitions. [2022-04-28 10:29:02,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:02,298 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-28 10:29:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:29:02,298 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:29:02,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:29:02,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:29:02,299 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:29:02,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:29:02,299 INFO L85 PathProgramCache]: Analyzing trace with hash 475369852, now seen corresponding path program 1 times [2022-04-28 10:29:02,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:02,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1008442765] [2022-04-28 10:29:02,300 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:29:02,300 INFO L85 PathProgramCache]: Analyzing trace with hash 475369852, now seen corresponding path program 2 times [2022-04-28 10:29:02,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:29:02,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110759867] [2022-04-28 10:29:02,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:29:02,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:29:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:02,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:29:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:02,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {197#(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; {189#true} is VALID [2022-04-28 10:29:02,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2022-04-28 10:29:02,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #76#return; {189#true} is VALID [2022-04-28 10:29:02,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {197#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:29:02,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#(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; {189#true} is VALID [2022-04-28 10:29:02,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#true} assume true; {189#true} is VALID [2022-04-28 10:29:02,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} #76#return; {189#true} is VALID [2022-04-28 10:29:02,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {189#true} call #t~ret5 := main(); {189#true} is VALID [2022-04-28 10:29:02,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:02,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:02,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:02,572 INFO L272 TraceCheckUtils]: 8: Hoare triple {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:29:02,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {195#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {196#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:29:02,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {196#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {190#false} is VALID [2022-04-28 10:29:02,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#false} assume !false; {190#false} is VALID [2022-04-28 10:29:02,573 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 10:29:02,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:29:02,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110759867] [2022-04-28 10:29:02,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110759867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:02,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:02,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:29:02,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:29:02,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1008442765] [2022-04-28 10:29:02,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1008442765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:02,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:02,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:29:02,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412306416] [2022-04-28 10:29:02,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:29:02,575 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 10:29:02,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:29:02,576 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 10:29:02,586 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 10:29:02,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:29:02,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:02,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:29:02,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:29:02,587 INFO L87 Difference]: Start difference. First operand 19 states and 24 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 10:29:04,694 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:09,040 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:17,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:19,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:22,322 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-28 10:29:22,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:29:22,323 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 10:29:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:29:22,323 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 10:29:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 10:29:22,325 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 10:29:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 10:29:22,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-28 10:29:22,360 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 10:29:22,362 INFO L225 Difference]: With dead ends: 26 [2022-04-28 10:29:22,362 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 10:29:22,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:29:22,363 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:29:22,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 4 Unknown, 0 Unchecked, 8.6s Time] [2022-04-28 10:29:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 10:29:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-28 10:29:22,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:29:22,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:22,368 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:22,368 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:22,369 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-28 10:29:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-28 10:29:22,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:22,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:22,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:29:22,370 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 10:29:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:22,372 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-28 10:29:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-28 10:29:22,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:22,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:22,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:29:22,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:29:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-04-28 10:29:22,373 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-04-28 10:29:22,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:29:22,374 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-04-28 10:29:22,374 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 10:29:22,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 25 transitions. [2022-04-28 10:29:22,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:22,406 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-28 10:29:22,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:29:22,407 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:29:22,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:29:22,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:29:22,407 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:29:22,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:29:22,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1279795021, now seen corresponding path program 1 times [2022-04-28 10:29:22,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:22,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [990919325] [2022-04-28 10:29:22,427 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:29:22,427 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:29:22,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1279795021, now seen corresponding path program 2 times [2022-04-28 10:29:22,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:29:22,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880496257] [2022-04-28 10:29:22,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:29:22,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:29:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:22,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:29:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:23,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {352#(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; {340#true} is VALID [2022-04-28 10:29:23,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 10:29:23,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {340#true} {340#true} #76#return; {340#true} is VALID [2022-04-28 10:29:23,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {352#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:29:23,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {352#(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; {340#true} is VALID [2022-04-28 10:29:23,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 10:29:23,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #76#return; {340#true} is VALID [2022-04-28 10:29:23,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret5 := main(); {340#true} is VALID [2022-04-28 10:29:23,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:23,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:23,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {346#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:23,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {346#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {347#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v2~0)) (<= 1 main_~v2~0) (<= main_~v2~0 1) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:23,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {347#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v2~0)) (<= 1 main_~v2~0) (<= main_~v2~0 1) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {348#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= main_~v2~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:23,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {348#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= main_~v2~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {349#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v2~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:23,021 INFO L272 TraceCheckUtils]: 11: Hoare triple {349#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v2~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:29:23,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {350#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {351#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:29:23,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {351#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {341#false} is VALID [2022-04-28 10:29:23,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-28 10:29:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:23,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:29:23,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880496257] [2022-04-28 10:29:23,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880496257] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:29:23,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772292216] [2022-04-28 10:29:23,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:29:23,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:29:23,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:29:23,035 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 10:29:23,037 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 10:29:23,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:29:23,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:29:23,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:29:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:29:23,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:29:23,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2022-04-28 10:29:23,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#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; {340#true} is VALID [2022-04-28 10:29:23,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 10:29:23,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #76#return; {340#true} is VALID [2022-04-28 10:29:23,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret5 := main(); {340#true} is VALID [2022-04-28 10:29:23,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:23,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:23,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:23,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {380#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:23,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {380#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {384#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:23,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {384#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {384#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:29:23,482 INFO L272 TraceCheckUtils]: 11: Hoare triple {384#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {391#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:29:23,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {391#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {395#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:29:23,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {395#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {341#false} is VALID [2022-04-28 10:29:23,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-28 10:29:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:29:23,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:29:23,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-28 10:29:23,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {395#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {341#false} is VALID [2022-04-28 10:29:23,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {391#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {395#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:29:23,738 INFO L272 TraceCheckUtils]: 11: Hoare triple {411#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {391#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:29:23,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {411#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {411#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:29:23,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {418#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {411#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:29:25,855 WARN L290 TraceCheckUtils]: 8: Hoare triple {411#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {418#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:29:25,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {411#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:29:25,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {411#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {411#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:29:25,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {411#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:29:25,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret5 := main(); {340#true} is VALID [2022-04-28 10:29:25,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #76#return; {340#true} is VALID [2022-04-28 10:29:25,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 10:29:25,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#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; {340#true} is VALID [2022-04-28 10:29:25,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2022-04-28 10:29:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:29:25,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772292216] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:29:25,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:29:25,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-28 10:29:25,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:29:25,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [990919325] [2022-04-28 10:29:25,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [990919325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:29:25,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:29:25,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:29:25,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961557959] [2022-04-28 10:29:25,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:29:25,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:29:25,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:29:25,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:28,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:28,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:29:28,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:29:28,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:29:28,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:29:28,009 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:30,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:36,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:38,750 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:43,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:49,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:51,813 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:56,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:29:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:56,316 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-28 10:29:56,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:29:56,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 10:29:56,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:29:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:56,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-28 10:29:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-28 10:29:56,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-28 10:29:58,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:29:58,459 INFO L225 Difference]: With dead ends: 28 [2022-04-28 10:29:58,459 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:29:58,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:29:58,460 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:29:58,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 7 Unknown, 0 Unchecked, 14.7s Time] [2022-04-28 10:29:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:29:58,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-28 10:29:58,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:29:58,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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 10:29:58,464 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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 10:29:58,464 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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 10:29:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:58,465 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 10:29:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 10:29:58,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:58,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:58,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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 23 states. [2022-04-28 10:29:58,466 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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 23 states. [2022-04-28 10:29:58,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:29:58,467 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 10:29:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 10:29:58,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:29:58,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:29:58,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:29:58,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:29:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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 10:29:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-28 10:29:58,468 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2022-04-28 10:29:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:29:58,468 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-28 10:29:58,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:29:58,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 28 transitions. [2022-04-28 10:30:00,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 10:30:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:30:00,632 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:30:00,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:30:00,648 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 10:30:00,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:00,832 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:30:00,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:30:00,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1309439716, now seen corresponding path program 1 times [2022-04-28 10:30:00,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:00,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1779558802] [2022-04-28 10:30:00,839 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:30:00,839 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:30:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1309439716, now seen corresponding path program 2 times [2022-04-28 10:30:00,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:30:00,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282208931] [2022-04-28 10:30:00,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:30:00,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:30:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:01,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:30:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:01,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {604#(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; {605#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:30:01,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {605#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:30:01,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {605#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {596#true} #76#return; {601#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:30:01,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {596#true} call ULTIMATE.init(); {604#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:30:01,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {604#(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; {605#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:30:01,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {605#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:30:01,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {596#true} #76#return; {601#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:30:01,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {601#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:30:01,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {602#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:30:01,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {602#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {603#(= main_~l~0 0)} is VALID [2022-04-28 10:30:01,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {603#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {603#(= main_~l~0 0)} is VALID [2022-04-28 10:30:01,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {603#(= main_~l~0 0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {597#false} is VALID [2022-04-28 10:30:01,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {597#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {597#false} is VALID [2022-04-28 10:30:01,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {597#false} ~l~0 := 1 + ~l~0; {597#false} is VALID [2022-04-28 10:30:01,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {597#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {597#false} is VALID [2022-04-28 10:30:01,094 INFO L272 TraceCheckUtils]: 12: Hoare triple {597#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {597#false} is VALID [2022-04-28 10:30:01,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {597#false} ~cond := #in~cond; {597#false} is VALID [2022-04-28 10:30:01,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {597#false} assume 0 == ~cond; {597#false} is VALID [2022-04-28 10:30:01,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {597#false} assume !false; {597#false} is VALID [2022-04-28 10:30:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:01,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:30:01,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282208931] [2022-04-28 10:30:01,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282208931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:30:01,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:30:01,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:30:01,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:30:01,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1779558802] [2022-04-28 10:30:01,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1779558802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:30:01,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:30:01,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:30:01,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381191456] [2022-04-28 10:30:01,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:30:01,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 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) Word has length 16 [2022-04-28 10:30:01,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:30:01,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 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 10:30:03,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:03,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:30:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:03,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:30:03,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:30:03,299 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 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 10:30:07,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:09,755 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:14,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:16,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:20,826 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-04-28 10:30:20,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:30:20,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 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) Word has length 16 [2022-04-28 10:30:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:30:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 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 10:30:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 10:30:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 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 10:30:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 10:30:20,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-28 10:30:23,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:23,040 INFO L225 Difference]: With dead ends: 37 [2022-04-28 10:30:23,040 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 10:30:23,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:30:23,041 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:30:23,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 27 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 4 Unknown, 0 Unchecked, 8.1s Time] [2022-04-28 10:30:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 10:30:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-28 10:30:23,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:30:23,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:23,067 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:23,067 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:23,068 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-28 10:30:23,068 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-28 10:30:23,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:23,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:23,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 10:30:23,069 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 10:30:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:30:23,070 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-28 10:30:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-28 10:30:23,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:30:23,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:30:23,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:30:23,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:30:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-28 10:30:23,071 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2022-04-28 10:30:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:30:23,072 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-28 10:30:23,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 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 10:30:23,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 30 transitions. [2022-04-28 10:30:27,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 28 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-28 10:30:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:30:27,345 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:30:27,345 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:30:27,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 10:30:27,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:30:27,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:30:27,345 INFO L85 PathProgramCache]: Analyzing trace with hash 57783349, now seen corresponding path program 1 times [2022-04-28 10:30:27,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:27,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1727948261] [2022-04-28 10:30:27,349 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:30:27,350 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:30:27,350 INFO L85 PathProgramCache]: Analyzing trace with hash 57783349, now seen corresponding path program 2 times [2022-04-28 10:30:27,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:30:27,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093627814] [2022-04-28 10:30:27,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:30:27,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:30:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:27,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:30:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:27,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {793#(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; {794#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:30:27,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {794#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {794#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:30:27,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {794#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {784#true} #76#return; {789#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:30:27,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {793#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:30:27,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {793#(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; {794#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:30:27,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {794#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {794#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:30:27,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {794#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {784#true} #76#return; {789#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:30:27,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {789#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {789#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:30:27,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {789#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {790#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:30:27,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {790#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {791#(= main_~l~0 0)} is VALID [2022-04-28 10:30:27,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {791#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {791#(= main_~l~0 0)} is VALID [2022-04-28 10:30:27,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {791#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {791#(= main_~l~0 0)} is VALID [2022-04-28 10:30:27,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {791#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {792#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-28 10:30:27,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {792#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {792#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-28 10:30:27,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {792#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {792#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-28 10:30:27,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {792#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {785#false} is VALID [2022-04-28 10:30:27,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {785#false} ~l~0 := 1 + ~l~0; {785#false} is VALID [2022-04-28 10:30:27,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {785#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {785#false} is VALID [2022-04-28 10:30:27,638 INFO L272 TraceCheckUtils]: 15: Hoare triple {785#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {785#false} is VALID [2022-04-28 10:30:27,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {785#false} ~cond := #in~cond; {785#false} is VALID [2022-04-28 10:30:27,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {785#false} assume 0 == ~cond; {785#false} is VALID [2022-04-28 10:30:27,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-04-28 10:30:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:27,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:30:27,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093627814] [2022-04-28 10:30:27,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093627814] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:30:27,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618562635] [2022-04-28 10:30:27,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:30:27,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:30:27,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:30:27,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:30:27,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 10:30:27,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:30:27,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:30:27,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:30:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:30:27,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:30:28,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2022-04-28 10:30:28,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#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; {784#true} is VALID [2022-04-28 10:30:28,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-28 10:30:28,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #76#return; {784#true} is VALID [2022-04-28 10:30:28,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret5 := main(); {784#true} is VALID [2022-04-28 10:30:28,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {813#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:28,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {813#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {813#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:28,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {813#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {813#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:28,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {813#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {823#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:28,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {823#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {827#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:28,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {827#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {827#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:28,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {827#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {827#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:30:28,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {827#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {837#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-28 10:30:28,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {837#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {841#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-28 10:30:28,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {841#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {841#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-28 10:30:28,133 INFO L272 TraceCheckUtils]: 15: Hoare triple {841#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {848#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:30:28,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {848#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {852#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:30:28,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {852#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {785#false} is VALID [2022-04-28 10:30:28,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-04-28 10:30:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:30:28,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:30:28,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-04-28 10:30:28,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {852#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {785#false} is VALID [2022-04-28 10:30:28,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {848#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {852#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:30:28,403 INFO L272 TraceCheckUtils]: 15: Hoare triple {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {848#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:30:28,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:30:28,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {875#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:30:30,521 WARN L290 TraceCheckUtils]: 12: Hoare triple {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {875#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:30:30,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:30:30,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:30:30,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:30:32,635 WARN L290 TraceCheckUtils]: 8: Hoare triple {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {875#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:30:32,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:30:32,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:30:32,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {868#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:30:32,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret5 := main(); {784#true} is VALID [2022-04-28 10:30:32,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #76#return; {784#true} is VALID [2022-04-28 10:30:32,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-28 10:30:32,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#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; {784#true} is VALID [2022-04-28 10:30:32,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2022-04-28 10:30:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 10:30:32,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618562635] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:30:32,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:30:32,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 9] total 17 [2022-04-28 10:30:32,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:30:32,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1727948261] [2022-04-28 10:30:32,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1727948261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:30:32,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:30:32,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:30:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080441522] [2022-04-28 10:30:32,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:30:32,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:30:32,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:30:32,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:36,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 15 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:30:36,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:30:36,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:30:36,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:30:36,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:30:36,874 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:30:41,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:43,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:45,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:54,151 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:30:58,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:31:00,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:31:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:31:00,826 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-28 10:31:00,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:31:00,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 10:31:00,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:31:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:00,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-28 10:31:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-28 10:31:00,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-28 10:31:05,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 33 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:05,078 INFO L225 Difference]: With dead ends: 33 [2022-04-28 10:31:05,078 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 10:31:05,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:31:05,079 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:31:05,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 5 Unknown, 0 Unchecked, 12.3s Time] [2022-04-28 10:31:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 10:31:05,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-04-28 10:31:05,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:31:05,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 10:31:05,104 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 10:31:05,104 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 10:31:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:31:05,106 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-28 10:31:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-28 10:31:05,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:31:05,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:31:05,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 28 states. [2022-04-28 10:31:05,107 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 28 states. [2022-04-28 10:31:05,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:31:05,110 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-28 10:31:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-28 10:31:05,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:31:05,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:31:05,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:31:05,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:31:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 10:31:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-28 10:31:05,111 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-04-28 10:31:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:31:05,111 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-28 10:31:05,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:05,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 32 transitions. [2022-04-28 10:31:09,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 30 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-28 10:31:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:31:09,377 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:31:09,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:31:09,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 10:31:09,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:31:09,577 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:31:09,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:31:09,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2070632639, now seen corresponding path program 1 times [2022-04-28 10:31:09,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:31:09,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [120823668] [2022-04-28 10:31:09,583 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:31:09,583 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:31:09,583 INFO L85 PathProgramCache]: Analyzing trace with hash -2070632639, now seen corresponding path program 2 times [2022-04-28 10:31:09,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:31:09,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15672508] [2022-04-28 10:31:09,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:31:09,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:31:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:31:09,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:31:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:31:09,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {1098#(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; {1091#true} is VALID [2022-04-28 10:31:09,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {1091#true} assume true; {1091#true} is VALID [2022-04-28 10:31:09,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1091#true} {1091#true} #76#return; {1091#true} is VALID [2022-04-28 10:31:09,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {1091#true} call ULTIMATE.init(); {1098#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:31:09,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {1098#(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; {1091#true} is VALID [2022-04-28 10:31:09,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {1091#true} assume true; {1091#true} is VALID [2022-04-28 10:31:09,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1091#true} {1091#true} #76#return; {1091#true} is VALID [2022-04-28 10:31:09,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {1091#true} call #t~ret5 := main(); {1091#true} is VALID [2022-04-28 10:31:09,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {1091#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1096#(= main_~l~0 0)} is VALID [2022-04-28 10:31:09,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {1096#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1096#(= main_~l~0 0)} is VALID [2022-04-28 10:31:09,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {1096#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1096#(= main_~l~0 0)} is VALID [2022-04-28 10:31:09,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {1096#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1096#(= main_~l~0 0)} is VALID [2022-04-28 10:31:09,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {1096#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1097#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:31:09,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {1097#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1097#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:31:09,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {1097#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1097#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:31:09,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {1097#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1097#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:31:09,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {1097#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {1092#false} is VALID [2022-04-28 10:31:09,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {1092#false} ~l~0 := 1 + ~l~0; {1092#false} is VALID [2022-04-28 10:31:09,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {1092#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1092#false} is VALID [2022-04-28 10:31:09,672 INFO L272 TraceCheckUtils]: 16: Hoare triple {1092#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1092#false} is VALID [2022-04-28 10:31:09,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {1092#false} ~cond := #in~cond; {1092#false} is VALID [2022-04-28 10:31:09,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {1092#false} assume 0 == ~cond; {1092#false} is VALID [2022-04-28 10:31:09,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {1092#false} assume !false; {1092#false} is VALID [2022-04-28 10:31:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:31:09,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:31:09,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15672508] [2022-04-28 10:31:09,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15672508] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:31:09,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504963169] [2022-04-28 10:31:09,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:31:09,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:31:09,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:31:09,676 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:31:09,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 10:31:09,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:31:09,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:31:09,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:31:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:31:09,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:31:10,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {1091#true} call ULTIMATE.init(); {1091#true} is VALID [2022-04-28 10:31:10,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {1091#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; {1091#true} is VALID [2022-04-28 10:31:10,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {1091#true} assume true; {1091#true} is VALID [2022-04-28 10:31:10,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1091#true} {1091#true} #76#return; {1091#true} is VALID [2022-04-28 10:31:10,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {1091#true} call #t~ret5 := main(); {1091#true} is VALID [2022-04-28 10:31:10,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {1091#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1117#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:10,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {1117#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1117#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:10,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {1117#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1117#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:10,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {1117#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1127#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:10,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {1127#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1131#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:10,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {1131#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1131#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:10,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {1131#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1131#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:10,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {1131#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1131#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:10,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {1131#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {1144#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:10,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {1144#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1148#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:10,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {1148#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1148#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:10,135 INFO L272 TraceCheckUtils]: 16: Hoare triple {1148#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1155#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:31:10,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {1155#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1159#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:31:10,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {1159#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1092#false} is VALID [2022-04-28 10:31:10,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {1092#false} assume !false; {1092#false} is VALID [2022-04-28 10:31:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:31:10,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:31:10,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {1092#false} assume !false; {1092#false} is VALID [2022-04-28 10:31:10,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {1159#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1092#false} is VALID [2022-04-28 10:31:10,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {1155#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1159#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:31:10,370 INFO L272 TraceCheckUtils]: 16: Hoare triple {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1155#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:31:10,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:10,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {1182#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:10,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {1182#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-28 10:31:10,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:10,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:10,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:10,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {1182#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:12,514 WARN L290 TraceCheckUtils]: 8: Hoare triple {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1182#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:31:12,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:12,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:12,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {1091#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1175#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:12,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {1091#true} call #t~ret5 := main(); {1091#true} is VALID [2022-04-28 10:31:12,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1091#true} {1091#true} #76#return; {1091#true} is VALID [2022-04-28 10:31:12,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {1091#true} assume true; {1091#true} is VALID [2022-04-28 10:31:12,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {1091#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; {1091#true} is VALID [2022-04-28 10:31:12,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {1091#true} call ULTIMATE.init(); {1091#true} is VALID [2022-04-28 10:31:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 10:31:12,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504963169] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:31:12,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:31:12,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-28 10:31:12,517 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:31:12,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [120823668] [2022-04-28 10:31:12,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [120823668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:31:12,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:31:12,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:31:12,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193338703] [2022-04-28 10:31:12,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:31:12,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:31:12,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:31:12,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:14,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:14,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:31:14,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:31:14,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:31:14,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:31:14,690 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:18,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:31:21,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:31:23,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:31:25,458 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:31:29,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:31:31,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:31:32,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:31:32,175 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-28 10:31:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:31:32,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 10:31:32,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:31:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-28 10:31:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-28 10:31:32,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-28 10:31:34,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:34,366 INFO L225 Difference]: With dead ends: 40 [2022-04-28 10:31:34,366 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 10:31:34,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:31:34,367 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:31:34,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 6 Unknown, 0 Unchecked, 12.4s Time] [2022-04-28 10:31:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 10:31:34,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-28 10:31:34,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:31:34,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 10:31:34,409 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 10:31:34,409 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 10:31:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:31:34,410 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-28 10:31:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-28 10:31:34,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:31:34,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:31:34,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 35 states. [2022-04-28 10:31:34,411 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 35 states. [2022-04-28 10:31:34,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:31:34,412 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-28 10:31:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-28 10:31:34,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:31:34,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:31:34,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:31:34,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:31:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 10:31:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-28 10:31:34,414 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 20 [2022-04-28 10:31:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:31:34,414 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-28 10:31:34,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:34,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2022-04-28 10:31:47,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 40 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-28 10:31:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:31:47,273 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:31:47,273 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:31:47,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 10:31:47,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:31:47,474 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:31:47,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:31:47,474 INFO L85 PathProgramCache]: Analyzing trace with hash 810499578, now seen corresponding path program 1 times [2022-04-28 10:31:47,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:31:47,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1290426961] [2022-04-28 10:31:47,479 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:31:47,479 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:31:47,480 INFO L85 PathProgramCache]: Analyzing trace with hash 810499578, now seen corresponding path program 2 times [2022-04-28 10:31:47,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:31:47,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807401489] [2022-04-28 10:31:47,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:31:47,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:31:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:31:47,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:31:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:31:47,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {1459#(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; {1460#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:31:47,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {1460#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1460#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:31:47,851 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1460#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1447#true} #76#return; {1452#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:31:47,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {1447#true} call ULTIMATE.init(); {1459#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:31:47,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {1459#(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; {1460#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:31:47,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {1460#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1460#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:31:47,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1460#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1447#true} #76#return; {1452#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:31:47,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {1452#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {1452#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:31:47,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {1452#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1453#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:31:47,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {1453#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1454#(= main_~l~0 0)} is VALID [2022-04-28 10:31:47,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {1454#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1454#(= main_~l~0 0)} is VALID [2022-04-28 10:31:47,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {1454#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1454#(= main_~l~0 0)} is VALID [2022-04-28 10:31:47,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {1454#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1455#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:31:47,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {1455#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1456#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:31:47,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {1456#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1456#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:31:47,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {1456#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1456#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:31:47,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {1456#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1456#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:31:47,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {1456#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1457#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-28 10:31:47,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {1457#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} ~l~0 := 1 + ~l~0; {1458#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-28 10:31:47,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {1458#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1448#false} is VALID [2022-04-28 10:31:47,869 INFO L272 TraceCheckUtils]: 17: Hoare triple {1448#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1448#false} is VALID [2022-04-28 10:31:47,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {1448#false} ~cond := #in~cond; {1448#false} is VALID [2022-04-28 10:31:47,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {1448#false} assume 0 == ~cond; {1448#false} is VALID [2022-04-28 10:31:47,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {1448#false} assume !false; {1448#false} is VALID [2022-04-28 10:31:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:31:47,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:31:47,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807401489] [2022-04-28 10:31:47,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807401489] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:31:47,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949130694] [2022-04-28 10:31:47,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:31:47,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:31:47,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:31:47,875 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:31:47,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 10:31:47,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:31:47,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:31:47,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:31:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:31:47,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:31:48,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {1447#true} call ULTIMATE.init(); {1447#true} is VALID [2022-04-28 10:31:48,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {1447#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; {1447#true} is VALID [2022-04-28 10:31:48,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {1447#true} assume true; {1447#true} is VALID [2022-04-28 10:31:48,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1447#true} {1447#true} #76#return; {1447#true} is VALID [2022-04-28 10:31:48,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {1447#true} call #t~ret5 := main(); {1447#true} is VALID [2022-04-28 10:31:48,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {1447#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1479#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:48,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {1479#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1479#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:48,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {1479#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1479#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:48,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {1479#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1489#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:48,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {1489#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1493#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:48,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {1493#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1493#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:48,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {1493#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1493#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:48,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {1493#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1493#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:48,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {1493#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1493#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:48,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {1493#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1509#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:48,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {1509#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1513#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:48,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {1513#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1513#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:31:48,474 INFO L272 TraceCheckUtils]: 17: Hoare triple {1513#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1520#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:31:48,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {1520#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1524#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:31:48,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {1524#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1448#false} is VALID [2022-04-28 10:31:48,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {1448#false} assume !false; {1448#false} is VALID [2022-04-28 10:31:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:31:48,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:31:48,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {1448#false} assume !false; {1448#false} is VALID [2022-04-28 10:31:48,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {1524#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1448#false} is VALID [2022-04-28 10:31:48,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {1520#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1524#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:31:48,787 INFO L272 TraceCheckUtils]: 17: Hoare triple {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1520#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:31:48,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:48,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {1547#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:50,915 WARN L290 TraceCheckUtils]: 14: Hoare triple {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1547#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:31:50,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:50,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:50,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:50,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:50,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {1547#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:53,052 WARN L290 TraceCheckUtils]: 8: Hoare triple {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1547#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:31:53,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:53,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:53,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {1447#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1540#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:31:53,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {1447#true} call #t~ret5 := main(); {1447#true} is VALID [2022-04-28 10:31:53,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1447#true} {1447#true} #76#return; {1447#true} is VALID [2022-04-28 10:31:53,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {1447#true} assume true; {1447#true} is VALID [2022-04-28 10:31:53,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {1447#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; {1447#true} is VALID [2022-04-28 10:31:53,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {1447#true} call ULTIMATE.init(); {1447#true} is VALID [2022-04-28 10:31:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 10:31:53,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949130694] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:31:53,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:31:53,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 20 [2022-04-28 10:31:53,055 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:31:53,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1290426961] [2022-04-28 10:31:53,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1290426961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:31:53,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:31:53,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:31:53,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467919177] [2022-04-28 10:31:53,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:31:53,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 10:31:53,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:31:53,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:57,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 17 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:31:57,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:31:57,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:31:57,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:31:57,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:31:57,330 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:31:59,409 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:32:01,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:32:03,814 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:32:06,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:32:10,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:32:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:10,603 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2022-04-28 10:32:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:32:10,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 10:32:10,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:32:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-28 10:32:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-28 10:32:10,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-28 10:32:14,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:32:14,897 INFO L225 Difference]: With dead ends: 45 [2022-04-28 10:32:14,897 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 10:32:14,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:32:14,898 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:32:14,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 10.4s Time] [2022-04-28 10:32:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 10:32:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-04-28 10:32:14,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:32:14,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 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 10:32:14,937 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 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 10:32:14,937 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 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 10:32:14,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:14,938 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-28 10:32:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-28 10:32:14,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:32:14,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:32:14,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 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 40 states. [2022-04-28 10:32:14,939 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 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 40 states. [2022-04-28 10:32:14,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:14,940 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-28 10:32:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-28 10:32:14,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:32:14,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:32:14,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:32:14,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:32:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 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 10:32:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2022-04-28 10:32:14,941 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 21 [2022-04-28 10:32:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:32:14,941 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2022-04-28 10:32:14,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:14,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 48 transitions. [2022-04-28 10:32:27,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 42 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-28 10:32:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-28 10:32:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:32:27,763 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:32:27,763 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:32:27,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 10:32:27,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:32:27,963 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:32:27,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:32:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1848843560, now seen corresponding path program 1 times [2022-04-28 10:32:27,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:32:27,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1628784918] [2022-04-28 10:32:27,976 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:32:27,976 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:32:27,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1848843560, now seen corresponding path program 2 times [2022-04-28 10:32:27,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:32:27,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893298754] [2022-04-28 10:32:27,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:32:27,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:32:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:32:28,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:32:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:32:28,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {1853#(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; {1854#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:32:28,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {1854#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1854#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:32:28,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1854#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1837#true} #76#return; {1842#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:32:28,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {1837#true} call ULTIMATE.init(); {1853#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:32:28,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {1853#(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; {1854#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:32:28,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {1854#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1854#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:32:28,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1854#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1837#true} #76#return; {1842#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:32:28,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {1842#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {1842#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:32:28,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {1842#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1843#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)) (= main_~v3~0 0))} is VALID [2022-04-28 10:32:28,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {1843#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1844#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:32:28,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {1844#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1844#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:32:28,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {1844#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1845#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (<= (div (+ 4294967294 main_~v2~0) 4294967296) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:32:28,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {1845#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (<= (div (+ 4294967294 main_~v2~0) 4294967296) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1846#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-28 10:32:28,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {1846#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1847#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-28 10:32:28,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {1847#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1847#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-28 10:32:28,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {1847#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1847#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-28 10:32:28,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {1847#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1847#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-28 10:32:28,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {1847#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1847#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-28 10:32:28,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {1847#(and (= main_~k~0 0) (= main_~j~0 0) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {1848#(and (<= (+ (* (div (+ main_~k~0 main_~v2~0 4294967293) 4294967296) 4294967296) 1) main_~l~0) (<= (+ main_~l~0 1) (+ main_~k~0 main_~v2~0)) (<= (+ main_~l~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~k~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-28 10:32:28,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {1848#(and (<= (+ (* (div (+ main_~k~0 main_~v2~0 4294967293) 4294967296) 4294967296) 1) main_~l~0) (<= (+ main_~l~0 1) (+ main_~k~0 main_~v2~0)) (<= (+ main_~l~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~k~0 (* (div main_~l~0 4294967296) 4294967296) main_~v2~0)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0) (<= (div main_~l~0 4294967296) 0))} ~l~0 := 1 + ~l~0; {1849#(and (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~k~0 main_~v2~0)) (<= (+ main_~k~0 main_~v2~0) main_~l~0))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:32:28,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {1849#(and (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~k~0 main_~v2~0)) (<= (+ main_~k~0 main_~v2~0) main_~l~0))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1850#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:32:28,823 INFO L272 TraceCheckUtils]: 18: Hoare triple {1850#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1851#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:32:28,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {1851#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1852#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:32:28,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {1852#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1838#false} is VALID [2022-04-28 10:32:28,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {1838#false} assume !false; {1838#false} is VALID [2022-04-28 10:32:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:32:28,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:32:28,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893298754] [2022-04-28 10:32:28,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893298754] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:32:28,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85326030] [2022-04-28 10:32:28,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:32:28,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:32:28,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:32:28,825 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:32:28,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 10:32:28,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:32:28,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:32:28,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:32:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:32:28,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:32:30,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {1837#true} call ULTIMATE.init(); {1837#true} is VALID [2022-04-28 10:32:30,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {1837#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; {1837#true} is VALID [2022-04-28 10:32:30,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-28 10:32:30,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1837#true} {1837#true} #76#return; {1837#true} is VALID [2022-04-28 10:32:30,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {1837#true} call #t~ret5 := main(); {1837#true} is VALID [2022-04-28 10:32:30,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {1837#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1844#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:32:30,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {1844#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1844#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:32:30,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {1844#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1844#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:32:30,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {1844#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1845#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (<= (div (+ 4294967294 main_~v2~0) 4294967296) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:32:30,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {1845#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (<= (div (+ 4294967294 main_~v2~0) 4294967296) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1846#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-28 10:32:30,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {1846#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1846#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-28 10:32:30,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {1846#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1846#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-28 10:32:30,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {1846#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1846#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-28 10:32:30,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {1846#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1846#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-28 10:32:30,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {1846#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1846#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-28 10:32:30,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {1846#(and (<= 1 main_~v2~0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {1903#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} is VALID [2022-04-28 10:32:30,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {1903#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= main_~k~0 1) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0) (<= (+ (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296) 1) main_~l~0) (<= (div main_~l~0 4294967296) 0))} ~l~0 := 1 + ~l~0; {1907#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= main_~k~0 1) (= main_~i~0 0) (<= (+ 2 (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296)) main_~l~0) (= main_~v4~0 0) (<= (div (+ (- 1) main_~l~0) 4294967296) 0) (<= main_~l~0 (+ main_~v2~0 1)) (= main_~v3~0 0))} is VALID [2022-04-28 10:32:30,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {1907#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= main_~k~0 1) (= main_~i~0 0) (<= (+ 2 (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296)) main_~l~0) (= main_~v4~0 0) (<= (div (+ (- 1) main_~l~0) 4294967296) 0) (<= main_~l~0 (+ main_~v2~0 1)) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1907#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= main_~k~0 1) (= main_~i~0 0) (<= (+ 2 (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296)) main_~l~0) (= main_~v4~0 0) (<= (div (+ (- 1) main_~l~0) 4294967296) 0) (<= main_~l~0 (+ main_~v2~0 1)) (= main_~v3~0 0))} is VALID [2022-04-28 10:32:30,824 INFO L272 TraceCheckUtils]: 18: Hoare triple {1907#(and (<= 1 main_~v2~0) (= main_~j~0 0) (= main_~k~0 1) (= main_~i~0 0) (<= (+ 2 (* (div (+ 4294967294 main_~v2~0) 4294967296) 4294967296)) main_~l~0) (= main_~v4~0 0) (<= (div (+ (- 1) main_~l~0) 4294967296) 0) (<= main_~l~0 (+ main_~v2~0 1)) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1914#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:32:30,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {1914#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1918#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:32:30,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {1918#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1838#false} is VALID [2022-04-28 10:32:30,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {1838#false} assume !false; {1838#false} is VALID [2022-04-28 10:32:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:32:30,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:32:31,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {1838#false} assume !false; {1838#false} is VALID [2022-04-28 10:32:31,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {1918#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1838#false} is VALID [2022-04-28 10:32:31,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {1914#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1918#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:32:31,223 INFO L272 TraceCheckUtils]: 18: Hoare triple {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1914#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:32:31,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:32:31,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {1941#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:32:31,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {1941#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-28 10:32:31,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:32:31,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:32:31,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:32:31,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:32:31,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:32:31,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {1941#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:32:31,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1941#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-28 10:32:31,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:32:31,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:32:31,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {1837#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1934#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:32:31,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {1837#true} call #t~ret5 := main(); {1837#true} is VALID [2022-04-28 10:32:31,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1837#true} {1837#true} #76#return; {1837#true} is VALID [2022-04-28 10:32:31,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-28 10:32:31,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {1837#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; {1837#true} is VALID [2022-04-28 10:32:31,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {1837#true} call ULTIMATE.init(); {1837#true} is VALID [2022-04-28 10:32:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 10:32:31,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85326030] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:32:31,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:32:31,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14, 9] total 21 [2022-04-28 10:32:31,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:32:31,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1628784918] [2022-04-28 10:32:31,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1628784918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:32:31,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:32:31,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:32:31,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662112323] [2022-04-28 10:32:31,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:32:31,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 10:32:31,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:32:31,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:33,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:32:33,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:32:33,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:32:33,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:32:33,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:32:33,420 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:35,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:32:37,622 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:32:39,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:32:42,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:32:44,153 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:32:46,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:32:48,477 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:32:50,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:32:52,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:32:55,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:32:55,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:55,249 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-04-28 10:32:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:32:55,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 10:32:55,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:32:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-28 10:32:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:55,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-28 10:32:55,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-28 10:32:57,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:32:57,511 INFO L225 Difference]: With dead ends: 53 [2022-04-28 10:32:57,511 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 10:32:57,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:32:57,512 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:32:57,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 10 Unknown, 0 Unchecked, 20.8s Time] [2022-04-28 10:32:57,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 10:32:57,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 10:32:57,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:32:57,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 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 10:32:57,555 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 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 10:32:57,555 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 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 10:32:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:57,558 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-28 10:32:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-28 10:32:57,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:32:57,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:32:57,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 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 48 states. [2022-04-28 10:32:57,558 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 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 48 states. [2022-04-28 10:32:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:32:57,559 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-28 10:32:57,560 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-28 10:32:57,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:32:57,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:32:57,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:32:57,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:32:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 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 10:32:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2022-04-28 10:32:57,561 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 22 [2022-04-28 10:32:57,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:32:57,561 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2022-04-28 10:32:57,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:32:57,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 70 transitions. [2022-04-28 10:33:14,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 62 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-28 10:33:14,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:33:14,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:33:14,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:33:14,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 10:33:14,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:14,963 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:33:14,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:33:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1315888599, now seen corresponding path program 1 times [2022-04-28 10:33:14,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:14,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [133462357] [2022-04-28 10:33:14,980 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:33:14,980 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:33:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1315888599, now seen corresponding path program 2 times [2022-04-28 10:33:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:33:14,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164603308] [2022-04-28 10:33:14,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:33:14,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:33:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:33:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:15,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {2299#(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; {2292#true} is VALID [2022-04-28 10:33:15,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {2292#true} assume true; {2292#true} is VALID [2022-04-28 10:33:15,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2292#true} {2292#true} #76#return; {2292#true} is VALID [2022-04-28 10:33:15,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {2292#true} call ULTIMATE.init(); {2299#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:33:15,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {2299#(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; {2292#true} is VALID [2022-04-28 10:33:15,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {2292#true} assume true; {2292#true} is VALID [2022-04-28 10:33:15,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2292#true} {2292#true} #76#return; {2292#true} is VALID [2022-04-28 10:33:15,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {2292#true} call #t~ret5 := main(); {2292#true} is VALID [2022-04-28 10:33:15,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {2292#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2297#(= main_~l~0 0)} is VALID [2022-04-28 10:33:15,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {2297#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2297#(= main_~l~0 0)} is VALID [2022-04-28 10:33:15,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {2297#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2297#(= main_~l~0 0)} is VALID [2022-04-28 10:33:15,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {2297#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2297#(= main_~l~0 0)} is VALID [2022-04-28 10:33:15,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {2297#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {2298#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:33:15,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {2298#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2298#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:33:15,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {2298#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2298#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:33:15,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {2298#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2298#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-28 10:33:15,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {2298#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {2293#false} is VALID [2022-04-28 10:33:15,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {2293#false} ~l~0 := 1 + ~l~0; {2293#false} is VALID [2022-04-28 10:33:15,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {2293#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2293#false} is VALID [2022-04-28 10:33:15,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {2293#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2293#false} is VALID [2022-04-28 10:33:15,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {2293#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2293#false} is VALID [2022-04-28 10:33:15,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {2293#false} ~l~0 := 1 + ~l~0; {2293#false} is VALID [2022-04-28 10:33:15,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {2293#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2293#false} is VALID [2022-04-28 10:33:15,063 INFO L272 TraceCheckUtils]: 20: Hoare triple {2293#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2293#false} is VALID [2022-04-28 10:33:15,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {2293#false} ~cond := #in~cond; {2293#false} is VALID [2022-04-28 10:33:15,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {2293#false} assume 0 == ~cond; {2293#false} is VALID [2022-04-28 10:33:15,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {2293#false} assume !false; {2293#false} is VALID [2022-04-28 10:33:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:33:15,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:33:15,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164603308] [2022-04-28 10:33:15,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164603308] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:15,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52608221] [2022-04-28 10:33:15,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:33:15,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:33:15,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:33:15,066 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:33:15,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 10:33:15,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:33:15,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:33:15,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:33:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:33:15,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:33:15,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {2292#true} call ULTIMATE.init(); {2292#true} is VALID [2022-04-28 10:33:15,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {2292#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; {2292#true} is VALID [2022-04-28 10:33:15,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {2292#true} assume true; {2292#true} is VALID [2022-04-28 10:33:15,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2292#true} {2292#true} #76#return; {2292#true} is VALID [2022-04-28 10:33:15,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {2292#true} call #t~ret5 := main(); {2292#true} is VALID [2022-04-28 10:33:15,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {2292#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2318#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:33:15,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {2318#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2318#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:33:15,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {2318#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2318#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:33:15,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {2318#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2328#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:33:15,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {2328#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2332#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:33:15,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {2332#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2332#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:33:15,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {2332#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2332#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:33:15,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {2332#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2332#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:33:15,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {2332#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {2345#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:33:15,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {2345#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2349#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:33:15,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {2349#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2349#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:33:15,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {2349#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2349#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:33:15,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {2349#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2359#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-28 10:33:15,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {2359#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 1))} ~l~0 := 1 + ~l~0; {2363#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-28 10:33:15,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {2363#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2363#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-28 10:33:15,635 INFO L272 TraceCheckUtils]: 20: Hoare triple {2363#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2370#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:33:15,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {2370#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2374#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:33:15,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {2374#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2293#false} is VALID [2022-04-28 10:33:15,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {2293#false} assume !false; {2293#false} is VALID [2022-04-28 10:33:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:33:15,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:33:15,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {2293#false} assume !false; {2293#false} is VALID [2022-04-28 10:33:15,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {2374#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2293#false} is VALID [2022-04-28 10:33:15,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {2370#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2374#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:33:15,907 INFO L272 TraceCheckUtils]: 20: Hoare triple {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2370#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:33:15,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:33:15,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {2397#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:33:18,029 WARN L290 TraceCheckUtils]: 17: Hoare triple {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2397#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:33:18,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:33:18,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:33:18,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {2397#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:33:18,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {2397#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-28 10:33:18,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:33:18,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:33:18,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:33:18,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {2397#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:33:20,175 WARN L290 TraceCheckUtils]: 8: Hoare triple {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2397#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:33:20,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:33:20,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:33:20,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {2292#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2390#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:33:20,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {2292#true} call #t~ret5 := main(); {2292#true} is VALID [2022-04-28 10:33:20,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2292#true} {2292#true} #76#return; {2292#true} is VALID [2022-04-28 10:33:20,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {2292#true} assume true; {2292#true} is VALID [2022-04-28 10:33:20,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {2292#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; {2292#true} is VALID [2022-04-28 10:33:20,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {2292#true} call ULTIMATE.init(); {2292#true} is VALID [2022-04-28 10:33:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 10:33:20,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52608221] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:33:20,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:33:20,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-28 10:33:20,184 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:33:20,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [133462357] [2022-04-28 10:33:20,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [133462357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:33:20,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:33:20,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:33:20,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809209527] [2022-04-28 10:33:20,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:33:20,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:33:20,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:33:20,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:24,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 17 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:24,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:33:24,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:33:24,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:33:24,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:33:24,478 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:26,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:33:28,749 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:33:30,992 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:33:33,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:33:35,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:33:37,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:33:37,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:37,737 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2022-04-28 10:33:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:33:37,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 10:33:37,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:33:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-28 10:33:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-28 10:33:37,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-28 10:33:42,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:33:42,050 INFO L225 Difference]: With dead ends: 59 [2022-04-28 10:33:42,050 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 10:33:42,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:33:42,050 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:33:42,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 6 Unknown, 0 Unchecked, 12.4s Time] [2022-04-28 10:33:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 10:33:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-04-28 10:33:42,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:33:42,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 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 10:33:42,104 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 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 10:33:42,104 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 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 10:33:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:42,105 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-28 10:33:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-28 10:33:42,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:42,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:42,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 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 54 states. [2022-04-28 10:33:42,106 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 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 54 states. [2022-04-28 10:33:42,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:33:42,107 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-28 10:33:42,107 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-28 10:33:42,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:33:42,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:33:42,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:33:42,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:33:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 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 10:33:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2022-04-28 10:33:42,109 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 24 [2022-04-28 10:33:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:33:42,109 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2022-04-28 10:33:42,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:33:42,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 66 transitions. [2022-04-28 10:34:01,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 57 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:01,520 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2022-04-28 10:34:01,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:34:01,520 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:34:01,520 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:34:01,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 10:34:01,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:01,721 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:34:01,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:34:01,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1010807906, now seen corresponding path program 1 times [2022-04-28 10:34:01,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:01,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [948452976] [2022-04-28 10:34:01,728 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:34:01,728 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:34:01,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1010807906, now seen corresponding path program 2 times [2022-04-28 10:34:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:34:01,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009370170] [2022-04-28 10:34:01,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:34:01,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:34:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:01,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:34:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:02,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {2783#(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; {2784#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:34:02,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {2784#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {2784#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:34:02,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2784#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2772#true} #76#return; {2777#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:34:02,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {2772#true} call ULTIMATE.init(); {2783#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:34:02,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {2783#(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; {2784#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:34:02,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {2784#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {2784#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-28 10:34:02,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2784#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2772#true} #76#return; {2777#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:34:02,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {2777#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {2777#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:34:02,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {2777#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2778#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:34:02,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {2778#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2779#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:34:02,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {2779#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2779#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:34:02,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {2779#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2779#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:34:02,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {2779#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {2780#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-28 10:34:02,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {2780#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2780#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-28 10:34:02,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {2780#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2780#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-28 10:34:02,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {2780#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2780#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-28 10:34:02,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {2780#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2780#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-28 10:34:02,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {2780#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {2780#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-28 10:34:02,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {2780#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 4) 4) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {2781#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0))))} is VALID [2022-04-28 10:34:02,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {2781#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2782#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-28 10:34:02,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {2782#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2782#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-28 10:34:02,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {2782#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2773#false} is VALID [2022-04-28 10:34:02,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {2773#false} ~l~0 := 1 + ~l~0; {2773#false} is VALID [2022-04-28 10:34:02,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {2773#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2773#false} is VALID [2022-04-28 10:34:02,030 INFO L272 TraceCheckUtils]: 21: Hoare triple {2773#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2773#false} is VALID [2022-04-28 10:34:02,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {2773#false} ~cond := #in~cond; {2773#false} is VALID [2022-04-28 10:34:02,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {2773#false} assume 0 == ~cond; {2773#false} is VALID [2022-04-28 10:34:02,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {2773#false} assume !false; {2773#false} is VALID [2022-04-28 10:34:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:02,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:34:02,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009370170] [2022-04-28 10:34:02,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009370170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:34:02,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187093572] [2022-04-28 10:34:02,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:34:02,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:02,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:34:02,032 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:34:02,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 10:34:02,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:34:02,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:34:02,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:34:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:02,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:34:02,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {2772#true} call ULTIMATE.init(); {2772#true} is VALID [2022-04-28 10:34:02,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {2772#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; {2772#true} is VALID [2022-04-28 10:34:02,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {2772#true} assume true; {2772#true} is VALID [2022-04-28 10:34:02,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2772#true} {2772#true} #76#return; {2772#true} is VALID [2022-04-28 10:34:02,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {2772#true} call #t~ret5 := main(); {2772#true} is VALID [2022-04-28 10:34:02,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {2772#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2803#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:02,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {2803#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2803#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:02,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {2803#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2803#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:02,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {2803#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2813#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:02,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {2813#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2817#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:02,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {2817#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2817#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:02,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {2817#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2817#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:02,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {2817#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2817#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:02,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {2817#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2817#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:02,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {2817#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {2833#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:02,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {2833#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2837#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:02,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {2837#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2837#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:02,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {2837#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2837#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:02,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {2837#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2847#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0))} is VALID [2022-04-28 10:34:02,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {2847#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {2851#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0))} is VALID [2022-04-28 10:34:02,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {2851#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2851#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0))} is VALID [2022-04-28 10:34:02,674 INFO L272 TraceCheckUtils]: 21: Hoare triple {2851#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:34:02,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {2858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:34:02,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {2862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2773#false} is VALID [2022-04-28 10:34:02,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {2773#false} assume !false; {2773#false} is VALID [2022-04-28 10:34:02,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:02,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:34:03,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {2773#false} assume !false; {2773#false} is VALID [2022-04-28 10:34:03,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {2862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2773#false} is VALID [2022-04-28 10:34:03,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {2858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:34:03,075 INFO L272 TraceCheckUtils]: 21: Hoare triple {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:34:03,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:03,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {2885#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:05,196 WARN L290 TraceCheckUtils]: 18: Hoare triple {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2885#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:34:05,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:05,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:05,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {2885#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:07,317 WARN L290 TraceCheckUtils]: 14: Hoare triple {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {2885#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:34:07,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:07,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:07,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:07,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:07,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {2885#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:09,449 WARN L290 TraceCheckUtils]: 8: Hoare triple {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {2885#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:34:09,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:09,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:09,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {2772#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2878#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:09,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {2772#true} call #t~ret5 := main(); {2772#true} is VALID [2022-04-28 10:34:09,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2772#true} {2772#true} #76#return; {2772#true} is VALID [2022-04-28 10:34:09,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {2772#true} assume true; {2772#true} is VALID [2022-04-28 10:34:09,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {2772#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; {2772#true} is VALID [2022-04-28 10:34:09,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {2772#true} call ULTIMATE.init(); {2772#true} is VALID [2022-04-28 10:34:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 10:34:09,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187093572] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:34:09,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:34:09,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 21 [2022-04-28 10:34:09,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:34:09,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [948452976] [2022-04-28 10:34:09,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [948452976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:34:09,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:34:09,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:34:09,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525573065] [2022-04-28 10:34:09,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:34:09,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 10:34:09,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:34:09,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:15,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 17 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:15,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:34:15,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:15,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:34:15,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:34:15,844 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:17,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:34:20,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:34:22,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:34:24,589 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:34:26,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:34:29,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:29,022 INFO L93 Difference]: Finished difference Result 56 states and 81 transitions. [2022-04-28 10:34:29,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:34:29,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 10:34:29,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:34:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-28 10:34:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-28 10:34:29,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-28 10:34:33,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:33,315 INFO L225 Difference]: With dead ends: 56 [2022-04-28 10:34:33,315 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 10:34:33,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:34:33,316 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:34:33,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 10.2s Time] [2022-04-28 10:34:33,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 10:34:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-04-28 10:34:33,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:34:33,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 10:34:33,360 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 10:34:33,361 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 10:34:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:33,362 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-28 10:34:33,362 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-28 10:34:33,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:33,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:33,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 51 states. [2022-04-28 10:34:33,363 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 51 states. [2022-04-28 10:34:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:34:33,363 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-28 10:34:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-28 10:34:33,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:34:33,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:34:33,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:34:33,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:34:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 10:34:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2022-04-28 10:34:33,365 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 25 [2022-04-28 10:34:33,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:34:33,365 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2022-04-28 10:34:33,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:33,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 58 transitions. [2022-04-28 10:34:48,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 51 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-04-28 10:34:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:34:48,346 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:34:48,346 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:34:48,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 10:34:48,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:48,559 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:34:48,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:34:48,559 INFO L85 PathProgramCache]: Analyzing trace with hash 430197904, now seen corresponding path program 1 times [2022-04-28 10:34:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:48,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [140647383] [2022-04-28 10:34:48,566 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:34:48,566 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:34:48,566 INFO L85 PathProgramCache]: Analyzing trace with hash 430197904, now seen corresponding path program 2 times [2022-04-28 10:34:48,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:34:48,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121483163] [2022-04-28 10:34:48,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:34:48,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:34:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:48,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:34:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:48,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {3249#(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; {3241#true} is VALID [2022-04-28 10:34:48,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {3241#true} assume true; {3241#true} is VALID [2022-04-28 10:34:48,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3241#true} {3241#true} #76#return; {3241#true} is VALID [2022-04-28 10:34:48,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {3241#true} call ULTIMATE.init(); {3249#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:34:48,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {3249#(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; {3241#true} is VALID [2022-04-28 10:34:48,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {3241#true} assume true; {3241#true} is VALID [2022-04-28 10:34:48,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3241#true} {3241#true} #76#return; {3241#true} is VALID [2022-04-28 10:34:48,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {3241#true} call #t~ret5 := main(); {3241#true} is VALID [2022-04-28 10:34:48,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {3241#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3246#(= main_~l~0 0)} is VALID [2022-04-28 10:34:48,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {3246#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3246#(= main_~l~0 0)} is VALID [2022-04-28 10:34:48,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {3246#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3246#(= main_~l~0 0)} is VALID [2022-04-28 10:34:48,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {3246#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3246#(= main_~l~0 0)} is VALID [2022-04-28 10:34:48,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {3246#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {3247#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:34:48,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {3247#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3247#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:34:48,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {3247#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3247#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:34:48,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {3247#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3247#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:34:48,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {3247#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3247#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:34:48,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {3247#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {3247#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:34:48,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {3247#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {3247#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:34:48,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {3247#(and (<= 1 main_~l~0) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {3248#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} is VALID [2022-04-28 10:34:48,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {3248#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3248#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} is VALID [2022-04-28 10:34:48,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {3248#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3248#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} is VALID [2022-04-28 10:34:48,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {3248#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 2 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {3242#false} is VALID [2022-04-28 10:34:48,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {3242#false} ~l~0 := 1 + ~l~0; {3242#false} is VALID [2022-04-28 10:34:48,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {3242#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {3242#false} is VALID [2022-04-28 10:34:48,688 INFO L272 TraceCheckUtils]: 22: Hoare triple {3242#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3242#false} is VALID [2022-04-28 10:34:48,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {3242#false} ~cond := #in~cond; {3242#false} is VALID [2022-04-28 10:34:48,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {3242#false} assume 0 == ~cond; {3242#false} is VALID [2022-04-28 10:34:48,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {3242#false} assume !false; {3242#false} is VALID [2022-04-28 10:34:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:48,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:34:48,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121483163] [2022-04-28 10:34:48,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121483163] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:34:48,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169910358] [2022-04-28 10:34:48,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:34:48,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:34:48,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:34:48,707 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:34:48,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 10:34:48,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:34:48,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:34:48,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:34:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:34:48,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:34:49,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {3241#true} call ULTIMATE.init(); {3241#true} is VALID [2022-04-28 10:34:49,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {3241#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; {3241#true} is VALID [2022-04-28 10:34:49,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {3241#true} assume true; {3241#true} is VALID [2022-04-28 10:34:49,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3241#true} {3241#true} #76#return; {3241#true} is VALID [2022-04-28 10:34:49,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {3241#true} call #t~ret5 := main(); {3241#true} is VALID [2022-04-28 10:34:49,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {3241#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3268#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:49,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {3268#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3268#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:49,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {3268#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3268#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:49,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {3268#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3278#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:49,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {3278#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:49,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {3282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:49,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {3282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:49,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {3282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:49,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {3282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:49,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {3282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {3282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:49,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {3282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {3301#(and (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:49,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {3301#(and (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3305#(and (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:49,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {3305#(and (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3305#(and (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:49,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {3305#(and (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3305#(and (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:34:49,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {3305#(and (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {3315#(and (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} is VALID [2022-04-28 10:34:49,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {3315#(and (= main_~j~0 0) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {3319#(and (= main_~j~0 0) (= (+ (- 2) main_~l~0) 1) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:34:49,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {3319#(and (= main_~j~0 0) (= (+ (- 2) main_~l~0) 1) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {3319#(and (= main_~j~0 0) (= (+ (- 2) main_~l~0) 1) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-28 10:34:49,222 INFO L272 TraceCheckUtils]: 22: Hoare triple {3319#(and (= main_~j~0 0) (= (+ (- 2) main_~l~0) 1) (= (+ (- 1) main_~k~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3326#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:34:49,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {3326#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3330#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:34:49,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {3330#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3242#false} is VALID [2022-04-28 10:34:49,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {3242#false} assume !false; {3242#false} is VALID [2022-04-28 10:34:49,223 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:34:49,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:34:49,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {3242#false} assume !false; {3242#false} is VALID [2022-04-28 10:34:49,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {3330#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3242#false} is VALID [2022-04-28 10:34:49,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {3326#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3330#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:34:49,470 INFO L272 TraceCheckUtils]: 22: Hoare triple {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3326#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:34:49,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:49,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {3353#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:51,582 WARN L290 TraceCheckUtils]: 19: Hoare triple {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {3353#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:34:51,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:51,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:51,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {3353#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:51,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {3353#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-28 10:34:51,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:51,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:51,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:51,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:51,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:51,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:53,754 WARN L290 TraceCheckUtils]: 8: Hoare triple {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3353#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:34:53,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:53,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:53,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {3241#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3346#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:34:53,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {3241#true} call #t~ret5 := main(); {3241#true} is VALID [2022-04-28 10:34:53,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3241#true} {3241#true} #76#return; {3241#true} is VALID [2022-04-28 10:34:53,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {3241#true} assume true; {3241#true} is VALID [2022-04-28 10:34:53,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {3241#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; {3241#true} is VALID [2022-04-28 10:34:53,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {3241#true} call ULTIMATE.init(); {3241#true} is VALID [2022-04-28 10:34:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 10:34:53,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169910358] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:34:53,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:34:53,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-28 10:34:53,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:34:53,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [140647383] [2022-04-28 10:34:53,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [140647383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:34:53,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:34:53,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:34:53,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315874707] [2022-04-28 10:34:53,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:34:53,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 10:34:53,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:34:53,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:34:58,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 19 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:34:58,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:34:58,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:34:58,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:34:58,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:34:58,071 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:00,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:35:02,236 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:35:04,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:35:06,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:35:08,673 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:35:13,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:35:15,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:35:17,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:35:19,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:35:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:19,745 INFO L93 Difference]: Finished difference Result 58 states and 85 transitions. [2022-04-28 10:35:19,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:35:19,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 10:35:19,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:35:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-28 10:35:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-28 10:35:19,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-28 10:35:24,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 39 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:35:24,034 INFO L225 Difference]: With dead ends: 58 [2022-04-28 10:35:24,034 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 10:35:24,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:35:24,035 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:35:24,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 9 Unknown, 0 Unchecked, 18.7s Time] [2022-04-28 10:35:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 10:35:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-04-28 10:35:24,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:35:24,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 10:35:24,077 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 10:35:24,077 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 10:35:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:24,078 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2022-04-28 10:35:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2022-04-28 10:35:24,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:35:24,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:35:24,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 53 states. [2022-04-28 10:35:24,078 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 53 states. [2022-04-28 10:35:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:35:24,082 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2022-04-28 10:35:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2022-04-28 10:35:24,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:35:24,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:35:24,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:35:24,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:35:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 10:35:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2022-04-28 10:35:24,084 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 26 [2022-04-28 10:35:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:35:24,084 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2022-04-28 10:35:24,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:24,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 58 transitions. [2022-04-28 10:35:41,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 50 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2022-04-28 10:35:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-04-28 10:35:41,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:35:41,097 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:35:41,098 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:35:41,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 10:35:41,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 10:35:41,298 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:35:41,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:35:41,298 INFO L85 PathProgramCache]: Analyzing trace with hash -625372709, now seen corresponding path program 1 times [2022-04-28 10:35:41,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:35:41,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1729005172] [2022-04-28 10:35:41,303 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:35:41,303 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:35:41,303 INFO L85 PathProgramCache]: Analyzing trace with hash -625372709, now seen corresponding path program 2 times [2022-04-28 10:35:41,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:35:41,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384211407] [2022-04-28 10:35:41,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:35:41,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:35:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:41,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:35:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:41,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {3728#(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; {3720#true} is VALID [2022-04-28 10:35:41,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-28 10:35:41,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3720#true} {3720#true} #76#return; {3720#true} is VALID [2022-04-28 10:35:41,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {3720#true} call ULTIMATE.init(); {3728#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:35:41,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {3728#(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; {3720#true} is VALID [2022-04-28 10:35:41,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-28 10:35:41,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3720#true} {3720#true} #76#return; {3720#true} is VALID [2022-04-28 10:35:41,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {3720#true} call #t~ret5 := main(); {3720#true} is VALID [2022-04-28 10:35:41,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {3720#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3725#(= main_~l~0 0)} is VALID [2022-04-28 10:35:41,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {3725#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3725#(= main_~l~0 0)} is VALID [2022-04-28 10:35:41,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {3725#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3725#(= main_~l~0 0)} is VALID [2022-04-28 10:35:41,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {3725#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3725#(= main_~l~0 0)} is VALID [2022-04-28 10:35:41,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {3725#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {3726#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:35:41,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {3726#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3726#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:35:41,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {3726#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3726#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:35:41,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {3726#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3726#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:35:41,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {3726#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3726#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:35:41,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {3726#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {3726#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:35:41,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {3726#(and (<= 1 main_~l~0) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {3727#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-28 10:35:41,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {3727#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3727#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-28 10:35:41,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {3727#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3727#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-28 10:35:41,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {3727#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3727#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-28 10:35:41,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {3727#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3727#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-28 10:35:41,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {3727#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {3727#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-28 10:35:41,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {3727#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {3721#false} is VALID [2022-04-28 10:35:41,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {3721#false} ~l~0 := 1 + ~l~0; {3721#false} is VALID [2022-04-28 10:35:41,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {3721#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {3721#false} is VALID [2022-04-28 10:35:41,376 INFO L272 TraceCheckUtils]: 24: Hoare triple {3721#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3721#false} is VALID [2022-04-28 10:35:41,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {3721#false} ~cond := #in~cond; {3721#false} is VALID [2022-04-28 10:35:41,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {3721#false} assume 0 == ~cond; {3721#false} is VALID [2022-04-28 10:35:41,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {3721#false} assume !false; {3721#false} is VALID [2022-04-28 10:35:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:35:41,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:35:41,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384211407] [2022-04-28 10:35:41,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384211407] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:35:41,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159454247] [2022-04-28 10:35:41,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:35:41,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:35:41,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:35:41,378 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:35:41,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 10:35:41,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:35:41,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:35:41,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:35:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:35:41,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:35:41,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {3720#true} call ULTIMATE.init(); {3720#true} is VALID [2022-04-28 10:35:41,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {3720#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; {3720#true} is VALID [2022-04-28 10:35:41,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-28 10:35:41,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3720#true} {3720#true} #76#return; {3720#true} is VALID [2022-04-28 10:35:41,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {3720#true} call #t~ret5 := main(); {3720#true} is VALID [2022-04-28 10:35:41,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {3720#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3747#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {3747#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3747#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {3747#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3747#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {3747#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3757#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {3757#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3761#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {3761#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3761#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {3761#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3761#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {3761#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3761#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {3761#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3761#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {3761#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {3777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {3777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {3781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {3781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {3781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {3781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {3781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {3781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {3781#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {3800#(and (= main_~j~0 0) (= main_~i~0 1) (= main_~k~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {3800#(and (= main_~j~0 0) (= main_~i~0 1) (= main_~k~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3804#(and (= main_~j~0 0) (= main_~i~0 1) (= main_~k~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {3804#(and (= main_~j~0 0) (= main_~i~0 1) (= main_~k~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {3804#(and (= main_~j~0 0) (= main_~i~0 1) (= main_~k~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:35:41,919 INFO L272 TraceCheckUtils]: 24: Hoare triple {3804#(and (= main_~j~0 0) (= main_~i~0 1) (= main_~k~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:35:41,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {3811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:35:41,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {3815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3721#false} is VALID [2022-04-28 10:35:41,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {3721#false} assume !false; {3721#false} is VALID [2022-04-28 10:35:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:35:41,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:35:42,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {3721#false} assume !false; {3721#false} is VALID [2022-04-28 10:35:42,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {3815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3721#false} is VALID [2022-04-28 10:35:42,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {3811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:35:42,197 INFO L272 TraceCheckUtils]: 24: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:35:42,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:42,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {3838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:42,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {3838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-28 10:35:42,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:42,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:42,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:42,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:42,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:42,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {3838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:44,353 WARN L290 TraceCheckUtils]: 14: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {3838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:35:44,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:44,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:44,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:44,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:44,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {3838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:46,465 WARN L290 TraceCheckUtils]: 8: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {3838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:35:46,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:46,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:46,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {3720#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3831#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:35:46,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {3720#true} call #t~ret5 := main(); {3720#true} is VALID [2022-04-28 10:35:46,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3720#true} {3720#true} #76#return; {3720#true} is VALID [2022-04-28 10:35:46,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {3720#true} assume true; {3720#true} is VALID [2022-04-28 10:35:46,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {3720#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; {3720#true} is VALID [2022-04-28 10:35:46,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {3720#true} call ULTIMATE.init(); {3720#true} is VALID [2022-04-28 10:35:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:35:46,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159454247] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:35:46,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:35:46,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-28 10:35:46,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:35:46,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1729005172] [2022-04-28 10:35:46,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1729005172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:35:46,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:35:46,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:35:46,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671745118] [2022-04-28 10:35:46,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:35:46,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 10:35:46,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:35:46,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:50,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 19 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:35:50,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:35:50,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:35:50,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:35:50,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:35:50,729 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:35:52,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:35:54,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:35:57,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:35:59,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:36:01,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:36:03,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:36:07,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:36:10,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:36:12,249 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:36:12,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:36:12,458 INFO L93 Difference]: Finished difference Result 71 states and 107 transitions. [2022-04-28 10:36:12,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:36:12,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 10:36:12,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:36:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-28 10:36:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-28 10:36:12,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-28 10:36:16,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 39 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:36:16,795 INFO L225 Difference]: With dead ends: 71 [2022-04-28 10:36:16,795 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 10:36:16,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:36:16,796 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:36:16,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 9 Unknown, 0 Unchecked, 18.5s Time] [2022-04-28 10:36:16,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 10:36:16,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-28 10:36:16,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:36:16,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 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 10:36:16,864 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 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 10:36:16,864 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 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 10:36:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:36:16,865 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-28 10:36:16,865 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-28 10:36:16,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:36:16,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:36:16,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 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 66 states. [2022-04-28 10:36:16,866 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 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 66 states. [2022-04-28 10:36:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:36:16,866 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-28 10:36:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-28 10:36:16,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:36:16,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:36:16,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:36:16,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:36:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 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 10:36:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2022-04-28 10:36:16,868 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 28 [2022-04-28 10:36:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:36:16,868 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2022-04-28 10:36:16,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:36:16,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 102 transitions. [2022-04-28 10:36:57,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 83 inductive. 0 not inductive. 19 times theorem prover too weak to decide inductivity. [2022-04-28 10:36:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-28 10:36:57,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:36:57,387 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:36:57,387 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:36:57,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 10:36:57,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:36:57,587 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:36:57,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:36:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1068183491, now seen corresponding path program 1 times [2022-04-28 10:36:57,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:36:57,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [535028261] [2022-04-28 10:36:57,593 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:36:57,594 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:36:57,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1068183491, now seen corresponding path program 2 times [2022-04-28 10:36:57,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:36:57,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733943997] [2022-04-28 10:36:57,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:36:57,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:36:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:36:57,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:36:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:36:57,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {4323#(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; {4315#true} is VALID [2022-04-28 10:36:57,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {4315#true} assume true; {4315#true} is VALID [2022-04-28 10:36:57,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4315#true} {4315#true} #76#return; {4315#true} is VALID [2022-04-28 10:36:57,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {4315#true} call ULTIMATE.init(); {4323#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:36:57,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {4323#(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; {4315#true} is VALID [2022-04-28 10:36:57,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {4315#true} assume true; {4315#true} is VALID [2022-04-28 10:36:57,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4315#true} {4315#true} #76#return; {4315#true} is VALID [2022-04-28 10:36:57,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {4315#true} call #t~ret5 := main(); {4315#true} is VALID [2022-04-28 10:36:57,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {4315#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4320#(= main_~l~0 0)} is VALID [2022-04-28 10:36:57,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {4320#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {4320#(= main_~l~0 0)} is VALID [2022-04-28 10:36:57,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {4320#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4320#(= main_~l~0 0)} is VALID [2022-04-28 10:36:57,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {4320#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {4320#(= main_~l~0 0)} is VALID [2022-04-28 10:36:57,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {4320#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {4321#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:36:57,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {4321#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4321#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:36:57,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {4321#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {4321#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:36:57,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {4321#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {4321#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:36:57,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {4321#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {4321#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:36:57,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {4321#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {4321#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-28 10:36:57,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {4321#(and (<= 1 main_~l~0) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {4322#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-28 10:36:57,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {4322#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4322#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-28 10:36:57,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {4322#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {4322#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-28 10:36:57,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {4322#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {4322#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-28 10:36:57,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {4322#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {4322#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-28 10:36:57,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {4322#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {4322#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} is VALID [2022-04-28 10:36:57,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {4322#(and (not (<= (div main_~l~0 2) 0)) (<= main_~l~0 (* 2 (div main_~l~0 2))))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {4316#false} is VALID [2022-04-28 10:36:57,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {4316#false} ~l~0 := 1 + ~l~0; {4316#false} is VALID [2022-04-28 10:36:57,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {4316#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4316#false} is VALID [2022-04-28 10:36:57,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {4316#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {4316#false} is VALID [2022-04-28 10:36:57,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {4316#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {4316#false} is VALID [2022-04-28 10:36:57,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {4316#false} ~l~0 := 1 + ~l~0; {4316#false} is VALID [2022-04-28 10:36:57,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {4316#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {4316#false} is VALID [2022-04-28 10:36:57,698 INFO L272 TraceCheckUtils]: 28: Hoare triple {4316#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4316#false} is VALID [2022-04-28 10:36:57,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {4316#false} ~cond := #in~cond; {4316#false} is VALID [2022-04-28 10:36:57,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {4316#false} assume 0 == ~cond; {4316#false} is VALID [2022-04-28 10:36:57,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {4316#false} assume !false; {4316#false} is VALID [2022-04-28 10:36:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:36:57,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:36:57,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733943997] [2022-04-28 10:36:57,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733943997] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:36:57,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737906111] [2022-04-28 10:36:57,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:36:57,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:36:57,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:36:57,700 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:36:57,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 10:36:57,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:36:57,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:36:57,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:36:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:36:57,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:36:58,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {4315#true} call ULTIMATE.init(); {4315#true} is VALID [2022-04-28 10:36:58,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {4315#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; {4315#true} is VALID [2022-04-28 10:36:58,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {4315#true} assume true; {4315#true} is VALID [2022-04-28 10:36:58,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4315#true} {4315#true} #76#return; {4315#true} is VALID [2022-04-28 10:36:58,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {4315#true} call #t~ret5 := main(); {4315#true} is VALID [2022-04-28 10:36:58,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {4315#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4342#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {4342#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {4342#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {4342#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4342#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {4342#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {4352#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {4352#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {4356#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {4356#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4356#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {4356#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {4356#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {4356#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {4356#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {4356#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {4356#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {4356#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {4372#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {4372#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {4376#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {4376#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4376#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {4376#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {4376#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {4376#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {4376#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {4376#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {4376#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {4376#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {4376#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {4376#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {4395#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~k~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {4395#(and (= main_~l~0 2) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~k~0 1) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {4399#(and (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~k~0 1) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {4399#(and (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~k~0 1) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4399#(and (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~k~0 1) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {4399#(and (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~k~0 1) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {4399#(and (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~k~0 1) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-28 10:36:58,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {4399#(and (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~k~0 1) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {4409#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~k~0 1) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-28 10:36:58,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {4409#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~k~0 1) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} ~l~0 := 1 + ~l~0; {4413#(and (= main_~l~0 4) (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~k~0 1) (= main_~v4~0 0))} is VALID [2022-04-28 10:36:58,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {4413#(and (= main_~l~0 4) (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~k~0 1) (= main_~v4~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {4413#(and (= main_~l~0 4) (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~k~0 1) (= main_~v4~0 0))} is VALID [2022-04-28 10:36:58,413 INFO L272 TraceCheckUtils]: 28: Hoare triple {4413#(and (= main_~l~0 4) (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 1) (= main_~k~0 1) (= main_~v4~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4420#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:36:58,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {4420#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4424#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:36:58,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {4424#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4316#false} is VALID [2022-04-28 10:36:58,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {4316#false} assume !false; {4316#false} is VALID [2022-04-28 10:36:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:36:58,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:36:58,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {4316#false} assume !false; {4316#false} is VALID [2022-04-28 10:36:58,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {4424#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4316#false} is VALID [2022-04-28 10:36:58,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {4420#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4424#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:36:58,751 INFO L272 TraceCheckUtils]: 28: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4420#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:36:58,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:36:58,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {4447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:00,862 WARN L290 TraceCheckUtils]: 25: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {4447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:37:00,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:00,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:00,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {4447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:00,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {4447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-28 10:37:00,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:00,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:00,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:00,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:00,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:00,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {4447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:03,001 WARN L290 TraceCheckUtils]: 14: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {4447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:37:03,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:03,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:03,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:03,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:03,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {4447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:05,110 WARN L290 TraceCheckUtils]: 8: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {4447#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-28 10:37:05,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:05,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:05,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {4315#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4440#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-28 10:37:05,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {4315#true} call #t~ret5 := main(); {4315#true} is VALID [2022-04-28 10:37:05,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4315#true} {4315#true} #76#return; {4315#true} is VALID [2022-04-28 10:37:05,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {4315#true} assume true; {4315#true} is VALID [2022-04-28 10:37:05,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {4315#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; {4315#true} is VALID [2022-04-28 10:37:05,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {4315#true} call ULTIMATE.init(); {4315#true} is VALID [2022-04-28 10:37:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 10:37:05,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737906111] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:37:05,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:37:05,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 13] total 19 [2022-04-28 10:37:05,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:37:05,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [535028261] [2022-04-28 10:37:05,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [535028261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:37:05,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:37:05,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:37:05,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387575908] [2022-04-28 10:37:05,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:37:05,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 10:37:05,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:37:05,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:11,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 19 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 10:37:11,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:37:11,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:37:11,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:37:11,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:37:11,491 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:13,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:37:15,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:37:17,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:37:20,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:37:20,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:37:20,378 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-28 10:37:20,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:37:20,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 10:37:20,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:37:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-28 10:37:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-28 10:37:20,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-28 10:37:26,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 21 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 10:37:26,815 INFO L225 Difference]: With dead ends: 66 [2022-04-28 10:37:26,815 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:37:26,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:37:26,816 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:37:26,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 4 Unknown, 0 Unchecked, 8.1s Time] [2022-04-28 10:37:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:37:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:37:26,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:37:26,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:37:26,817 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:37:26,817 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:37:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:37:26,817 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:37:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:37:26,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:37:26,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:37:26,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:37:26,818 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:37:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:37:26,818 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:37:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:37:26,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:37:26,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:37:26,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:37:26,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:37:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:37:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:37:26,818 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2022-04-28 10:37:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:37:26,818 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:37:26,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:37:26,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:37:26,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:37:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:37:26,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:37:26,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:37:26,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 10:37:27,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 10:37:27,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:37:27,442 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 10:37:27,442 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 10:37:27,443 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 10:37:27,443 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-28 10:37:27,443 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-28 10:37:27,443 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-28 10:37:27,443 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-28 10:37:27,443 INFO L895 garLoopResultBuilder]: At program point L31(lines 31 34) the Hoare annotation is: (or (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-28 10:37:27,443 INFO L895 garLoopResultBuilder]: At program point L29(lines 29 34) the Hoare annotation is: (or (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-28 10:37:27,443 INFO L895 garLoopResultBuilder]: At program point L31-2(lines 23 34) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001)) (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))) [2022-04-28 10:37:27,443 INFO L895 garLoopResultBuilder]: At program point L27(lines 27 34) the Hoare annotation is: (or (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-28 10:37:27,443 INFO L895 garLoopResultBuilder]: At program point L25(lines 25 34) the Hoare annotation is: (or (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-28 10:37:27,443 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 16 39) the Hoare annotation is: true [2022-04-28 10:37:27,443 INFO L895 garLoopResultBuilder]: At program point L23(lines 23 34) the Hoare annotation is: (or (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-28 10:37:27,443 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 36) the Hoare annotation is: (or (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-28 10:37:27,443 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 36) the Hoare annotation is: (or (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-28 10:37:27,444 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 16 39) the Hoare annotation is: true [2022-04-28 10:37:27,444 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 16 39) the Hoare annotation is: true [2022-04-28 10:37:27,444 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-28 10:37:27,444 INFO L902 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: true [2022-04-28 10:37:27,444 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-28 10:37:27,444 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 10:37:27,444 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-28 10:37:27,444 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:37:27,444 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-28 10:37:27,444 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:37:27,444 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:37:27,444 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-28 10:37:27,444 INFO L895 garLoopResultBuilder]: At program point L10(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:37:27,444 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: true [2022-04-28 10:37:27,444 INFO L895 garLoopResultBuilder]: At program point L9(lines 9 11) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 10:37:27,444 INFO L902 garLoopResultBuilder]: At program point L9-2(lines 8 13) the Hoare annotation is: true [2022-04-28 10:37:27,444 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:37:27,446 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 10:37:27,448 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:37:27,449 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:37:27,459 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 10:37:27,460 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:37:27,461 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 10:37:27,461 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 10:37:27,463 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-28 10:37:33,856 INFO L163 areAnnotationChecker]: CFG has 34 edges. 31 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:37:33,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:37:33 BoogieIcfgContainer [2022-04-28 10:37:33,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:37:33,863 INFO L158 Benchmark]: Toolchain (without parser) took 525634.87ms. Allocated memory was 190.8MB in the beginning and 235.9MB in the end (delta: 45.1MB). Free memory was 142.1MB in the beginning and 90.0MB in the end (delta: 52.1MB). Peak memory consumption was 98.0MB. Max. memory is 8.0GB. [2022-04-28 10:37:33,863 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory was 158.2MB in the beginning and 158.2MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:37:33,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.07ms. Allocated memory is still 190.8MB. Free memory was 141.9MB in the beginning and 167.1MB in the end (delta: -25.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 10:37:33,864 INFO L158 Benchmark]: Boogie Preprocessor took 40.25ms. Allocated memory is still 190.8MB. Free memory was 167.1MB in the beginning and 165.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 10:37:33,864 INFO L158 Benchmark]: RCFGBuilder took 6774.06ms. Allocated memory is still 190.8MB. Free memory was 165.6MB in the beginning and 152.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 10:37:33,864 INFO L158 Benchmark]: TraceAbstraction took 518603.24ms. Allocated memory was 190.8MB in the beginning and 235.9MB in the end (delta: 45.1MB). Free memory was 151.9MB in the beginning and 90.0MB in the end (delta: 62.0MB). Peak memory consumption was 108.1MB. Max. memory is 8.0GB. [2022-04-28 10:37:33,864 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.12ms. Allocated memory is still 190.8MB. Free memory was 158.2MB in the beginning and 158.2MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.07ms. Allocated memory is still 190.8MB. Free memory was 141.9MB in the beginning and 167.1MB in the end (delta: -25.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.25ms. Allocated memory is still 190.8MB. Free memory was 167.1MB in the beginning and 165.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 6774.06ms. Allocated memory is still 190.8MB. Free memory was 165.6MB in the beginning and 152.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 518603.24ms. Allocated memory was 190.8MB in the beginning and 235.9MB in the end (delta: 45.1MB). Free memory was 151.9MB in the beginning and 90.0MB in the end (delta: 62.0MB). Peak memory consumption was 108.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 512.1s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 268.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 74 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 155.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 580 SdHoareTripleChecker+Invalid, 151.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 393 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 589 IncrementalHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 187 mSDtfsCounter, 589 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 585 GetRequests, 365 SyntacticMatches, 37 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=12, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 45 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 98 PreInvPairs, 145 NumberOfFragments, 273 HoareAnnotationTreeSize, 98 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1739 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((i + k + j + v3 + v2 + v4) % 4294967296 == l % 4294967296 || !(20000001 <= SIZE)) || !(SIZE <= 20000001) - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 10:37:33,887 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...